Skip to main content

A New Subspace Analysis Approach Based on Laplacianfaces

  • Conference paper
Neural Information Processing (ICONIP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4233))

Included in the following conference series:

  • 1291 Accesses

Abstract

A new subspace analysis approach named ANLBM is proposed based on Laplacianfaces. It uses the discriminant information of training samples by supervised mechanism, enhances within-class local information by an objective function. The objective function is used to construct adjacency graph’s weight matrix. In order to avoid the drawback of Laplacianfaces’ PCA step, ANLBM uses kernel mapping. ANLBM changes the problem from minimum eigenvalue solution to maximum eigenvalue solution, reduces the redundancy of the computing and increases the precision of the result. The experiments are performed on ORL and Yale databases. Experimental results show that ANLBM has a better performance.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Turk, M., Pentland, A.: Eigenfaces for recognition. Journal of Cognitive Neuroscience 3(1), 71–86 (1991)

    Article  Google Scholar 

  2. Belhumeur, P.N., Hespanha, J.P., Kriegman, D.J.: Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection. IEEE Trans. Pattern Analysis Mach. Intel. 19(7), 711–720 (1997)

    Article  Google Scholar 

  3. Roweis, S.T., Saul, L.K.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science 290(22), 2323–2326 (2000)

    Article  Google Scholar 

  4. Tenenbaum, J.B., Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(12), 2319–2323 (2000)

    Article  Google Scholar 

  5. Belkin, M., Niyogi, P.: Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering. In: Proc. Conf. Advances in Neural Information Processing System (2002)

    Google Scholar 

  6. He, X., Niyogi, P.: Locality Preserving Projections. In: Proc. Conf. Advances in Neural Information Processing Systems (2003)

    Google Scholar 

  7. He, X., Yan, S., Hu, Y., Niyogi, P., Zhang, H.: Face Recognition Using Laplacianfaces. IEEE Trans. Pattern Analysis Mach. Intel. 27(3), 328–340 (2005)

    Article  Google Scholar 

  8. He, X., Cai, D., Yan, S., Zhang, H.: Neighborhood preserving embedding. Computer Vision, ICCV 2(10), 1208–1213 (2005)

    Google Scholar 

  9. Cheng, J., Liu, Q., Lu, H., Chen, Y.: A supervised nonlinear local embedding for face recognition. Image Processing, ICIP 10(1), 83–86 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, Y., Gu, RM. (2006). A New Subspace Analysis Approach Based on Laplacianfaces. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893257_28

Download citation

  • DOI: https://doi.org/10.1007/11893257_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46481-5

  • Online ISBN: 978-3-540-46482-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics