Skip to main content

Regularized Complete Linear Discriminant Analysis for Small Sample Size Problems

  • Conference paper
Emerging Intelligent Computing Technology and Applications (ICIC 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 304))

Included in the following conference series:

  • 2332 Accesses

Abstract

In small sample size (SSS) problems, the number of available training samples is smaller than the dimensionality of the sample space. Since linear discriminant analysis (LDA) requires the within-class scatter matrix to be non-sigular, LDA cannot be directly applied to SSS problems. In this paper, regularized complete linear discriminant analysis (RCLDA) is proposed to solve SSS problems. RCLDA uses two regularized criterion to derive “regular” discriminant vectors in the range space of the within-class scatter matrix and “irregular” discriminant vectors in the null space of the within-class scatter matrix. Extensive experiments on the SSS problem of face recognition are carried out to evaluate the proposed algorithm in terms of classification accuracy and demonstrate the effectiveness of the proposed algorithm.

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. Fukunaga, K.: Introduction to Statistical Pattern Recognition, 2nd edn. Academic Press, New York (1990)

    MATH  Google Scholar 

  2. Chen, L.F., Liao, H.Y.M., Lin, J.C., Kao, M.D., Yu, G.J.: 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 

  3. Yu, H., Yang, J.: A Direct LDA Algorithm for High-Dimensional Data-With Application to Face Recognition. Pattern Recognition 34(10), 2067–2070 (2001)

    Article  MATH  Google Scholar 

  4. Yang, J., Yang, J.Y.: Why Can LDA Be Performed in PCA Transformed Space? Pattern Recognition 36(2), 563–566 (2003)

    Article  Google Scholar 

  5. Yang, J., Frangi, A.F., Yang, J.Y., Zhang, D., Jin, Z.: KPCA plus LDA: A Complete Kernel Fisher Discriminant Framework for Feature Extraction and Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 27(2), 230–244 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, W. (2012). Regularized Complete Linear Discriminant Analysis for Small Sample Size Problems. In: Huang, DS., Gupta, P., Zhang, X., Premaratne, P. (eds) Emerging Intelligent Computing Technology and Applications. ICIC 2012. Communications in Computer and Information Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31837-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31837-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31836-8

  • Online ISBN: 978-3-642-31837-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics