C. S. Tong, M. Wong. Adaptive Approximate Nearest Neighbor Search for Fractal Image Compression. IEEE Transactions on Image Processing, 11(6):605-615, 2002.
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between subblocks by repeatedly searching a large virtual codebook constructed from the image under compression. One of the most innovative and promising approaches to speed up the coding is to convert the range-domain matching problem to a nearest neighbor search problem. This paper presents an improved formulation of approximate nearest neighbor search based on orthogonal projection and pre-quantization of the fractal transform parameters. Furthermore, an optimal adaptive scheme is derived for the approximate search parameter to further enhance the performance of the new algorithm. Experimental results showed that our new technique is able to improve both the fidelity and compression ration, while significantly reduce memory requirements and encoding time
Download paper:
Adobe PDF
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
@article{ToWo02,
Author = {Tong, C. S. and Wong, M.},
Title = {Adaptive Approximate Nearest Neighbor Search for Fractal Image Compression},
Journal = {IEEE Transactions on Image Processing},
Volume = {11},
Number = {6},
Pages = {605--615},
Publisher = {},
Year = {2002}
}