Title :
Dual Locality Preserving Nonnegative Matrix Factorization for image analysis
Author_Institution :
State Key Lab of CAD&CG, College of Computer Science, Zhejiang University, Hangzhou, China
Abstract :
Recently, Nonnegative Matrix Factorization(NMF) has been viewed as an effective method for data engineering for its part-based interpretability and superior performance. However, ordinary NMF merely views a r1 × r2 image as a vector in r1 × r2 dimensional space and the pixels of the image are considered independent. It fails to consider that an image is intrinsically a matrix, and pixels spatially close to each other may also be correlated in the final learned representation. In this paper, I construct a novel spatially nearest graph and propose a novel algorithm named Dual Locality Preserving Nonnegative Matrix Factorization (DLPNMF), which explicitly models both the spatial correlation between neighboring pixels inside images and the geometric structure among different image vectors. A multiplicative rule is also proposed to solve the corresponding optimization problem. The encouraging experimental results on benchmark image data have demonstrated the effectiveness of this algorithm.
Keywords :
Computational modeling; Data models; Lead; Matrix decomposition; Pattern recognition; clustering; manifold learning; spatial locality;
Conference_Titel :
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location :
Hangzhou, China
Print_ISBN :
978-1-4673-2310-9
DOI :
10.1109/GrC.2012.6468564