Skip to main content

Feature Extraction via Vector Bundle Learning

  • Chapter
  • First Online:
  • 3658 Accesses

Abstract

In this paper, we propose a geometric framework, called Vector Bundle Learning (VBL) for feature extraction. In our framework, a vector bundle is considered as the intrinsic structure to extract features from high dimensional data. By defining a manifold to model the structure of sample set, features sampled from each fibre of a vector bundle can be obtained by metric learning on the manifold. A number of existing algorithms can be reformulated and explained in this unified framework. Based on the proposed framework, a novel supervised feature extraction algorithm called Vector Bundle Discriminant Analysis (VBDA) is proposed for recognition and classification. Experimental results on face recognition and handwriting digits classification demonstrate the excellent performance of our VBDA algorithm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   129.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    It will be discussed in Sect. 8.3.

  2. 2.

    The details are given in the supplementary material due to the page limit.

  3. 3.

    Available at http://www.cs.toronto.edu/~roweis/data.html.

  4. 4.

    For MFA, LDE, ANMM and SRDA, the choice of \(\mathcal{S}_{x_{i}}\) uses the class information as they are supervised dimensionality reduction techniques. See the details that follow.

References

  1. I. Jolliffe, Principal Component Analysis (Springer, Berlin, 1986)

    Google Scholar 

  2. M.A. Turk, A.P. Pentland, Face recognition using eigenfaces, in IEEE International Conference on Computer Vision and Pattern Recognition CVPR (1991)

    Google Scholar 

  3. I. Borg, P. Groenen, Modern Multidimensional Scaling: Theory and Applications (Springer, Berlin, 2005)

    Google Scholar 

  4. P. Belhumeur, J. Hespanha, D. Kriegman, Eigenface vs. fisherfaces:recognition using class specific linear projection. IEEE Trans. Pattern Anal. Mach. Intell. 19, 711–720 (1997)

    Google Scholar 

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

    Google Scholar 

  6. S. Lafon, A.B. Lee, Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterization. IEEE Trans. Pattern Anal. Mach. Intell. 28(9), 1393–1403 (2006)

    Google Scholar 

  7. M. Belkin, P. Niyogi, Laplacian eigenmaps and spectral techniques for embedding and clustering, in Advances in Neural Information Processing System, vol. 16 (MIT, 2004), p. 153

    Google Scholar 

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

    Google Scholar 

  9. D.L. Donoho, C. Grimes, Hessian eigenmaps: locally linear embedding techniques for high-dimensional data. Proc. Natl. Acad. Sci. 100(10), 5591–5596 (2003)

    Google Scholar 

  10. Z. Zhang, H. Zha, Principal manifolds and nonlinear dimensionality reduction by local tangent space alignment. SIAM J. Sci. Comput. 26, 313–338 (2004)

    Google Scholar 

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

    Google Scholar 

  12. F. Wang, C. Zhang, Feature extraction by maximizing the average neighborhood margin. in IEEE Conference on Computer Vision and Pattern Recognition, 2007 (CVPR’07) (IEEE, 2007), pp. 1–8

    Google Scholar 

  13. D. Zhao, Z. Lin, X. Tang Classification via semi-Riemannian spaces. in IEEE Conference on Computer Vision and Pattern Recognition, 2008 (CVPR 2008) (IEEE, 2008), pp. 1–8

    Google Scholar 

  14. X. Niyogi, Locality preserving projections, in Neural Information Processing Systems, vol. 16 (MIT, 2004), p. 153

    Google Scholar 

  15. X. He, S. Yan, Y. Hu, P. Niyogi, H.-J. Zhang, Face recognition using Laplacianfaces. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 328–340 (2005)

    Google Scholar 

  16. J. Yang, D. Zhang, J.-Y. Yang, B. Niu, Globally maximizing, locally minimizing: unsupervised discriminant projection with applications to face and palm biometrics. IEEE Trans. Pattern Anal. Mach. Intell. 29(4), 650–664 (2007)

    Google Scholar 

  17. X. He, D. Cai, S. Yan, H.-J. Zhang, Neighborhood preserving embedding. in Tenth IEEE International Conference on Computer Vision, 2005 (ICCV 2005), vol. 2 (IEEE, 2005), pp. 1208–1213

    Google Scholar 

  18. D. Zhao, Z. Lin, X. Tang, Laplacian pca and its applications, in IEEE 11th International Conference on Computer Vision, 2007 (ICCV 2007) (IEEE, 2007), pp. 1–8

    Google Scholar 

  19. S. Yan, D. Xu, B. Zhang, H.J. Zhang, Q. Yang, S. Lin, Graph embedding and extensions: a general framework for dimensionality reduction. IEEE Trans. Pattern Anal. Machine Intell. 27, 40–51 (2007)

    Google Scholar 

  20. H.-T. Chen, H.-W. Chang, T.L. Liu, Local discriminant embedding and its variants, in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005 (CVPR 2005), vol. 2 (IEEE, 2005), pp. 846–853

    Google Scholar 

  21. J.M. Lee, Riemannian Manifolds: An Introduction to Curvature (Springer, Berlin, 1991)

    Google Scholar 

  22. B. O’Neill, Semi-Riemannian Geometry with Applications to Relativity (Academic Press, New York, 1983)

    Google Scholar 

  23. P.J. Phillips, P.J. Flynn, T. Scruggs, K.W. Bowyer, J. Chang, K. Hoffman, J. Marques, J. Min, W. Worek, Overview of the face recognition grand challenge, in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005 (CVPR 2005), vol. 1 (IEEE, 2005), pp. 947–954

    Google Scholar 

Download references

Acknowledgements

We thank Prof. Zhouchen Lin for valuable comments and suggestions for improving this work. This work is partly supported by National Natural Science Foundation of China (Nos. 61300086, 61173103, 61432003, 6157209) and Fundamental Research Funds for the Central Universities (No. DUT15QY15).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhixun Su .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Liu, R., Su, Z. (2015). Feature Extraction via Vector Bundle Learning. In: Mathematical Problems in Data Science. Springer, Cham. https://doi.org/10.1007/978-3-319-25127-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25127-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25125-7

  • Online ISBN: 978-3-319-25127-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics