Dynamic subspace update with incremental Nyström approximation

Authors:
Hongyu Li;Lin Zhang
Affiliations:
School of Software Engineering, Tongji University, Shanghai, China;School of Software Engineering, Tongji University, Shanghai, China
Venue:
ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume part II
Year:
2010

Citing 7
Cited 0

From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose

IEEE Transactions on Pattern Analysis and Machine Intelligence
Scientific Computing

Scientific Computing
Spectral Grouping Using the Nyström Method

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning over sets using kernel principal angles

The Journal of Machine Learning Research
Acquiring Linear Subspaces for Face Recognition under Variable Lighting

IEEE Transactions on Pattern Analysis and Machine Intelligence
Incremental Learning for Robust Visual Tracking

International Journal of Computer Vision
Improved Nyström low-rank approximation and error analysis

Proceedings of the 25th international conference on Machine learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Low rank approximation methods, e.g. the Nyström method, are often used to speed up eigen-decomposition of kernel matrices. However, it cannot effectively update the extracted subspaces when datasets dynamically increase with time. In this paper, we propose an incremental Nyström method for dynamic learning. Experimental results demonstrate the feasibility and effectiveness of the proposed method.