Abstract
In small sample size (SSS) problems, the number of available training samples is smaller than the dimensionality of the sample space. Since linear discriminant analysis (LDA) requires the within-class scatter matrix to be non-sigular, LDA cannot be directly applied to SSS problems. In this paper, regularized complete linear discriminant analysis (RCLDA) is proposed to solve SSS problems. RCLDA uses two regularized criterion to derive “regular” discriminant vectors in the range space of the within-class scatter matrix and “irregular” discriminant vectors in the null space of the within-class scatter matrix. Extensive experiments on the SSS problem of face recognition are carried out to evaluate the proposed algorithm in terms of classification accuracy and demonstrate the effectiveness of the proposed algorithm.
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 callDisclaimer: 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.
