Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications

  • Authors:
  • Tae-Kyun Kim;Björn Stenger;Josef Kittler;Roberto Cipolla

  • Affiliations:
  • Sidney Sussex College, University of Cambridge, Cambridge, UK CB2 3HU;Toshiba Research Europe Ltd, Cambridge, UK CB4 0GZ;Centre for Vision, Speech and Signal Processing, University of Surrey, Guildford, UK GU2 7XH;Department of Engineering, University of Cambridge, Cambridge, UK CB2 1PZ

  • Venue:
  • International Journal of Computer Vision
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.