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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang, K., Tsang, I.W., Kwok, J.T.: Improved nyström low-rank approximation and error analysis. In: ICML 2008: Proceedings of the 25th International Conference on Machine Learning, pp. 1232–1239. ACM, New York (2008)
Fowlkes, C., Belongie, S., Malik, J.: Efficient spatiotemporal grouping using the nystrom method. In: Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition CVPR 2001, vol. 1, pp. 231–238 (2001)
Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the nyström method. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 214–225 (2004)
Williams, C., Seeger, M.: Using the nyström method to speed up kernel machines. In: Advances in Neural Information Processing Systems 13 (2001)
Heath, M.-T.: Scientific Computing:An Introduction Survey. The McGraw-Hill Companies, Inc., New York (2002)
Scholkopf, B., Smola, A.: Learning with kernels. The MIT press, Cambridge (2002)
Baker, C.: The numerical treatment of integral equations. Clarendon Press, Oxford (1977)
Wolf, L., Shashua, A.: Learning over sets using kernel principal angles. J. Mach. Learn. Res. 4, 913–931 (2003)
Lee, K., Ho, J., Kriegman, D.: Acquiring Linear Subspaces for Face Recognition under Variable Lighting. IEEE Trans. Pattern Anal. Mach. Intelligence 27, 684–698 (2005)
Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intelligence 23, 643–660 (2001)
Ross, D.A., Lim, J., Lin, R.S., Yang, M.H.: Incremental learning for robust visual tracking. Int. J. Comput. Vision 77, 125–141 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, H., Zhang, L. (2011). Dynamic Subspace Update with Incremental Nyström Approximation. In: Koch, R., Huang, F. (eds) Computer Vision – ACCV 2010 Workshops. ACCV 2010. Lecture Notes in Computer Science, vol 6469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22819-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-22819-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22818-6
Online ISBN: 978-3-642-22819-3
eBook Packages: Computer ScienceComputer Science (R0)