Skip to main content

Genetic Model Optimization for Hausdorff Distance-Based Face Localization

  • Conference paper
  • First Online:
Biometric Authentication (BioAW 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2359))

Included in the following conference series:

Abstract

In our previous work we presented a model-based approach to perform robust, high-speed face localization based on the Hausdorff distance. A crucial step during the design of the system is the choice of an appropriate edge model that fits for a wide range of different human faces. In this paper we present an optimization approach that creates and successively improves such a model by means of genetic algorithms. To speed up the process and to prevent early saturation we use a special bootstrapping method on the sample set. Several initialization functions are tested and compared.

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. BioID face database. http://www.bioid.com/research/index.html.

  2. M.P. Dubuisson and A.K. Jain. A modified Hausdorff distance for object matching. In ICPR94, pages A:566–568, Jerusalem, Israel, 1994.

    Google Scholar 

  3. David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, 1989.

    Google Scholar 

  4. John H. Holland. Adaption in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.

    MATH  Google Scholar 

  5. Oliver Jesorsky, Klaus J. Kirchberg, and Robert W. Frischholz. Robust Face Detection Using the Hausdorff Distance. In Josef Bigun and Fabrizio Smeraldi, editors, Audio-and Video-Based Person Authentication-AVBPA 2001, volume 2091 of Lecture Notes in Computer Science, pages 90–95, Halmstad, Sweden, 2001. Springer.

    Chapter  Google Scholar 

  6. K. Messer, J. Matas, J. Kittler, J. Luettin, and G. Maitre. XM2VTSDB: The extended M2VTS database. In Second International Conference on Audio and Video-based Biometric Person Authentication, pages 72–77, March 1999.

    Google Scholar 

  7. W. Rucklidge. Efficient Visual Recognition Using the Hausdorff Distance, volume 1173 of Lecture notes in computer science. Springer, 1996.

    Book  MATH  Google Scholar 

  8. F. Smeraldi, N. Capdevielle, and J. Bigun. Facial features detection by saccadic exploration of the Gabor decomposition and Support Vector Machines. In Proceedings of the 11th Scandinavian Conference on Image Analysis-SCIA 99, Kangerlussuaq, Greenland, volume I, pages 39–44, June 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kirchberg, K.J., Jesorsky, O., Frischholz, R.W. (2002). Genetic Model Optimization for Hausdorff Distance-Based Face Localization. In: Tistarelli, M., Bigun, J., Jain, A.K. (eds) Biometric Authentication. BioAW 2002. Lecture Notes in Computer Science, vol 2359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47917-1_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-47917-1_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43723-9

  • Online ISBN: 978-3-540-47917-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics