Skip to main content

Supervised Slow Feature Analysis for Face Recognition

  • Conference paper
Biometric Recognition (CCBR 2013)

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

Included in the following conference series:

Abstract

Slow feature analysis (SFA) is a new method based on the slowness principle and extracts slowly varying signals out of the input data. However, traditional SFA cannot be directly performed on those dataset without an obvious temporal structure. In this paper, a novel supervised slow feature analysis (SSFA) is proposed, which constructs pseudo-time series by taking advantage of the consensus information. Extensive experiments on AR and PIE face databases demonstrate superiority of our 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. Wiskott, L., Sejnowski, T.J.: Slow feature analysis: unsupervised learning of invariances. Neural Computation 14, 715–770 (2002)

    Article  MATH  Google Scholar 

  2. Huang, Y., Zhao, J., Tian, M., Zou, Q., Luo, S.: Slow Feature Discriminant Analysis and its application on handwritten digit recognition. In: 2009 International Joint Conference on Neural Networks, pp. 1294–1297. IEEE (2009)

    Google Scholar 

  3. YaPing, H., JiaLi, Z., YunHui, L., SiWei, L., Zou, Q., Tian, M.: Nonlinear dimensionality reduction using a temporal coherence principle. Information Sciences 181, 3284–3307 (2011)

    Article  MATH  Google Scholar 

  4. Yang, X., Latecki, L.J.: Affinity learning on a tensor product graph with applications to shape and image retrieval. In: CVPR 2011, pp. 2369–2376. IEEE (2011)

    Google Scholar 

  5. Lancichinetti, A., Fortunato, S.: Consensus clustering in complex networks. Scientific reports. 2, 336 (2012)

    Google Scholar 

  6. Monti, S., Tamayo, P., Mesirov, J., Golub, T.: Consensus Clustering: A Resampling-Based Method for Class Discovery and Visualization of Gene Expression Microarray Data. Machine Learning 52, 91–118 (2003)

    Article  MATH  Google Scholar 

  7. Premachandran, V., Kakarala, R.: Consensus of k-NNs for Robust Neighborhood Selection on Graph-Based Manifolds. In: CVPR (2013)

    Google Scholar 

  8. He, X., Cai, D., Yan, S., Zhang, H.-J.: Neighborhood preserving embedding. In: Tenth IEEE International Conference on Computer Vision, pp. 1208–1213. IEEE Computer Society, Washington, DC (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Gu, X., Liu, C., Wang, S. (2013). Supervised Slow Feature Analysis for Face Recognition. In: Sun, Z., Shan, S., Yang, G., Zhou, J., Wang, Y., Yin, Y. (eds) Biometric Recognition. CCBR 2013. Lecture Notes in Computer Science, vol 8232. Springer, Cham. https://doi.org/10.1007/978-3-319-02961-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02961-0_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02960-3

  • Online ISBN: 978-3-319-02961-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics