Title :
Sparse bilinear preserving projections
Author :
Lai Zhihui ; Qingcai, Chen ; Jin, Zhong
Author_Institution :
Bio-Comput. Res. Center, Harbin Inst. of Technol., Shenzhen, China
Abstract :
The techniques of linear dimensionality reduction have been attracted widely attention in the fields of computer vision and pattern recognition. In this paper, we propose a novel framework called Sparse Bilinear Preserving Projections (SBPP) for image feature extraction. We generalized the image-based bilinear preserving projections into sparse case for feature extraction. Different from the popular bilinear linear projection techniques, the projections of SBPP are sparse, i.e. most elements in the projections are zeros. In the proposed framework, we use the local neighborhood graph to model the manifold structure of the data set at first, and then spectral analysis and L1-norm regression by using the Elastic Net are combined together to iteratively learn the sparse bilinear projections, which optimal preserve the local geometric structure of the image manifold. Experiments on some databases show that SBPP is competitive to some state-of-the-art techniques.
Keywords :
computer vision; feature extraction; graph theory; image recognition; regression analysis; L1-norm regression; computer vision; elastic net; image feature extraction; image manifold; image-based bilinear preserving projection; linear dimensionality reduction; local neighborhood graph; manifold structure; pattern recognition; sparse bilinear preserving projection; sparse bilinear projection; spectral analysis; Databases; Face; Elastic Net; feature extraction; manifold learing; sparse projections; subspace learing;
Conference_Titel :
Pattern Recognition (ACPR), 2011 First Asian Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4577-0122-1
DOI :
10.1109/ACPR.2011.6166647