Abstract
In this paper, we present a flexible partitioning scheme for fractal image compression based on adaptive Delaunay triangulation. Such 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 fully flexible and returns a limited number of blocks allowing good compression Ratios Moreover, a 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.06 b/pixel and 0.2 b/pixel for a PSNR between 22 and 25 dB depending on the nature of the original image and on the number of triangles refereed.
Chapter PDF
References
Behnam Bani-Eqbal, “Combining tree and feature classification in fractal encoding of images,” Depart. of computer science-University of Manchester, U. K. (1995)
Arnaud E. Jacquin, “Fractal Image Coding,” IEEE trans. review Proceeding, Vol. 81 (1993)
P. Volino, “Triangulation de Delaunay contrainte étude et implantation d’algorithmes,” Rapport de stage de DEA (1992)
J.P. Prearation and M.I.S. Shamos, “Computational Geometry, an Introduction,” Springer verlay, New York (1988)
P.J. Green and R. Sibson “Computing Dirichlet tessellation in the plane,” The computer J., Vol. 21, 173–1978
J. Vaisey and A. Gersho, “Image compression with variable block size segmentation,” IEEE trans. Signal processing, vol. 40, (1992) 2040–2060
R.M. Gray, “Vector quantization,” IEEEASSP Mag, (1986) 4–29
G.E. Oien, S. Lepsoy, “A new improved collage theorem with applications to multiresolution fractal image coding,” Speech and signal processing, (1994)
Y. Fisher, “Fractal Image Compression,” Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brahimi, Z., Saadi, K., Baraka, N. (1999). Vector Quantization-Fractal Image Coding Algorithm Based on Delaunay Triangulation. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_141
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive