Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications |
| |
Authors: | Tae-Kyun Kim Björn Stenger Josef Kittler Roberto Cipolla |
| |
Affiliation: | (1) School of Computer Science and Engineering, Jiangsu University of Science and Technology, Zhenjiang, 212003, People’s Republic of China;(2) School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing, 210094, People’s Republic of China;(3) School of Information Engineering, Jiangnan University, Wuxi, 214122, People’s Republic of China;(4) Department of Computer Science, San Jose State University, San Jose, CA 95192, USA |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|