Advertisement

Topological structure regularized nonnegative matrix factorization for image clustering

  • Wenjie Zhu
  • Yunhui Yan
  • Yishu Peng
Original Article
  • 39 Downloads

Abstract

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.

Keywords

Nonnegative matrix factorization (NMF) Connected graph Topological structure Weighted nonnegative sparse coding 

Notes

Acknowledgements

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.

References

  1. 1.
    Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401:788–791CrossRefzbMATHGoogle Scholar
  2. 2.
    Lee DD, Seung HS (2000) Algorithms for non-negative matrix factorization. NIPS, BarcelonaGoogle Scholar
  3. 3.
    Zeng K, Yu J, Li CH, You J, Jin TS (2014) Image clustering by hyper-graph regularized non-negative matrix factorization. Neurocomputing 138(11):209–217CrossRefGoogle Scholar
  4. 4.
    Yi YG, Shi YJ, Zhang HJ, Wang JZ, Kong J (2015) Label propagation based semi-supervised non-negative matrix factorization for feature extraction. Neurocomputing 149(PB):1021–1037CrossRefGoogle Scholar
  5. 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
  6. 6.
    Yang SZ, Hou CP, Zhang CS, Wu Y (2013) Robust non-negative matrix factorization via joint sparse and graph regularization for transfer learning. Neural Comput Appl 23(2):541–559CrossRefGoogle Scholar
  7. 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
  8. 8.
    Lu YW, Lai ZH, Xu Y, Li XL, Zhang D, Yuan C (2017) Nonnegative discriminant matrix factorization. IEEE Trans Circuits Syst Video Technol 27(7):1392–1405CrossRefGoogle Scholar
  9. 9.
    Akashi Y, Okatani T (2016) Separation of reflection components by sparse non-negative matrix factorization. Comput Vis Image Underst 146:77–85CrossRefGoogle Scholar
  10. 10.
    He W, Zhang HY, Zhang LP (2016) Sparsity-regularized robust non-negative matrix factorization for hyperspectral unmixing. IEEE J Sel Topics Appl Earth Observ Remote Sens 9(9):4267–4279CrossRefGoogle Scholar
  11. 11.
    Wu ZB, Ye S, Liu JJ, Sun L, Wei ZH (2014) Sparse non-negative matrix factorization on GPUs for hyperspectral unmixing. IEEE J Sel Topics Appl Earth Observ Remote Sens 7(8):3640–3649CrossRefGoogle Scholar
  12. 12.
    Duda RO, Hart PE, Stork DG (2000) Pattern classification. Wiley-Interscience, HobokenzbMATHGoogle Scholar
  13. 13.
    Gersho A, Gray RM (1992) Vector quantization and signal compression. Kluwer Academic Press, NorwellCrossRefzbMATHGoogle Scholar
  14. 14.
    Zhang HJ, Wu QMJ, Chow TWS, Zhao MB (2012) A two-dimensional neighborhood preserving projection for appearance-based face recognition. Pattern Recogn 45(5):1866–1876CrossRefzbMATHGoogle Scholar
  15. 15.
    Zhu WJ, Yan YH, Peng YS (2017) Pair of projections based on sparse consistence with applications to efficient face recognition. Sig Process Image Commun 55:32–40CrossRefGoogle Scholar
  16. 16.
    Hartigan JA, Wong MA (1979) Algorithm AS 136: a K-means clustering algorithm. J R Stat Soc 28(1):100–108zbMATHGoogle Scholar
  17. 17.
    Buono ND, Pio G (2015) Non-negative matrix Tri-Factorization for co-clustering: an analysis of the block matrix. Inf Sci 301:13–26CrossRefGoogle Scholar
  18. 18.
    Bampis CG, Maragos P, Bovik AC (2016) Projective non-negative matrix factorization for unsupervised graph clustering. In: ICIPGoogle Scholar
  19. 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
  20. 20.
    Li XL, Cui GS, Dong YS (2017) Graph regularized non-negative low-rank matrix factorization for image clustering. IEEE Trans Cybern 47(11):3840–3853MathSciNetCrossRefGoogle Scholar
  21. 21.
    Li SZ, Hou XW, Zhang HJ, Cheng QS (2003) Learning spatially localized, parts-based representation. In: CVPRGoogle Scholar
  22. 22.
    Yang ZR, Yuan ZJ, Laaksonen J (2007) Projective nonnegative matrix factorization with applications to facial image processing. Int J Pattern Recognit Artif Intell 21(8):1353–1362CrossRefGoogle Scholar
  23. 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. 24.
    Choi S (2008) Algorithms for orthogonal nonnegative matrix factorization. In: IJCNNGoogle Scholar
  25. 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. 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
  27. 27.
    Cai D, He XF, Han JW, Huang TS (2011) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548–1560CrossRefGoogle Scholar
  28. 28.
    Zeng K, Yu J, Li CH, You J, Jin TS (2014) Image clustering by hyper-graph regularized non-negative matrix factorization. Neurocomputing 138(11):209–217CrossRefGoogle Scholar
  29. 29.
    Liu HF, Wu ZH, Cai D, Huang TS (2012) Constrained nonnegative matrix factorization for image representation. IEEE Trans Pattern Anal Mach Intell 34(7):1299–1311CrossRefGoogle Scholar
  30. 30.
    Li GP, Zhang XY, Zheng SY, Li DY (2017) Semi-supervised convex nonnegative matrix factorizations with graph regularized for image representation. Neurocomputing 237:1–11CrossRefGoogle Scholar
  31. 31.
    He XF, Cai D, Yan SC, Zhang HJ (2005) Neighborhood preserving embedding. In: ICCVGoogle Scholar
  32. 32.
    Ding C, He XF, Horst DS, Jin R (2005) On the equivalence of nonnegative matrix factorization and K-means-spectral clustering, FactorizationGoogle Scholar
  33. 33.
    Mohar B, Alavi Y, Chartrand G, Oellermann OR, Schwenk AJ (1991) The Laplacian spectrum of graphs. Graph Theory Comb Appl 18(7):871–898MathSciNetGoogle Scholar
  34. 34.
    Fan K (1949) On a theorem of Weyl concerning eigenvalues of linear transformations II. Proc Natl Acad Sci USA 36(1):652–655CrossRefGoogle Scholar
  35. 35.
    Mairal J, Bach F, Ponce J, Sapiro G (2009) Online dictionary learning for sparse coding. In: ICMLGoogle Scholar
  36. 36.
    Mairal J, Bach F, Ponce J, Sapiro G (2009) Online learning for matrix factorization and sparse coding. J Mach Learn Res 11(1):19–60MathSciNetzbMATHGoogle Scholar
  37. 37.
    Hoyer PO (2002) Non-negative sparse coding. In: IEEE Workshop on Neural Networks for Signal ProcessingGoogle Scholar
  38. 38.
    Yang J, Chu DL, Zhang L, Xu Y, Yang JY (2013) Sparse representation classifier steered discriminative projection with applications to face recognition. IEEE Trans Neural Netw Learn Syst 24(7):1023–1035CrossRefGoogle Scholar
  39. 39.
    Cai D, He XF, Han JW (2005) Document clustering using locality preserving indexing. IEEE Trans Knowl Data Eng 17(12):1624–1637CrossRefGoogle Scholar
  40. 40.
    Chen XL, Cai D (2011) Large scale spectral clustering with landmark-based representation. In: AAAI conference on artificial intelligenceGoogle Scholar
  41. 41.
    Zhang HJ, Cao X, Ho JKL, Chow TWS (2017) Object-level video advertising: an optimization framework. IEEE Trans Industr Inf 13(2):520–531CrossRefGoogle Scholar
  42. 42.
    Oyedotun OK, Khashman A (2016) Deep learning in vision-based static hand gesture recognition. Neural Comput Appl 28(12):1–11Google Scholar

Copyright information

© The Natural Computing Applications Forum 2018

Authors and Affiliations

  1. 1.School of Mechanical Engineering and AutomationNortheastern UniversityShenyangChina
  2. 2.School of Mechanical EngineeringHunan Institute of Science and TechnologyYueyangChina

Personalised recommendations