Fractal image compression based on delaunay triangulation and vector quantization

This paper presents a new scheme for fractal image compression based on adaptive Delaunay triangulation, Such a partition is computed on an initial set of points obtained with a split and merge algorithm in a grey level dependent way, The triangulation is thus fully flexible and returns a limited number of blocks allowing good compression ratios, Moreover, a second original approach is the integration of a classification step based on a modified version of the Lloyd algorithm (vector quantization) in order to reduce the encoding complexity, The vector quantization algorithm is implemented on pixel histograms directly generated from the triangulation. The aim is to reduce the number of comparisons between the two sets of blocks involved in fractal image compression by keeping only the best representative triangles in the domain blocks set, Quality coding results are achieved at rates between 0.25-0.5 b/pixel depending on the nature of the original image and on the number of triangles retained.