Welcome to the InfoSci Platform
Reference Hub1
Incremental and Decremental Exponential Discriminant Analysis for Face Recognition

Incremental and Decremental Exponential Discriminant Analysis for Face Recognition

Nitin Kumar, R.K. Agrawal, Ajay Jaiswal
Copyright: © 2014 |Volume: 4 |Issue: 1 |Pages: 16
ISSN: 2155-6997|EISSN: 2155-6989|EISBN13: 9781466653399|DOI: 10.4018/ijcvip.2014010104
Cite Article Cite Article

MLA

Kumar, Nitin, et al. "Incremental and Decremental Exponential Discriminant Analysis for Face Recognition." IJCVIP vol.4, no.1 2014: pp.40-55. http://doi.org/10.4018/ijcvip.2014010104

APA

Kumar, N., Agrawal, R., & Jaiswal, A. (2014). Incremental and Decremental Exponential Discriminant Analysis for Face Recognition. International Journal of Computer Vision and Image Processing (IJCVIP), 4(1), 40-55. http://doi.org/10.4018/ijcvip.2014010104

Chicago

Kumar, Nitin, R.K. Agrawal, and Ajay Jaiswal. "Incremental and Decremental Exponential Discriminant Analysis for Face Recognition," International Journal of Computer Vision and Image Processing (IJCVIP) 4, no.1: 40-55. http://doi.org/10.4018/ijcvip.2014010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Linear Discriminant Analysis (LDA) is widely used for feature extraction in face recognition but suffers from small sample size (SSS) problem in its original formulation. Exponential discriminant analysis (EDA) is one of the variants of LDA suggested recently to overcome this problem. For many real time systems, it may not be feasible to have all the data samples in advance before the actual model is developed. The new data samples may appear in chunks at different points of time. In this paper, the authors propose incremental formulation of EDA to avoid learning from scratch. The proposed incremental algorithm takes less computation time and memory. Experiments are performed on three publicly available face datasets. Experimental results demonstrate the effectiveness of the proposed incremental formulation in comparison to its batch formulation in terms of computation time and memory requirement. Also, the proposed incremental algorithms (IEDA, DEDA) outperform incremental formulation of LDA in terms of classification accuracy.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.