Sciweavers

Share
DCC
1995
IEEE

Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search

10 years 6 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: 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. Our theory developed here shows that this basic procedure of fractal image compression is equivalent to multi-dimensional nearest neighbor search. This result is useful for accelerating the encoding procedure in fractal image compression. The traditional sequential search takes linear time whereas the nearest neighbor search can be organized to require only logarithmic time. The fast search has been integrated into an existing state-of-the-art classification method thereby accelerating the searches carried out in the individual domain classes.
Dietmar Saupe
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where DCC
Authors Dietmar Saupe
Comments (0)
books