Abstract
As is well known, most of the sparse representation based classification (SRC) schemes are not the standard form of SR model, that is, the dictionary in SRC model is not a strict one compare to sparse representation model. Actually, a strict and standard dictionary will create sparser coefficient, but it might not achieve better classification accuracy in SRC model. Therefore, constructing a rational and optimal dictionary for SRC model is a challenging task for us. Understanding the good performance of such unconventional dictionaries demands new algorithmic and analytical techniques. In this paper, we propose a novel SRC fusion method using hierarchical multi-scale local binary patterns (LBP) and greedy search strategy (SRC-GSLBP) for face recognition. The proposed method involves three aspects: dictionary optimization, training variables selection and classification strategy, sparse coding coefficient decomposing. First of all, we get an optimized dictionary through extracting hierarchical multi-scale LBP features from the original training samples. Second, the training variables selection and classification strategy aim to represent a query sample as a linear combination of the most informative training samples, and exploits an optimal representation of training samples from the classes with major relevant contributions. Instead of eliminating several classes at one time, we choose eliminating classes one by one with greedy search (GS) sparse coding process until the predefined termination condition is satisfied. The final remaining training samples are used to produce a best representation of the test sample and to perform classification. In the context of the proposed method, an important goal is to select a subset of variables that accomplishes one objective: the provision of a descriptive representation for sparse category knowledge structure. We develop a heuristic learning strategy to achieve this goal. Experimental results conducted on the ORL, FERET and AR face databases demonstrate the effectiveness of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.