A PRIMAL-DUAL ALGORITHM FOR ROBUST FRACTAL IMAGE CODING

Abstract

The essence of Huber fractal image coding (HFIC) is to predict the fractal code of a noiseless image as accurately as possible from its corrupted observation with outliers by adopting Huber M-estimation technique. However, the traditional HFIC is not quite satisfactory mainly due to the absence of contractivity restriction for the estimate of the fractal parameters (actually, it is a fundamental requirement in the theory of fractal image coding). In this paper, we introduce a primal-dual algorithm for robust fractal image coding (PD-RFIC), which formulates the problem of robust prediction of the fractal parameters with contractivity condition as a constrained optimization model and then adopts a primal-dual algorithm to solve it. Furthermore, in order to relieve using the corrupted domain block as the independent variable in the proposed method, instead of using the mean operation on a [Formula: see text] subblock in the traditional HFIC, we apply a median operation on a larger subblock to obtain the contracted domain blocks for achieving the robustness against outliers. The effectiveness of the proposed method is experimentally illustrated on problems of image denoising with impulse noise (specifically, salt & pepper noise and random-valued noise). Remarkable improvements of the proposed method over conventional HFIC are demonstrated in terms of both numerical evaluations and visual quality. In addition, a median-based version of Fisher classification method is also developed to accelerate the encoding speed of the proposed method.