Please use this identifier to cite or link to this item:
Title: Image clustering by hyper-graph regularized non-negative matrix factorization
Authors: Zeng, K
Yu, J
Li, C
You, J 
Jin, T
Keywords: Non-negative matrix factorization
Hyper-graph laplacian
Image clustering
Dimension reduction
Manifold regularization
Issue Date: 2014
Publisher: Elsevier
Source: Neurocomputing, 2014, v. 138, p. 209-217 How to cite?
Journal: Neurocomputing 
Abstract: Image clustering is a critical step for the applications of content-based image retrieval, image annotation and other high-level image processing. To achieve these tasks, it is essential to obtain proper representation of the images. Non-negative Matrix Factorization (NMF) learns a part-based representation of the data, which is in accordance with how the brain recognizes objects. Due to its psychological and physiological interpretation, NMF has been successfully applied in a wide range of application such as pattern recognition, image processing and computer vision. On the other hand, manifold learning methods discover intrinsic geometrical structure of the high dimension data space. Incorporating manifold regularizer to standard NMF framework leads to novel performance. In this paper, we proposed a novel algorithm, call Hyper-graph regularized Non-negative Matrix Factorization (HNMF) for this purpose. HNMF captures intrinsic geometrical structure by constructing a hyper-graph instead of a simple graph. Hyper-graph model considers high-order relationship of samples and outperforms simple graph model. Empirical experiments demonstrate the effectiveness of the proposed algorithm in comparison to the state-of-the-art algorithms, especially some related works based on NMF.
ISSN: 0925-2312
EISSN: 1872-8286
DOI: 10.1016/j.neucom.2014.01.043
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 22, 2017

Page view(s)

Last Week
Last month
Checked on Aug 20, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.