Skip to main content

Local Uncorrelated Subspace Learning

  • Conference paper
  • First Online:
PRICAI 2019: Trends in Artificial Intelligence (PRICAI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11671))

Included in the following conference series:

  • 2592 Accesses

Abstract

In this paper, we present a supervised manifold learning based dimensionality reduction method, which is titled local uncorrelated subspace learning (LUSL). In the proposed LUSL, a local margin based on point to feature space (P2S) distance metric is recommended for discriminant feature extraction. What’s more, it has been validated that the locally statistical uncorrelation is an important property to reduce the feature redundancy. Hence, a novel locally uncorrelated criterion using P2S distance metric is also put forward, which is taken to constrain the local margin. Finally, by solving both the orthogonality and the local uncorrelation constrained objective function using an iterative way, a low dimensional subspace will be explored for pattern recognition. Compared to some related subspace learning methods, the effectiveness of the proposed LUSL have been shown from experimental results on some benchmark face data sets as AR and FERET.

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 EPUB and 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

References

  1. Jolliffe, I.T.: Principal component analysis. Springer Series in Statistics, 2nd edn, p. 488. Springer, New York (2002). https://doi.org/10.1007/b98835

    Book  MATH  Google Scholar 

  2. Kim, T.K., Stenger, B., Kittler, J., Cipolla, R.: Incremental linear discriminant analysis using sufficient spanning sets and its applications. Int. J. Comput. Vision 91(2), 216–232 (2011)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  4. Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)

    Article  Google Scholar 

  5. Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15(6), 1373–1396 (2003)

    Article  Google Scholar 

  6. Lu, J., Tan, Y.P.: Uncorrelated discriminant nearest feature line analysis for face recognition. IEEE Signal Process. Lett. 17(2), 185–188 (2010)

    Article  MathSciNet  Google Scholar 

  7. Chen, Y.N., Han, C.C., Wang, C.T., Fan, K.C.: Face recognition using nearest feature space embedding. IEEE Trans. Pattern Anal. Mach. Intell. 33(6), 1073–1086 (2011)

    Article  Google Scholar 

  8. Jin, Z., Yang, J.Y., Tang, Z.M., Hu, Z.S.: A theorem on the uncorrelated optimal discriminant vectors. Pattern Recogn. 34(10), 2041–2047 (2001)

    Article  Google Scholar 

  9. Yu, X., Wang, X.: Uncorrelated discriminant locality preserving projections. IEEE Signal Process. Lett. 15, 361–364 (2008)

    Article  Google Scholar 

  10. Chen, Y., Zheng, W.S., Xu, X.H., Lai, J.H.: Discriminant subspace learning constrained by locally statistical uncorrelation for face recognition. Neural Netw. 42(1), 28–43 (2013)

    Article  Google Scholar 

  11. Li, B., Lei, L., Zhang, X.P.: Constrained discriminant neighborhood embedding for high dimensional data feature extraction. Neurocomputing 173(1), 137–144 (2016)

    Article  Google Scholar 

  12. Li, H., Jiang, T., Zhang, K.: Efficient and robust feature extraction by maximum margin criterion. IEEE Trans. Neural Networks 17(1), 157–165 (2006)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partly supported by the grants of National Natural Science Foundation of China (61572381, 61273303 & 61375017) and Fujian Provincial Key Laboratory of Data Intensive Computing (BD201805).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bo Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, B., Wang, XH., Peng, YK., Chen, L., Ding, S. (2019). Local Uncorrelated Subspace Learning. In: Nayak, A., Sharma, A. (eds) PRICAI 2019: Trends in Artificial Intelligence. PRICAI 2019. Lecture Notes in Computer Science(), vol 11671. Springer, Cham. https://doi.org/10.1007/978-3-030-29911-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29911-8_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29910-1

  • Online ISBN: 978-3-030-29911-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics