Critical parameters of the sparse representationbased classifier
In recent years, the growing attention in the study of the compressive sensing theory suggested a novel classification algorithm called sparse representation-based classifier (SRC), which obtained promising results by casting classification as a sparse representation problem. Whereas, SRC has been a...
Saved in:
Published in | IET computer vision Vol. 7; no. 6; p. 500 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Stevenage
John Wiley & Sons, Inc
01.12.2013
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In recent years, the growing attention in the study of the compressive sensing theory suggested a novel classification algorithm called sparse representation-based classifier (SRC), which obtained promising results by casting classification as a sparse representation problem. Whereas, SRC has been applied to different fields of applications and several variations of it have been proposed, less attention has been given to its critical parameters, that is, measurements correlated to its performance. This work underlines the differences between CS and SRC, it gives a mathematical definition of five measurements possible correlated to the performance of SRC and identifies three of them as critical parameters. The authors addressed the problem of two-dimensional face classification: using the Extended Yale B dataset to monitor the critical parameters and the Extended Cohn-Kanade database to test the robustness of SRC with emotional faces. Finally, the authors increased the initial performance of the holistic SRC with a block-based SRC, which uses one critical parameter for automatic selection of the most successful blocks |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1751-9632 1751-9640 |
DOI: | 10.1049/iet-cvi.2012.0127 |