Abstract
In this paper, classification algorithm of kernel sparse representation has been proposed based on robust principal component analysis by using RPCA technology to generate redundant dictionary and kernel sparse representation to structure classifier and has been used for face recognition. Firstly, each training sample matrix has been decomposed into a low rank matrix and a sparse error matrix by using RPCA technology, so as to structure base dictionary and error dictionary by using the low rank matrix and error matrix respectively and generate redundancy dictionary of sparse representation of test samples. Then, kernel regularised orthogonal matching pursuit (KROMP) algorithm has been proposed to get sparse representation coefficient which has been used to complete classification and recognition of test samples. Compared with similar algorithms, algorithm in the thesis is of a high recognition rate for face recognition and has a strong ability to adapt to noise and error interference.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Reasoning-based Intelligent Systems
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.
