4.7 Article

Robust estimation of parameter for fractal inverse problem

Journal

COMPUTERS & MATHEMATICS WITH APPLICATIONS
Volume 60, Issue 7, Pages 2099-2108

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2010.07.051

Keywords

Fractal inverse problem; Least absolute derivation; Least trimmed squares; Wilcoxon norm; Robust image compression; Particle swarm optimization

Funding

  1. National Science Council, Republic of China [NSC 98-2221-E-214-052]

Ask authors/readers for more resources

In this paper, some similarity measures for fractal image compression (FIC) are introduced, which are robust against noises. In the proposed methods, robust estimation technique from statistics is embedded into the encoding procedure of the fractal inverse problem to find the parameters. When the original image is corrupted by noises, we hope that the proposed scheme is insensitive to those noises presented in the corrupted image. This leads to a new concept of robust estimation of fractal inverse problem. The proposed least absolute derivation (LAD), least trimmed squares (LTS), and Wilcoxon FIC are the first attempt toward the design of robust fractal image compression which can remove the noises in the encoding process. The main disadvantage of the robust FIC is the computational cost. To overcome this drawback, particle swarm optimization (PSO) technique is utilized to reduce the searching time. Simulation results show that the proposed FIC is robust against the outliers in the image. Also, the PSO method can effectively reduce the encoding time while retaining the quality of the retrieved image. (C) 2010 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available