Fractals everywhere
Fractal image compression: theory and application
Fractal image compression: theory and application
Fractal image compression with quadtrees
Fractal image compression
Hierarchical interpretation of fractal image coding and its applications
Fractal image compression
Fractal encoding with HV partitions
Fractal image compression
A discrete framework for fractal signal modeling
Fractal image compression
A class of fractal image coders with fast decoder convergence
Fractal image compression
The data compression book (2nd ed.)
The data compression book (2nd ed.)
Fractal Imaging
Hi-index | 0.01 |
In fractal image compression, a digital image is approximatedby the unique fixed point of a contractive affine mapping. The decoding consists of iterating the affine mapping starting from an arbitrary image until convergence to the fixed point. We show that the decoding can be accelerated by using the new pixel intensities of an image iterate as soon as they become available. We provide a mathematicalformulation of the proposed decoding and prove its convergence in a general setting. We show that under some mild restrictions the asymptotic rate of convergenceof the proposed method is greater than or equal to that of the conventionalmethod. We also discuss the use of standard iterative methods for the decoding. Finally, we show that the convergence of the proposed method can be enhanced by an ordering technique.