Adaptive approximate nearest neighbor search for fractal image compression

Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks 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 encoding is to convert the range-domain block matching problem to a nearest neighbor search problem. This paper presents an improved formulation of approximate nearest neighbor search based on orthogonal projection and prequantization 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 ratio, while significantly reduce memory requirement and encoding time.

• Type: Journal
• Year: 2002
• Where: TIP
• Authors: Chong Sze Tong, Man Wong
• Keywords: Approximate Nearest Neighbor, Nearest Neighbor Search, Neighbor Search Problem, TIP 2002