Location of Repository

Int J Comput Vis DOI 10.1007/s11263-010-0381-3 Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications

By Tae-kyun Kim, Björn Stenger, Josef Kittler, Roberto Cipolla, T. -k. Kim, B. Stenger, J. Kittler and R. Cipolla

Abstract

Abstract This paper presents an incremental learning solution for Linear Discriminant Analysis (LDA) and its applications to object recognition problems. We apply the sufficient spanning set approximation in three steps i.e. update for the total scatter matrix, between-class scatter matrix and the projected data matrix, which leads an online solution which closely agrees with the batch solution in accuracy while significantly reducing the computational complexity. The algorithm yields an efficient solution to incremental LDA even when the number of classes as well as the set size is large. The incremental LDA method has been also shown useful for semi-supervised online learning. Label propagation is done by integrating the incremental LDA into an EM framework. The method has been demonstrated in the task of merging large datasets which were collected during MPEG standardization for face image retrieval, face authentication using the BANCA dataset, and object categorisation using the Caltech101 dataset

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.187.1596
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://svr-www.eng.cam.ac.uk/%... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.