Abstract

In this paper, we propose a novel method, called local non-negative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual patterns. An objective function is defined to impose a localization constraint, in addition to the non-negativity constraint in the standard NMF. This gives a set of bases which not only allows a non-subtractive (part-based) representation of images but also manifests localized features. An algorithm is presented for the learning of such basic components. Experimental results are presented to compare LNMF with the NMF and PCA methods for face representation and recognition, which demonstrates advantages of LNMF.

Keywords

Non-negative matrix factorizationRepresentation (politics)Computer scienceConstraint (computer-aided design)Artificial intelligenceSubspace topologyPattern recognition (psychology)Matrix decompositionSet (abstract data type)Facial recognition systemFactorizationFace (sociological concept)AlgorithmMathematics

Affiliated Institutions

Related Publications

Publication Info

Year
2005
Type
article
Volume
1
Pages
I-207
Citations
780
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

780
OpenAlex

Cite This

S.Z. Li, Xin Hou, Hong Jiang Zhang et al. (2005). Learning spatially localized, parts-based representation. , 1 , I-207. https://doi.org/10.1109/cvpr.2001.990477

Identifiers

DOI
10.1109/cvpr.2001.990477