Topological structure regularized nonnegative matrix factorization for image clustering
- 1 Downloads
Image representation is supposed to reveal the distinguishable feature and be captured in unsupervised fashion. Recently, nonnegative matrix factorization (NMF) has been widely used in capturing the parts-based feature for image representation. Previous NMF variants for image clustering first set the reduced rank as the number of clusters to obtain image representations. Then, K-means technology is adopted for ultimate clustering. However, the setting of rank is too rigid to preserve the geometrical structure of images, leading to unsuitable representation for the following clustering. Moreover, the image representation learning and clustering procedures are conducted individually which is inefficient as well as suboptimal for image clustering. This paper incorporates the constraint of topological structure into the procedure of NMF for simultaneously accomplishing nonnegative image representation and image clustering task. The proposed topological structure regularized NMF (TNMF) makes the rank bigger than the number of clusters, allotting one image more than one coarse clusters to guarantee the geometrical structure of images. In addition, a connected graph constructed by the coefficient matrix is enforced to have the strong connected components whose number equals to the number of clusters. By checking the number of connected components of graph against the number of clusters during the learning procedure, the optimization of TNMF is accomplished using alternative update rules. Extensive experiments on the challenging face, digit, and object data sets demonstrate the effectiveness of TNMF compared with competitive NMF variants for image clustering.
KeywordsNonnegative matrix factorization (NMF) Connected graph Topological structure Weighted nonnegative sparse coding
This work is supported by the National Key Research and Development Program of China (2017YFB0304200), the National Natural Science Foundation (NNSF) (51374063), and the Fundamental Research Funds for the Central Universities (N150308001).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 2.Lee DD, Seung HS (2000) Algorithms for non-negative matrix factorization. NIPS, BarcelonaGoogle Scholar
- 5.Wang ZF, Kong XW, Fu HY, Li M, Zhang YJ (2015) Feature extraction via multi-view non-negative matrix factorization with local graph regularization. In: ICIPGoogle Scholar
- 7.Tong M, Bu H, Zhao M, Xi S, Li H (2017) Non-negative enhanced discriminant matrix factorization method with sparsity regularization. Neural Comput Appl 2:1–24Google Scholar
- 18.Bampis CG, Maragos P, Bovik AC (2016) Projective non-negative matrix factorization for unsupervised graph clustering. In: ICIPGoogle Scholar
- 19.Dera D, Bouaynaya N, Polikar R, Fathallah-Shaykh HM (2016) Non-negative matrix factorization for non-parametric and unsupervised image clustering and segmentation. In: IJCNNGoogle Scholar
- 21.Li SZ, Hou XW, Zhang HJ, Cheng QS (2003) Learning spatially localized, parts-based representation. In: CVPRGoogle Scholar
- 23.Yuan ZJ, Yang ZR, Oja E (2005) Projective nonnegative matrix factorization for image compression and feature extraction. In: Scandinavian Conference on Image Analysis, pp 333–342Google Scholar
- 24.Choi S (2008) Algorithms for orthogonal nonnegative matrix factorization. In: IJCNNGoogle Scholar
- 25.Ding C, Li T, Peng W, Park H (2006) Orthogonal nonnegative matrix tri-factorizations for clustering. In: ACM Sigkdd International Conference on Knowledge Discovery and Data MiningGoogle Scholar
- 26.Pompili F, Gillis N, Absil PA, Glineur F (2012) Two algorithms for orthogonal nonnegative matrix factorization with application to clustering. Neurocomputing 141(4):15–25Google Scholar
- 31.He XF, Cai D, Yan SC, Zhang HJ (2005) Neighborhood preserving embedding. In: ICCVGoogle Scholar
- 32.Ding C, He XF, Horst DS, Jin R (2005) On the equivalence of nonnegative matrix factorization and K-means-spectral clustering, FactorizationGoogle Scholar
- 35.Mairal J, Bach F, Ponce J, Sapiro G (2009) Online dictionary learning for sparse coding. In: ICMLGoogle Scholar
- 37.Hoyer PO (2002) Non-negative sparse coding. In: IEEE Workshop on Neural Networks for Signal ProcessingGoogle Scholar
- 40.Chen XL, Cai D (2011) Large scale spectral clustering with landmark-based representation. In: AAAI conference on artificial intelligenceGoogle Scholar
- 42.Oyedotun OK, Khashman A (2016) Deep learning in vision-based static hand gesture recognition. Neural Comput Appl 28(12):1–11Google Scholar