By Topic

Fast fractal compression of greyscale images

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
$33 $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

1 Author(s)
J. Cardinal ; Dept. of Comput. Sci., Brussels Free Univ., Belgium

A new algorithm for fractal compression of greyscale images is presented. It uses some previous results allowing the compression process to be reduced to a nearest neighbors problem, and is essentially based on a geometrical partition of the image block feature space. Experimental comparisons with previously published methods show a significant improvement in speed with no quality loss

Published in:

IEEE Transactions on Image Processing  (Volume:10 ,  Issue: 1 )