Online nonparametric discriminant analysis for incremental subspace learning and recognition |
| |
Authors: | B. Raducanu J. Vitrià |
| |
Affiliation: | 1. Computer Vision Center, Edifici “O”, Campus UAB, 08193, Bellaterra, Barcelona, Spain 2. Department of Applied Mathematics and Analysis, University of Barcelona, 08003, Barcelona, Spain
|
| |
Abstract: | This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications (like the study of visual processes, for instance) it is impossible to know beforehand the number of total classes or the exact number of instances per class. This motivated us to propose a new algorithm, in which new samples can be added asynchronously, at different time stamps, as soon as they become available. The proposed technique for NDA-eigenspace representation has been used in pattern recognition applications, where classification of data has been performed based on the nearest neighbor rule. Extensive experiments have been carried out both in terms of classification accuracy and execution time. On the one hand, the results show that the Incremental NDA converges towards the classical NDA at the end of the learning process and furthermore. On the other hand, Incremental NDA is suitable to update a large knowledge representation eigenspace in real-time. Finally, the use of our method on a real-world application is presented. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|