Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
Full metadata record
|dc.identifier.citation||IEEE Transactions on Image Processing, 2007; 16(6):1662-1674||-|
|dc.description.abstract||The kernel principal component analysis (KPCA) has been applied in numerous image-related machine learning applications and it has exhibited superior performance over previous approaches, such as PCA. However, the standard implementation of KPCA scales badly with the problem size, making computations for large problems infeasible. Also, the "batch" nature of the standard KPCA computation method does not allow for applications that require online processing. This has somewhat restricted the domains in which KPCA can potentially be applied. This paper introduces an incremental computation algorithm for KPCA to address these two problems. The basis of the proposed solution lies in computing incremental linear PCA in the kernel induced feature space, and constructing reduced-set expansions to maintain constant update speed and memory usage. We also provide experimental results which demonstrate the effectiveness of the approach.||-|
|dc.publisher||IEEE-Inst Electrical Electronics Engineers Inc||-|
|dc.subject||Enabling online processing||-|
|dc.subject||incremental kernel principal component analysis (KPCA)||-|
|dc.subject||reducing time complexity||-|
|dc.title||Incremental kernel principal component analysis||-|
|dc.identifier.orcid||Suter, D. [0000-0001-6306-3023]||-|
|Appears in Collections:||Aurora harvest 5|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.