Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Comparative Analysis of Image Compression Techniques: K Means Clustering and Singular Value Decomposition


Affiliations
1 Department of Computer Applications, Madras University, India
     

   Subscribe/Renew Journal


The global drive to digitize almost all the existing processes has mandated the conversion of all concerned analog data into their respective digital formats. One such crucial data that is being digitized on a priority in today’s world is image. An image is a type of data which is composed of picture elements called pixels. It can be represented as a matrix for the manipulating process. The storage of a vast database of image files occupies a huge memory space in the disk. To overcome this hassle, image files can be compressed and saved. This image compression process is aimed at reducing the data size in terms of bytes and enable the efficient storage and transmission of image files. Image compression can be achieved through several algorithms. In this paper, we discuss two such algorithms, namely k means clustering and singular value decomposition. K Means Clustering technique helps in minimizing the colour components of the image. Singular Value Decomposition technique can be carried out by low rank approximation of the image matrix. This research work is performed using the Python platform and subsequently the efficiency of both the methods is compared. The comparative analysis of the simulation results are further compared with the existing methods to show the competence of different methodologies. Thus, this work strives to be of learned assistance to the concerned aspirants in choosing the best algorithm for their applications.

Keywords

Image Compression, K-Means Clustering, Singular Value Decomposition.
Subscription Login to verify subscription
User
Notifications
Font Size

  • Chiyuan Zhang and Xiaofei He, “Image Compression by Learning to Minimize the Total Error”, IEEE Transactions on Circuits and Systems for Video Technology, Vol. 23, No. 4, pp. 565-576, 2013.
  • K. Somasundaram and P. Sumitra, “RGB and Gray Scale Component On MPQ-BTC In Image Compression”, International Journal on Computer Science and Engineering, Vol. 3. No. 4, pp. 1-13, 2011.
  • Gunjan Mathur, Rohit Mathur and Mridul Kumar Mathur, “A Comparative Study of Various Lossy Image Compression Techniques”, International Journal of Engineering Research and Technology, Vol. 2, No. 3, pp. 1-9, 2018.
  • A. Harika, V. Revanth Narayana, C.H. Sagar Kumar and Suresh Kurumalla, “Reduction of Redundant Pixels of an Image using Efficient K Means Clustering Algorithm”, International Journal of Engineering Sciences and Research Technology, Vol. 8, No. 3, pp. 104-110, 2019.
  • R.D. Sivakumar and K. Ruba Soundar, “E-Learning Image Compression using K-Means-BTC in Public Cloud”, International Journal of Current Engineering and Scientific Research, Vol. 5, No. 5, pp. 111-119, 2018.
  • Xing Wan, “Application of K-Means Algorithm in Image Compression”, IOP Conference Series: Materials Science and Engineering, Vol. 563, pp. 1-5, 2019.
  • N. Venkateswaran and Y.V. Ramana Rao, “K- Means Clustering Based Image Compression in Wavelet Domain”, Information Technology Journal, Vol. 6, pp. 148-153, 2007.
  • Poonam Dhumal and S.S. Deshmukh, “Survey on Comparative Analysis of Various Image Compression Algorithms with Singular Value Decomposition”, International Journal of Computer Applications, Vol. 133, No. 6, pp. 1-12, 2016.
  • K. Mounika, D. Sri Navya Lakshmi, K. Alekya and M.R.N. Tagore, “SVD Based Image Compression”, International Journal of Engineering Research and General Science, Vol. 3, No. 2, pp. 1-5, 2015.
  • Ranjeet Kumar, Utpreksh Patbhaje and A. Kumar, “An Efficient Technique for Image Compression and Quality Retrieval using Matrix Completion”, Journal of King Saud University-Computer and Information Sciences, pp. 1-9, 2019.
  • K.M. Aishwarya, Rachana Ramesh, Preeti. M. Sobarad and Vipula Singh, “Lossy Image Compression using SVD Coding Algorithm”, Proceedings of International Conference on Wireless Communications, Signal Processing and Networking, pp. 1-7, 2016.
  • Jeongyeup Paek and JeongGil Ko, “K-Means Clustering-Based Data Compression Scheme for Wireless Imaging Sensor Networks”, IEEE Systems Journal, Vol. 11, No. 4, pp. 1-12, 2017.
  • Sana Shafik Desai and M.S. Chavan, “Comparative Analysis of Singular Value Decomposition (SVD) and Wavelet Difference Reduction (WDR) based Image Compression”, International Journal of Engineering Research and Technology, Vol. 10, No. 1, pp. 1-14, 2017.
  • Yusra A.Y. Al-Najjar and Der Chen Soong, “Comparison of Image Quality Assessment: PSNR, HVS, SSIM, UIQI”, International Journal of Scientific and Engineering Research, Vol. 3, No. 8, pp. 1-5, 2012.
  • R. Nandhini and S.R. Aparna, “Study of Security Issues in Internet of Things”, International Journal of Research and Analytical Reviews, Vol. 5, No. 3, pp. 1-12, 2018.

Abstract Views: 13

PDF Views: 0




  • A Comparative Analysis of Image Compression Techniques: K Means Clustering and Singular Value Decomposition

Abstract Views: 13  |  PDF Views: 0

Authors

R. Gomathi
Department of Computer Applications, Madras University, India
R. Aparna
Department of Computer Applications, Madras University, India

Abstract


The global drive to digitize almost all the existing processes has mandated the conversion of all concerned analog data into their respective digital formats. One such crucial data that is being digitized on a priority in today’s world is image. An image is a type of data which is composed of picture elements called pixels. It can be represented as a matrix for the manipulating process. The storage of a vast database of image files occupies a huge memory space in the disk. To overcome this hassle, image files can be compressed and saved. This image compression process is aimed at reducing the data size in terms of bytes and enable the efficient storage and transmission of image files. Image compression can be achieved through several algorithms. In this paper, we discuss two such algorithms, namely k means clustering and singular value decomposition. K Means Clustering technique helps in minimizing the colour components of the image. Singular Value Decomposition technique can be carried out by low rank approximation of the image matrix. This research work is performed using the Python platform and subsequently the efficiency of both the methods is compared. The comparative analysis of the simulation results are further compared with the existing methods to show the competence of different methodologies. Thus, this work strives to be of learned assistance to the concerned aspirants in choosing the best algorithm for their applications.

Keywords


Image Compression, K-Means Clustering, Singular Value Decomposition.

References