Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications

Cited 51 time in webofscience Cited 0 time in scopus
  • Hit : 168
  • Download : 0
This paper presents an incremental learning solution for Linear Discriminant Analysis (LDA) and its applications to object recognition problems. We apply the safficient 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 Caltech 101 dataset.
Publisher
SPRINGER
Issue Date
2011-01
Language
English
Article Type
Article
Citation

INTERNATIONAL JOURNAL OF COMPUTER VISION, v.91, no.2, pp.216 - 232

ISSN
0920-5691
DOI
10.1007/s11263-010-0381-3
URI
http://hdl.handle.net/10203/285980
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 51 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0