Constrained Dual Graph Regularized NMF for Image Clustering
Non-negative matrix factorization (NMF) becomes an important dimension reduction and feature extraction tool in the fields of scientific computing and computer vision. In this paper, for using the known label information in the original data, we put forward a semi-supervised NMF algorithm called constrained dual graph regularized non-negative matrix factorization (CDNMF). The new algorithm employs hard constraints to retain the priori label information of samples, constructs two association graphs to encode the geometric structures of the data manifold and the feature manifold, and incorporates the additional bi-orthogonal constraints to improve the identification ability of data in the new representation space. We have also developed an iterative optimization strategy for CDNMF and proved its convergence. Finally the clustering experiments on five standard image data sets show the effectiveness of the proposed algorithm.
KeywordsNMF Dual graph regularized Semi-supervised learning Image clustering
This work is supported by the Fundamental Research Funds for the Central Universities No. 2015ZCQ-LY-01, and the National Natural Science Foundation of China under Grant No. 61571046.
- 7.Yang, S., Zhang, L., He, X., Yi, Z.: Learning manifold structures with subspace segmentations. IEEE Trans. Cybern. PP(99), 1–12 (2019). https://ieeexplore.ieee.org/document/8645761
- 11.Zhu, W., Yan, Y., Peng, Y.: Topological structure regularized nonnegative matrix factorization for image clustering. Neural Comput. Appl., 1–19 (2018). https://link.springer.com/article/10.1007/s00521-018-3572-4
- 21.Lee, D.D., Sebastian Seung, H.: Algorithms for non-negative matrix factorization. In: Leen, T.K., Dietterich, T.G., Tresp, V. (eds.) Advances in Neural Information Processing Systems 13, pp. 556–562. MIT Press, Cambridge (2001)Google Scholar
- 23.Nene, S.A., Nayar, S.K., Murase, H.: Columbia object image library (COIL-20). Technical report CUCS-005-96, Department of Computer Science, Columbia University, February 1996Google Scholar