Abstract
This paper presents a new image coding method in which the image blocks are assigned to different classes learned by the EM algorithm. Each class is matched to a multidimensional Gaussian density function and the Karhunen-Loeve Transform (KLT), followed by optimal quantization and coding, is applied to each one of them. The performance of this Class-KLT coder is compared to the classical KLT coder (one class) showing appreciable improvement in image quality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B39, 1–38 (1977)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, Chichester (2001)
Jain, A.K.: Fundamentals of Digital Image Processing. Prentice-Hall, Englewood Cliffs (1989)
Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression. Wiley, Chichester (1994)
Gray, R.M.: Gauss mixture vector quantization. In: Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (2001)
Ortega, A., Vetterli, M.: Adaptive Scalar quantization without side information. IEEE Trans. on Image Processing 6, 665–676 (1997)
Subramaniam, A.D., Rao, B.D.: PDF optimized parametric vector quantization of speech line spectral frequencies. In: Proc. IEEE Workshop on Speech Coding (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Budillon, A., Palmieri, F. (2003). Multi-class Image Coding via EM-KLT Algorithm. In: Apolloni, B., Marinaro, M., Tagliaferri, R. (eds) Neural Nets. WIRN 2003. Lecture Notes in Computer Science, vol 2859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45216-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-45216-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20227-1
Online ISBN: 978-3-540-45216-4
eBook Packages: Springer Book Archive