Fast fractal compression of greyscale images

  • Authors:
  • J. Cardinal

  • Affiliations:
  • Dept. of Comput. Sci., Brussels Free Univ.

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

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