Image clustering by hyper-graph regularized non-negative matrix factorization

Kun Zeng

doi:10.1016/j.neucom.2014.01.043

Return

Image clustering by hyper-graph regularized non-negative matrix factorization

2014-08-01

PRE

DOI：10.1016/j.neucom.2014.01.043

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Non-negative matrix factorization

Hyper-graph laplacian

Image clustering

Dimension reduction

Manifold regularization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.