Skip to main content

Biometric Verification by Projections in Error Subspaces

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2007)

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

Included in the following conference series:

Abstract

A general methodology for design of biometric verification system is presented. It is based on linear feature discrimination using sequential compositions of several types of feature vector transformations: data centering , orthogonal projection onto linear subspace, vector component scaling, and orthogonal projection onto unit sphere. Projections refer to subspaces in global, within-class, and between-class error spaces. Twelve basic discrimination schemes are identified by compositions of subspace projections interleaved by scaling operations and single projection onto unit sphere. For the proposed discriminant features, the Euclidean norm of difference between query and average personal feature vectors is compared with the threshold corresponding to the required false acceptance rate. Moreover, the aggregation by geometric mean of distances in two schemes leads to better verification results. The methodology is tested and illustrated for the verification system based on facial 2D images.

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. Fisher, R.A.: The use of multiple measurements in taxonomic problems. Annals of Eugenics 7, 179–188 (1936)

    Google Scholar 

  2. Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, London (1992)

    Google Scholar 

  3. Golub, G., Loan, C.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1989)

    MATH  Google Scholar 

  4. Swiniarski, R.W., Skowron, A.: Independent Component Analysis, Principal Component Analysis and Rough Sets in Face Recognition. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 392–404. Springer, Heidelberg (2004)

    Google Scholar 

  5. Skarbek, W., Kucharski, K., Bober, M.: Dual LDA for Face Recognition. Fundamenta Informaticae 61, 303–334 (2004)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

JingTao Yao Pawan Lingras Wei-Zhi Wu Marcin Szczuka Nick J. Cercone Dominik Ślȩzak

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Leszczynski, M., Skarbek, W. (2007). Biometric Verification by Projections in Error Subspaces. In: Yao, J., Lingras, P., Wu, WZ., Szczuka, M., Cercone, N.J., Ślȩzak, D. (eds) Rough Sets and Knowledge Technology. RSKT 2007. Lecture Notes in Computer Science(), vol 4481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72458-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72458-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics