Fractals everywhere
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The JPEG still picture compression standard
Communications of the ACM - Special issue on digital multimedia systems
COMPCON '92 Proceedings of the thirty-seventh international conference on COMPCON
Image compression: a study of the iterated transform method
Signal Processing
Information organization in multimedia resources
SIGDOC '93 Proceedings of the 11th annual international conference on Systems documentation
Fractal image compression: theory and application
Fractal image compression: theory and application
Harnessing chaos for image synthesis
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Accelerating fractal image compression by multi-dimensional nearest neighbor search
DCC '95 Proceedings of the Conference on Data Compression
Convergence of fractal encoded images
DCC '95 Proceedings of the Conference on Data Compression
Breaking the Time Complexity of Fractal Image Compression
Breaking the Time Complexity of Fractal Image Compression
| Hi-index | 0.00 |
Fractal image compression is a promising new technology but is not without problems. Most critically, fast encoding is required for it to find wide use in multimedia applications. This is now within reach: recent methods are five orders of magnitude faster than early attempts. Beginning with the basic ideas and problems, this paper explains how to accelerate fractal image compression.