CFP last date
20 March 2024
Reseach Article

Performance of K-Means Algorithm on 2D-DWT Compressed Image Data

Published on September 2011 by Amitabh Wahi, S. Poonkothai, R. Kanchanapratha, C. Palanisamy
Innovative Conference on Embedded Systems, Mobile Communication and Computing
Foundation of Computer Science USA
ICEMC2 - Number 1
September 2011
Authors: Amitabh Wahi, S. Poonkothai, R. Kanchanapratha, C. Palanisamy
8b02efc5-bc74-4f52-9a20-ae955076e844

Amitabh Wahi, S. Poonkothai, R. Kanchanapratha, C. Palanisamy . Performance of K-Means Algorithm on 2D-DWT Compressed Image Data. Innovative Conference on Embedded Systems, Mobile Communication and Computing. ICEMC2, 1 (September 2011), 12-15.

@article{
author = { Amitabh Wahi, S. Poonkothai, R. Kanchanapratha, C. Palanisamy },
title = { Performance of K-Means Algorithm on 2D-DWT Compressed Image Data },
journal = { Innovative Conference on Embedded Systems, Mobile Communication and Computing },
issue_date = { September 2011 },
volume = { ICEMC2 },
number = { 1 },
month = { September },
year = { 2011 },
issn = 0975-8887,
pages = { 12-15 },
numpages = 4,
url = { /proceedings/icemc2/number1/3517-icemc003/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Innovative Conference on Embedded Systems, Mobile Communication and Computing
%A Amitabh Wahi
%A S. Poonkothai
%A R. Kanchanapratha
%A C. Palanisamy
%T Performance of K-Means Algorithm on 2D-DWT Compressed Image Data
%J Innovative Conference on Embedded Systems, Mobile Communication and Computing
%@ 0975-8887
%V ICEMC2
%N 1
%P 12-15
%D 2011
%I International Journal of Computer Applications
Abstract

A simple recognition system is proposed which clusters the gray scale images using K-means algorithm based on wavelet features. The method is based on information extracted from the images known as features extraction. The features are extracted by using the following process: the image is decomposed by applying 2D- discrete wavelet transform (DWT) for one, two, three and four levels. The dimensionality of the image data is reduced up to desired level by the application of wavelets. The decomposed coefficients of an image are considered as the feature sets. The four methods of reducing dimensions are applied on a specific set of images to obtain four different data sets which serve as input to the k-means algorithm for clustering. The number of clusters is fixed prior to the experiments. The relative performances of k-means based on four different data sets are evaluated in terms of clustering accuracy and CPU time consumed.

References
  1. R. C. Gonzalez and R. E. Woods 1998, Digital Image Processing, Reading, Mass: Addision Wesley, 1998.
  2. B. Everitt (1993),Cluster Analysis, 3rd edition .Edwar Arnold, London.
  3. K. S. Ravichandran and B. Ananthi, “Color Skin segmentation Using K-Means Cluster,” International Journal of Computational and applied Mathematics ISSN 1819-4966 vol. 4 Number 2, pp.153-157, 2009. Germany: Springer-Verlag, 1998.
  4. k-means clustering tutorial Available: http://people.revoledu.com/kardi/tutorial/kMean/
  5. A. K. Jain and R. C. Dubes (1988), Algorithms for Clustering Data, Prentice Hall, USA, 1988.
  6. Tse-Wei Chen, Yi-Ling Chen, and Shao-Yi Chien, “Fast image segmentation based on K-Means clustering with histograms in HSV color space,”Proceedings of IEEE International Workshop on Multimedia Signal Processing (MMSP2008), Cairns, Queensland,Australia, Oct 2008, pp. 322–325.
  7. R H Turi and S Ray, “Determination of the number of clusters in colour image segmentation”, School of Computer Science and Software Engineering, Monash University, Melbourne, 20pp. Tech. rep 2000/67.
  8. P.Jeyanthi and V.Jawahar Senthil Kumar, “Image Classification by K-means Clustering”, Advances in Computational Science and Technology, ISSN 0973-6107 vol.3, Number1, pp.1-8, 2010
  9. A.Rosenfeld and L.S.Davis, “Image Segmentation and image models”, Proc. IEEE vol.67, pp.764-772, 1979.
  10. C.K.Chui 1997, “Wavelets-A Mathematical tool for Signal Analysis,” SIAM, Philadelphia, USA.
  11. S. G. Mallet 1989a, “A Theory of Multiresolution Signal Decomposition: The Wavelet Representation”,IEEE Transactions on Pattern Recognition and Machine Intelligence 11, pp. 674-693.
  12. S. G. Mallet 1989b “Multifrequency Channel Decompositions of Images and Wavelet models”, IEEE Transactions on Acoustic Speech and signal Processing 37, pp. 2091-2110.
  13. I. Daubechies 1992, “Ten Lectures on Wavelets”, SIAM CBMS-NSF, Series on Applied Mathematics,no.61, pp.53-166, SIAM.
  14. E. J. Stollnitz, T. D. DeRose, D. H. Salesin 1995,”Wavelets for Computer Graphics: A Premier, Part1”, IEEE Computer Graphics and Applications15 (3), pp.76-84.
  15. G.A.Papakostas,D.A.Karras,B.G.Mertzios and Y.S.Boutalis 2005, “An Efficient Feature Extraction Methodology For Computer Vision Applications Using Wavelet Compressed Zernike Moments”, ICGST, International Journal On Graphics, Vision and Image Processing, Special Issue: Wavelets and Their Applications, VSII, pp.5-15.
  16. A. Wahi, C. Ramkumar and C. Palanisamy 2008, “Neural Network-Based Object Classification Model Using Fourier and Wavelet Features”, Proceedings of 2nd International Conference on Cognition and Recognition (ICCR08), Organised by PES College of Engineering, Mandya, Karnataka, India, 10-12 April 2008
  17. Image Database [ONLINE]. Available: http://www.cvr.ai.uiuc.edu/ponce_grp/data/scene_categories/scene_categories.zip
Index Terms

Computer Science
Information Sciences

Keywords

k-means DWT clustering feature extraction normalization