Skip to main content

An Optimal Subspace Analysis for Face Recognition

  • Conference paper
Biometric Authentication (ICBA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3072))

Included in the following conference series:

  • 1280 Accesses

Abstract

Fisher Linear Discriminant Analysis (LDA) has recently been successfully used as a data discriminantion technique. However, LDA-based face recognition algorithms suffer from a small sample size (S3) problem. It results in the singularity of the within-class scatter matrix S w . To overcome this limitation, this paper has developed a novel subspace approach in determining the optimal projection. This algorithm effectively solves the small sample size problem and eliminates the possibility of losing discriminative information.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Liu, K., Cheng, Y., Yang, J.: Algebraic feature extraction for image recognition based on an optimal discriminant criterion. Pattern Recognition 26(6), 903–911 (1993)

    Article  Google Scholar 

  2. Yu, H., Yang, J.: A direct LDA algorithm for high-dimensional data — with application to face recognition. Pattern Recognition 34, 2067–2070 (2001)

    Article  MATH  Google Scholar 

  3. Belhumeur, P.N., Hespanha, J.P., Kriegman, D.J.: Eigenfaces vs. Fisherfaces: recognition using class specific linear projection. IEEE Trans. Pattern Anal. Mach. Intell. 19(7), 711–720 (1997)

    Article  Google Scholar 

  4. Huang, R., Liu, Q., Lu, H., Ma, S.: Solving small sample size problem in LDA. In: Proceeding of International Conference in Pattern Recognition (ICPR 2002), August 2002, vol. 3, pp. 29–32 (2002)

    Google Scholar 

  5. Chen, L., Liao, H., Ko, M., Lin, J., Yu, G.: A new LDA-based face recognition system which can solve the small sample size problem. Pattern Recognition 33(10), 1713–1726 (2000)

    Article  Google Scholar 

  6. Wang, X., Tang, X.: Unified Subspace Analysis for Face Recognition. In: Proceedings of the Ninth IEEE International Conference on Computer Vision, ICCV 2003 (2003)

    Google Scholar 

  7. Phillips, P.J., Moon, H., Rizvi, S.A., Rauss, P.J.: The FERET evaluation methodology for face recognition algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 22(10), 1090–11104 (2000)

    Article  Google Scholar 

  8. Jin, Z., Yang, J.Y., Hu, Z.S., Lou, Z.: Face recognition based on the uncorrelated discriminant transform. Pattern Recognition 34, 1405–1416 (2001)

    Article  MATH  Google Scholar 

  9. Liu, C., Wechsler, H.: Robust coding schemes for indexing and retrieval from large face databases. IEEE Trans. Image Processing 9(1), 132–137 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, H., Yuen, P.C., Yang, J. (2004). An Optimal Subspace Analysis for Face Recognition. In: Zhang, D., Jain, A.K. (eds) Biometric Authentication. ICBA 2004. Lecture Notes in Computer Science, vol 3072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25948-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25948-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22146-3

  • Online ISBN: 978-3-540-25948-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics