• DocumentCode
    2084055
  • Title

    Lef3a: Pupil segmentation using Viterbi search algorithm

  • Author

    Krichen, Emine

  • Author_Institution
    Morpho, Issy-les-Moulineaux, France
  • fYear
    2012
  • fDate
    March 29 2012-April 1 2012
  • Firstpage
    323
  • Lastpage
    329
  • Abstract
    A non-circular pupil segmentation approach using Viterbi path research is presented. Around the circle approximation of the pupil, a large region of gradient is produced radially. An enhancement step is used in order to remove outliers from the gradient image. A Viterbi algorithm is applied to find the contour that maximizes the gradient value along a connex contour. Our method which we called Lef3a (a snake that lives in Tunisian desert) is compared to three state of the art methods: a circular detector, an elliptical detector and a Snake detector. The two first methods are developed by our team; the last method is an external work based on Daugman´s published method. We will show some segmentation results on non circular pupils, and we will compare the performance of all segmentation methods coupled with a standard iris coding and matching process on Notre Dame Database and our private database. Finally all methods are compared in terms of time processing.
  • Keywords
    approximation theory; gradient methods; image coding; image enhancement; image matching; image segmentation; iris recognition; maximum likelihood estimation; visual databases; Lef3a; Notre Dame database; Viterbi algorithm; Viterbi path research; Viterbi search algorithm; circle approximation; enhancement step; gradient image; large gradient region; noncircular pupil segmentation; outlier removal; standard iris coding; standard iris matching process; Databases; Detectors; Image edge detection; Image segmentation; Iris; Iris recognition; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Biometrics (ICB), 2012 5th IAPR International Conference on
  • Conference_Location
    New Delhi
  • Print_ISBN
    978-1-4673-0396-5
  • Electronic_ISBN
    978-1-4673-0397-2
  • Type

    conf

  • DOI
    10.1109/ICB.2012.6199827
  • Filename
    6199827