Evaluation of SENSC Algorithm for Image Clustering

SENSC algorithm is a newly proposed stable and efficient NSC algorithm. In this paper the SENSC algorithm is evaluated for the task of image clustering. A series of experiments are conducted on two different kinds of image datasets, including face images and natural images, and SENSC is compared with some other commonly used clustering methods. Experimental results show that SENSC is better suited for the clustering of non-negative, well structured data which lies in some clear, meaningful underlying low-dimensional subspace.

[1]  Alan M. Frieze,et al.  Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.

[2]  Michael W. Berry,et al.  Document clustering using nonnegative matrix factorization , 2006, Inf. Process. Manag..

[3]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[4]  Michael J. Swain,et al.  Color indexing , 1991, International Journal of Computer Vision.

[5]  Huang De-shuang,et al.  Natural image denoising method based on nonnegative sparse coding shrinkage , 2006 .

[6]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[7]  B. S. Manjunath,et al.  Texture Features for Browsing and Retrieval of Image Data , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Bhavin J. Shastri,et al.  Face recognition using localized features based on non-negative sparse coding , 2006, Machine Vision and Applications.

[9]  Xin Liu,et al.  Document clustering based on non-negative matrix factorization , 2003, SIGIR.

[10]  A. Hyvärinen,et al.  A multi-layer sparse coding network learns contour coding from natural images , 2002, Vision Research.

[11]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[12]  Marc Teboulle,et al.  Grouping Multidimensional Data - Recent Advances in Clustering , 2006 .

[13]  T. Landauer,et al.  Indexing by Latent Semantic Analysis , 1990 .

[14]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[16]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[17]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[18]  Zhang Yu.  SENSC:a Stable and Efficient Algorithm for Nonnegative Sparse Coding , 2009 .

[19]  Nicolai Petkov,et al.  Comparison of texture features based on Gabor filters , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[20]  Le Li,et al.  SENSC: a Stable and Efficient Algorithm for Nonnegative Sparse Coding: SENSC: a Stable and Efficient Algorithm for Nonnegative Sparse Coding , 2009 .

[21]  Yixin Chen,et al.  CLUE: cluster-based retrieval of images by unsupervised learning , 2005, IEEE Transactions on Image Processing.

[22]  Patrik O. Hoyer,et al.  Non-negative sparse coding , 2002, Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing.

[23]  Ramin Zabih,et al.  Comparing images using color coherence vectors , 1997, MULTIMEDIA '96.

[24]  Mingjing Li,et al.  Color texture moments for content-based image retrieval , 2002, Proceedings. International Conference on Image Processing.

[25]  B. S. Manjunath,et al.  Color and texture descriptors , 2001, IEEE Trans. Circuits Syst. Video Technol..