Fractal Image Compression Based on

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.

[1]  Geir E. Øien,et al.  Fractal-based image coding with fast decoder convergence , 1994, Signal Process..

[2]  Lyman P. Hurd,et al.  Fractal image compression , 1993 .

[3]  Yuval Fisher,et al.  Fractal encoding with HV partitions , 1995 .

[4]  Michel Barlaud,et al.  Image coding using wavelet transform , 1992, IEEE Trans. Image Process..

[5]  Allen Gersho,et al.  Image compression with variable block size segmentation , 1992, IEEE Trans. Signal Process..

[6]  Franck Davoine,et al.  Adaptive Delaunay triangulation for attractor image coding , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[7]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[8]  Michel Barlaud,et al.  Pyramidal lattice vector quantization for multiscale image coding , 1994, IEEE Trans. Image Process..

[9]  Thomas Hain,et al.  On the convergence of fractal transforms , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[10]  J. Chassery,et al.  Segmentation and measurement based on 3D Voronoi diagram: application to confocal microscopy. , 1993, Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society.

[11]  Frank Dudbridge,et al.  Least-squares block coding by fractal functions , 1995 .

[12]  Y. Fisher,et al.  Image compression: A study of the iterated transform method , 1992, Signal Process..

[13]  Thomas S. Huang,et al.  A fractal-based image block-coding algorithm , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[14]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[15]  Marcel Breeuwer,et al.  Fractal coding of monochrome images , 1994, Signal Process. Image Commun..

[16]  R. R. Clarke.  Transform coding of images , 1985 .

[17]  Y. Fisher.  Fractal image compression: theory and application , 1995 .

[18]  John C. Kieffer,et al.  A survey of the theory of source coding with a fidelity criterion , 1993, IEEE Trans. Inf. Theory.