Deep convex NMF for image clustering

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Conventional matrix factorization methods fail to exploit useful information from rather complex data due to their single-layer structure. In this paper, we propose a novel deep convex non-negative matrix factorization method (DCNMF) to improve the ability of feature representation. In addition, the manifold and sparsity regularizers are imposed on each layer to discover the inherent structure of the data. For the formulated multi-layer objective, we develop an efficient iterative optimization algorithm, which can enhance the stability via layer-bylayer factorization and fine-tuning. We evaluate the proposed method by performing clustering experiments on face and handwritten character benchmark datasets; the results show that the proposed method obviously outperforms the conventional single-layer methods, and achieves the state-of-the-art performance.

Cite

CITATION STYLE

APA

Qian, B., Shen, X., Tang, Z., & Zhang, T. (2016). Deep convex NMF for image clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9967 LNCS, pp. 583–590). Springer Verlag. https://doi.org/10.1007/978-3-319-46654-5_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free