Skip to main content

Generalized Foley-Sammon Transform with Kernels

  • Conference paper

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

Abstract

Fisher discriminant based Foley-Sammon Transform (FST) has great influence in the area of pattern recognition. On the basis of FST, the Generalized Foley-Sammon Transform (GFST) is presented. The main difference between the GFST and the FST is that the transformed sample set by GFST has the best discriminant ability in global sense while FST has this property only in part sense. Linear discriminants are not always optimal, so a new nonlinear feature extraction method GFST with Kernels (KGFST) based on kernel trick is proposed in this paper. Linear feature extraction in feature space corresponds to non-linear feature extraction in input space. Then, KGFST is proved to correspond to a generalized eigenvalue problem. Lastly, our method is applied to digits and images recognition problems, and the experimental results show that present method is superior to the existing methods in term of space distribution and correct classification rate.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foley, D.H., Sammon, J.W.: An Optimal Set of Discriminant Vectors. IEEE Trans on Computers 24, 281–289 (1975)

    Article  MATH  Google Scholar 

  2. Guo, Y.F., Li, S.J., et al.: A Generalized Foley-Sammon Transform Based on Generalized Fisher Discriminant Criterion and Its Application to Face Recognition. Pattern Recognition Letters 24, 147–158 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Mika, S., Schölkopf, B., et al.: Kernel PCA and De-noising in Feature Spaces. In: Kearns, M.S., Solla, S.A., Cohn, D.A. (eds.) Advances in Neural Information Processing Systems, vol. 11, pp. 536–542. MIT Press, Cambridge (1999)

    Google Scholar 

  4. Smola, A.J., Schölkopf, B.: A Tutorial on Support Vector Regression. Technical Report (1998)

    Google Scholar 

  5. Bach, F.R., Jordan, M.I.: Kernel Independent Component Analysis (Kernel Machines Section) 3, 1–48 (2002)

    MathSciNet  Google Scholar 

  6. Suykens, J.A.K., Gestel, T.V., et al.: Least Squares Support Vector Machines. World Scientific, Singapore (2002) ISBN 981-238-151-1

    Book  MATH  Google Scholar 

  7. Weinberger, K., Sha, F., Saul, L.: Learning a Kernel Matrix for Nonlinear Dimensionality Reduction. Appearing in Proceedings of the 21st International Conference on Machine Learning, Banff, Canada (2004)

    Google Scholar 

  8. Glenn, F., Murat, D., et al.: A Fast Iterative Algorithm for Fisher Discriminant using Heterogeneous Kernels. Appearing in Proceedings of the 21st International Conference on Machine Learning, Banff, Canada (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Z., Li, L. (2005). Generalized Foley-Sammon Transform with Kernels. In: Wang, J., Liao, X., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427391_131

Download citation

  • DOI: https://doi.org/10.1007/11427391_131

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25912-1

  • Online ISBN: 978-3-540-32065-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics