Fractals everywhere
Fractal image compression: theory and application
Fractal image compression: theory and application
An Architectural Design For Parallel Fractal Compression
ASAP '96 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
A Parallel Architecture for High Speed Fractal Image Coding
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A parallel decoding algorithm for IFS codes without transient behavior
IEEE Transactions on Image Processing
Still image coding based on vector quantization and fractal approximation
IEEE Transactions on Image Processing
A wavelet-based analysis of fractal image compression
IEEE Transactions on Image Processing
A new affine transformation: its theory and application to image coding
IEEE Transactions on Circuits and Systems for Video Technology
An efficient parallel algorithm for hexagonal-based fractal image compression
International Journal of Computer Mathematics - Distributed Algorithms in Science and Engineering
| Hi-index | 0.00 |
This paper proposes a parallel architecture for quadtree-based fractal image coding. This architecture is capable of performing the fractal image coding based on quadtree partitioning without the external memory for the fixed domain pool. Since a large domain block consists of small domain blocks, the calculations of distortion for all kinds of domain blocks are performed by the summation of the distortions for the maximum-depth domain pool, which is extracted from the smallest range blocks of the neighbor processors. Fast comparison module is proposed for this architecture. This module can compute the distortions between range blocks and their eight isometric transformations by one full rotation around the center.