Low-Rank Linear Embedding for Image Recognition

Yudong Chen

doi:10.1109/TMM.2018.2834867

Low-Rank Linear Embedding for Image Recognition

2018-01-01

37

PRE

AI

DOI：10.1109/TMM.2018.2834867

原文链接

原文求助

摘要

En 中文

Locality preserving projections (LPP) has been widely studied and extended in recent years, because of its promising performance in feature extraction. In this paper, we propose a modified version of the LPP by constructing a novel regression model. To improve the performance of the model, we impose a low-rank constraint on the regression matrix to discover the latent relations between different neighbors. By using the L-2,L-1-norm as a metric for the loss function, we can further minimize the reconstruction error and derive a robust model. Furthermore, the L-2,L-1-norm regularization term is added to obtain a jointly sparse regression matrix for feature selection. An iterative algorithm with guaranteed convergence is designed to solve the optimization problem. To validate the recognition efficiency, we apply the algorithm to a series of benchmark datasets containing face and character images for feature extraction. The experimental results show that the proposed method is better than some existing methods. The code of this paper can be downloaded from http://www.scholat.com/laizhihui.

Keyword:

Manifold learning

robust regression model

feature selection

Low-Rank Linear Embedding for Image Recognition

摘要

AI总结

期刊

机构