A fractal encoder processes the original source vector by selecting a contractive map whose unique fixed point (attractor) approximates the original. A description of the map is transmitted to the decoder. The decoder iterates the map to recover the attractor. The task of picking the map is called the inverse problem. The predominantly used, suboptimum, technique to solve the inverse problem is collage coding. In collage coding, only the first decoding iteration is optimized. We propose two new suboptimum algorithms for the inverse problem. In our approach, the encoder imitates the iterative operation of the decoder. At each step, however, a new map is used so as to keep the sequence of approximations close to the original. If the sequence converges, then the limit is an attractor, and it is a good candidate for the reconstructed vector. The description of the map corresponding to the attractor is sent to the decoder.<>
Iterative collage coding for fractal compression
Proceedings of 1st International Conference on Image Processing ; 3 ; 127-131 vol.3
1994-01-01
519011 byte
Conference paper
Electronic Resource
English
Iterative Collage Coding for Fractal Compression
British Library Conference Proceedings | 1994
|Fast Iterative Methods for Fractal Image Compression
British Library Online Contents | 1999
|Fractal Image Compression Coding Based on Variable Fractal Geometric Scale
British Library Online Contents | 2001
|Iteration-Free Fractal Coding for Image Compression Using Simulated Annealing
British Library Conference Proceedings | 2006
|Automotive engineering | 1993
|