Abstract
The paper describes a new technique to compress binary images based on an image covering algorithm. The idea is that binary images can be always covered by rectangles, univocally described by a vertex and two adjacent edges (L-shape). Some optimisations are necessary to consider degenerate configurations. The method has been tested on several images representing drawings and typed texts. The comparison with existing image file compression techniques shows a good performance of our approach. Further optimisations are under development.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.Jain, “Image data compression: a review”, IEEE Proc., Vol.69, 1981.
R.J.Clarke,“Transform coding of images”, Academic Press, 1985.
A.Leger, T.Omachi, G.K.Wallace, “JPEG still compression algorithm”, Opt.Engineering, Vol.30, pp.947–954, 1991.
N.Ahmed, K.R.Rao,“Ortogonal transform for digitalsignal processing”, Springer-Verlag, 1975
R.Haralick, N.Griswold, N.Kattiyakulwanich, “A fast two-dimensional Kharunen Loève transform”, SPIE Semin.Proc., Vol.66, 1975.
G.Martinelli, L.Ricotti, G.Marcone, “Neural clustering for optimal KLT image compression”, IEEE Trans. on Signal Processing, Vol.41, No.4, 1993.
D.J.Healy, O.R.Mitchell, “Image compression using block truncation coding”, IEEE Trans.Comm., COM-29, No. 12, 1981.
F.M.Barnsley, A.D.Sloan, “A better way to compress images”, BYTE, January, 1988.
D.A.Huffman,“A method for the construction of minimum redundancy codes”, Proc.IRE, Vol.40, 1952.
A.Daaboul, M.Zipstein,“Un algorithme de compression d'images sans perte d'information”, Tech.Rep. IGM 94-11, Université de Marne La Vallée, 1994.
F.De Coulon, O.Johsen, “Adaptive block scheme for source coding of black-and-white facsimile”, Electronic Letters, Vol. 12, No.3, 1976.
H.Samet, “The quad-trees and related hierarchical data structure”, ACM Comput.Survey, Vol.16, 1984.
Y.Cheng, S.Iyengar, R.Kashyap, “A new method of image compression using irreducible covers of maximal rectangles”, IEEE Trans.on Software Ingineering, Vol.14, No.5, 1988.
J.Serra, “Image Analysis and Mathematical Morphology”, Academic Press, New York, 1982.
J. Serra, “Image Analysis and Mathematical Morphology: Vol. 2”, Academic Press, N. York, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gesù, V., Mantaci, S., Tortorici, G. (1995). Compression of binary images based on covering. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_346
Download citation
DOI: https://doi.org/10.1007/3-540-60268-2_346
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60268-2
Online ISBN: 978-3-540-44781-8
eBook Packages: Springer Book Archive