Skip to main content

The Maximized Discriminative Subspace for Manifold Learning Problem

  • Conference paper
Intelligent Science and Intelligent Data Engineering (IScIDE 2012)

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

  • 1746 Accesses

Abstract

Manifold learning problem, aims to seek some directions, which can keep the local structure and neighborhood of each sample as much as possible. In the conventional manifold learning approaches, feature extraction is performed in the original data space. In this paper, a new method called ”the maximized discriminant subspace algorithm” (MDS) is implemented before feature extraction and classification. Extensive experiments show the better classification results than the conventional manifold approaches, due to projecting the original data onto the maximized discriminant subspace in a preliminary phase before feature extraction and classification in the transformed data space.

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. Song, F.X., Zhang, D., Mei, D.Y., Guo, Z.W.: A multiple maximum scatter difference discriminant criterion for facial feature extraction. IEEE Transactions on Systems, Man and Cybernetics, PartB: Cybernetics 37(6), 1599–1606 (2007)

    Article  Google Scholar 

  2. Song, F.X., Zhang, D., Yang, J.Y., Gao, X.M.: Adaptive classification algorithm based on maximum scatter difference discriminant criterion. Acta Automatica Sinica 32(4), 541–549 (2006)

    Google Scholar 

  3. He, X.F., Yan, S.C., Hu, Y.X., Niyogi, P., Zhang, H.J.: Face recognition using laplacianfaces. IEEE Transactions on Pattern Analysis and Machine Learning 27(3), 328–340 (2005)

    Article  Google Scholar 

  4. Xu, Y., Zhong, A., Yang, J., Zhang, D.: LPP solution schemes for use with face recognition. Pattern Recognition 43, 4165–4176 (2010)

    Article  MATH  Google Scholar 

  5. Fisher, R.A.: The use of multiple measurements in taxonomic problem. J. Annals Eugenics 7(2), 179–188 (1936)

    Article  Google Scholar 

  6. Welling, M.: Fisher Linear Discriminant Analysis, http://www.ics.uci.edu/~welling/classnotes/papers_class/Fisher-LDA.pdf

  7. Yan, S., Xu, D., Zhang, B., Yang, Q., Lin, S.: Graph embedding and extension: a general framework for dimensionality reduction. IEEE Transactions on Pattern Analysis and Machine Learning 29(1), 40–51 (2007)

    Article  Google Scholar 

  8. Chen, H.T., Chang, H.W., Liu, T.L.: Local discriminant embedding and its variants. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR (2005)

    Google Scholar 

  9. Roweis, S., Saul, L.: Nolinear dimensionality reduction by locally linear embedding. Science 290(22), 2323–2326 (2000)

    Article  Google Scholar 

  10. Joliffe, I.: Principle component analysis. Springer (1986)

    Google Scholar 

  11. Martinez, A.M., Kak, A.C.: PCA versus LDA. IEEE Transactions on Pattern Analysis and Machine Learning 23(2), 228–233 (2001)

    Article  Google Scholar 

  12. Turk, M., Pentland, A.: Face recognition using eigenfaces. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. 586–591 (1991)

    Google Scholar 

  13. Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)

    Google Scholar 

  14. Xu, Y., Jin, Z.: Down-sampling face images and low-resulotion face recognition. In: The 3th International Conference on Innonative Computing, Information and Control, pp. 392–395 (2008)

    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-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tao, Y., Yang, J. (2013). The Maximized Discriminative Subspace for Manifold Learning Problem. In: Yang, J., Fang, F., Sun, C. (eds) Intelligent Science and Intelligent Data Engineering. IScIDE 2012. Lecture Notes in Computer Science, vol 7751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36669-7_95

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36669-7_95

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36668-0

  • Online ISBN: 978-3-642-36669-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics