Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Approximate nearest neighbour search for fractal image compression based on a new affine transform parametrization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Since the birth of fractal image compression, there has been numerous research which aimed at speeding up the encoding step. One of the most innovative and promising approaches was by converting the range-domain block matching problem to a nearest neighbour search problem. However, the conventional approach suffers from two drawbacks: quantization errors of the affine transform parameters and the large memory requirement. This paper presents some enhancements to the approach based on a new affine transform parametrization. Experiments showed that our technique is able to improve the fidelity and significantly reduce memory requirement with similar encoding time and compression ratio

Published in:

Pattern Recognition, 2000. Proceedings. 15th International Conference on  (Volume:3 )

Date of Conference:

2000