Nowadays fractal image coding is performed by several methods focused to reduce the number of comparisons. This work describes a simple and fast method of fractal image compression for applications in mobile communications. The method uses a quadtree scheme on multiple levels of image resolution and the fractal coding is applied taking advantage of the multiresolution decomposition. The method uses a simple scheme of blocks classification into each resolution level on a pyramidal decomposition according to size and the intensity variation level of every block. The simplicity and regularity of the method make it suitable to be implemented on programmable logic devices, such as FPGAs, or in custom VLSI integrated circuits. The method can be implemented in parallel, saving up to three orders in the number of necessary operations to codify the image, reducing the asymmetry of the coding time compared with the decoding time.
Simple and fast fractal image compression for VLSI circuits
01.01.2003
397007 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Simple and Fast Fractal Image Compression for VLSI Circuits
British Library Conference Proceedings | 2003
|Fast Iterative Methods for Fractal Image Compression
British Library Online Contents | 1999
|DCT based simple classification scheme for fractal image compression
British Library Online Contents | 2005
|Fast fractal image compression with triangulation wavelets [3458-16]
British Library Conference Proceedings | 1998
|Fast and efficient fractal image compression algorithm [3545-129]
British Library Conference Proceedings | 1998
|