Title :
Face recognition based on Laplacian Eigenmaps
Author_Institution :
Sch. of Inf. Eng., Tibet Inst. for Nat., Xianyang, China
Abstract :
This paper put forward an image recognition method based on Laplacian Eigenmaps and Minimum Neighbor, the method makes use of incremental Laplacian Eigenmap reducing the dimension and extracting the feature to data points. In the dimension reduction process, it is maintained local information optimization in some extent. In the aspect of operation efficiency, it avoids the adjacent map to re-build in the entire dataset after the new point arriving, so greatly reducing the computational complexity. Simulations show that the method of image recognition rate is better than the PCA, LPP and other methods.
Keywords :
computational complexity; face recognition; feature extraction; optimisation; principal component analysis; LPP; PCA; computational complexity; data points; dimension reduction process; face recognition; feature extraction; image recognition method; incremental Laplacian eigenmap; local information optimization; minimum neighbor; operation efficiency; Face; Face recognition; Feature extraction; Image recognition; Laplace equations; Manifolds; Principal component analysis; Face recognition; Laplacian Eigenmap; Minimum Neighbor;
Conference_Titel :
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-9762-1
DOI :
10.1109/CSSS.2011.5972169