DocumentCode
1660695
Title
A near optimal projection for Sparse representation based classification
Author
Raja, Sreekanth ; Babu, R. Venkatesh
Author_Institution
Video Analytics Lab., Indian Inst. of Sci., Bangalore, India
fYear
2013
Firstpage
2089
Lastpage
2093
Abstract
Sparse representation based classification (SRC) is one of the most successful methods that has been developed in recent times for face recognition. Optimal projection for Sparse representation based classification (OPSRC) provides a dimensionality reduction map that is supposed to give optimum performance for SRC framework. However, the computational complexity involved in this method is too high. Here, we propose a new projection technique using the data scatter matrix which is computationally superior to the optimal projection method with comparable classification accuracy with respect OPSRC. The performance of the proposed approach is benchmarked with various publicly available face database.
Keywords
computational complexity; face recognition; image classification; image representation; OPSRC; SRC framework; computational complexity; data scatter matrix; dimensionality reduction map; face database; face recognition; near optimal projection; sparse representation based classification; Databases; Face; Face recognition; Image reconstruction; Sparse matrices; Training; Vectors; Face Recognition; Sparse Representation; Subspace Projection;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on
Conference_Location
Vancouver, BC
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2013.6638022
Filename
6638022
Link To Document