A review of the fractal image compression literature
ACM SIGGRAPH Computer Graphics
Advances in fractal compression for multimedia applications
Multimedia Systems
Accelerating fractal image compression by multi-dimensional nearest neighbor search
DCC '95 Proceedings of the Conference on Data Compression
| Hi-index | 0.00 |
In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried out while trying to find a best match for another image portion. We show that this step can be replaced by multi-dimensional nearest neighbor search which runs in logarithmic time instead of linear time required for the common sequential search.