Skip to main content

Dynamic Subspace Update with Incremental Nyström Approximation

  • Conference paper
Computer Vision – ACCV 2010 Workshops (ACCV 2010)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6469))

Included in the following conference series:

  • 1292 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Williams, C., Seeger, M.: Using the nyström method to speed up kernel machines. In: Advances in Neural Information Processing Systems 13 (2001)

    Google Scholar 

  5. Heath, M.-T.: Scientific Computing:An Introduction Survey. The McGraw-Hill Companies, Inc., New York (2002)

    Google Scholar 

  6. Scholkopf, B., Smola, A.: Learning with kernels. The MIT press, Cambridge (2002)

    MATH  Google Scholar 

  7. Baker, C.: The numerical treatment of integral equations. Clarendon Press, Oxford (1977)

    MATH  Google Scholar 

  8. Wolf, L., Shashua, A.: Learning over sets using kernel principal angles. J. Mach. Learn. Res. 4, 913–931 (2003)

    MathSciNet  MATH  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics