From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
Acquiring Linear Subspaces for Face Recognition under Variable Lighting
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Gabor feature based sparse representation for face recognition with gabor occlusion dictionary
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part VI
Sparse neighbor representation for classification
Pattern Recognition Letters
Is face recognition really a Compressive Sensing problem?
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Robust classification using structured sparse representation
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
IEEE Transactions on Image Processing
Sparse representation or collaborative representation: Which helps face recognition?
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Hi-index | 0.10 |
Applications of sparse signal representation in image processing and pattern recognition have attracted a great deal of attention. Sparse representation based classification (SRC) methods emphasizes on sparse representation computed by l"1-minimization to exploit the underlying sparsity in the problem domain, and argued the importance of sparse representation that improved the discrimination to achieve robust and accurate classification results. Recently, many studies have shown the role of collaborative representation (CR) in SRC, which actually improved the classification accuracy. In this paper, we proposed a novel collaborative neighbor representation method for multi-class classification based on l"2-minimization approach with the assumption of locally linear embedding (LLE). The proposed method represents a test sample over the dictionary by automatically choosing optimal nearest basis spanned in the same linear subspace as of test sample. The proposed representation method achieves competitive classification accuracy via optimal neighbor representation having discriminative learning power. Extensive experiments on real-world face and digit databases are performed to analyze the performance of the proposed method against SRC methods. Result clearly shows that the proposed method achieves competitive results for face recognition and pattern classification, and is significantly much faster and comparably accurate than SRC based classification methods.