Abstract
Image compression plays a vital role in many online applications like Video Conferencing, High Definition Television, Satellite Communication and other applications that demand fast and massive transmission of images. In this paper, we propose a Mode based K-means method that combines K-Means and Residual Vector Quantization(RVQ) for compressing images. Three processes are involved in this approach; Partitioning and Clustering, Pruning and Construction of Master codebook and Residual vector Quantization. Extensive experiments show that this method obtains a fast solution with better compression rate and comparable PSNR than conventional K-Means algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lloyd, S.P.: Least square quantization in PCM. IEEE Trans. Inform. Theory 28, 129–137 (1982)
Ball, G.H., Hall, D.J.: PROMENADE-an on-line pattern recognition system. Stanford Research Inst. Menlo Park, Stanford University (1967)
Tou, J., Gonzalez, R.: Pattern Recognition Principles, p. 377. Addision-Wesley, Reading (1977)
Astrahan, M.M.: Speech analysis by clustering (1970)
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis, p. 342. Wiley, New York (1990)
Katsavounidis, I., Kuo, C.C.J., Zhen, Z.: A new initialization technique for generalized Lloyd iteration. IEEE. Sig. Process. Lett. 1, 144–146 (1994)
Bradley, P.S., Fayyad, U.M.: Refining initial points for K-means clustering. In: Proceeding of the 15th International Conference on Machine Learning (ICML 1998), July 24-27, pp. 91–99. ACM Press, Morgan Kaufmann, San Francisco (1998)
Fahim, A.M., Salem, A.M., Torkey, F.A., Ramadan, M.: An efficient enhanced k- means clustering algorithm. J. Zhejiang Univ. Sci. A. 7, 1626–1633 (2006)
Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proceeding of the 18th Annual ACM-SIAM Symposium of Discrete Analysis, January 7-9, pp. 1027–1035. ACM Press, New Orleans (2007)
Karteeka Pavan, K., Rao, A.A., Dattatreya Rao, A.V., Sridhar, G.R.: Single Pass Seed Selection Algorithm for k-Means. Journal of Computer Science 6(1), 60–66
Kekre, H.B., Sarode, T.K.: An Efficient Fast Algorithm to Generate Codebook for Vector Quantization. In: Proceedings of International Conference on Emerging Trends in Engineering and Technology, Thadomal Shahani, pp. 62–67
Juang, B.H., Gray, A.H.: Multiple stage vector quantization for speech coding. In: Proc. IEEE Int. Conf. Acoust. Speech,Signal Process., vol. 1, pp. 597–600 (1982)
Kossentini, F., Smith, M.J.T., Barnes, C.F.: Image Coding Using Entropy- Constrained Residual Vector Quantization. IEEE Trans. Image Processing 4, 1349–1357 (1995)
Wu, F., Sun, X.: Image Compression by Visual Pattern Vector Quantization (VPVQ). In: Data Compression Conference, 1068-0314/08 © (2008)
Somasundaram, K., Dominic, S.: Lossless VQ Index Coding Scheme for Image Compression. In: IEEE International Conference on Signal and Image Processing, vol. 1, pp. 89–94 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Somasundaram, K., Mary Shanthi Rani, M. (2011). Mode Based K-Means Algorithm with Residual Vector Quantization for Compressing Images. In: Balasubramaniam, P. (eds) Control, Computation and Information Systems. ICLICC 2011. Communications in Computer and Information Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19263-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-19263-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19262-3
Online ISBN: 978-3-642-19263-0
eBook Packages: Computer ScienceComputer Science (R0)