Acceleration of Fractal Image Compression by Fast Nearest-Neighbor Search

Fractals ◽  
1997 ◽  
Vol 05 (supp01) ◽  
pp. 231-241
Author(s):  
Leszek Ciepliński ◽  
Czesław Jȩdrzejek ◽  
Tomasz Major

In this paper we investigate the effect of fast nearest neighbor search method on acceleration of fractal image compression. First we follow the Saupe1 encoding step of fractal image compression that uses the multi-dimensional nearest neighbor search in a projected space. Then we investigate performance of a method for finding the nearest vector called partial distortion elimination. We also propose some supplementary accelerating concepts. For all inspected methods the impact of the tolerance criterion for mean square error of block matching is examined.

Author(s):  
Federico Tombari ◽  
Samuele Salti ◽  
Luca Puglia ◽  
Giancarlo Raiconi ◽  
Luigi Di Stefano

Fractals ◽  
2009 ◽  
Vol 17 (04) ◽  
pp. 451-457 ◽  
Author(s):  
XING-YUAN WANG ◽  
FAN-PING LI ◽  
ZHI-FENG CHEN

This paper presents a fast fractal image coding method based on quadtree division, improved neighbor search and asymptotic strategy. We search the optimal matched domain block of a range block in its five nearest neighbor blocks and make asymptotic moves along the direction of potential optimal solution. If the optimal solution can not be improved, we carry out quadtree division for this range block until it caters to our demand or reaches greatest division level. The experimental results show that the coding speed of the proposed method declined slightly, but it has a better quality of reconstructed image and higher compression ratio in comparisons with no search method.


Sign in / Sign up

Export Citation Format

Share Document