• DocumentCode
    3315650
  • Title

    An improved eye localization algorithm using multi-cue facial information

  • Author

    Ali, Tauseef ; Kim, Intaek

  • Author_Institution
    Dept. of Electr. Eng., COMSATS Inst. of Inf. Technol., Abbottabad
  • fYear
    2009
  • fDate
    17-18 Feb. 2009
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In this paper, we propose a four step method to detect center of eyes robustly and accurately. The method doesn´t put any restrictions on the background. The method is based on AdaBoost algorithm for face and eye candidate points detection. Candidate points are tuned such that two candidate points are exactly in centers of irises. Mean crossing function and convolution template are proposed to filter out candidate points and select iris pair. The advantage of using this kind of hybrid method is that AdaBoost is robust to different illumination conditions and backgrounds. The tuning step improves the precision of iris localization while the convolution filter and mean crossing function reliably filter out candidate points and select iris pair. The proposed structure is evaluated on three public databases, Bern, Yale and BioID. Extensive experimental results verified the robustness and accuracy of the proposed method. Using the Bern database, the performance of the proposed algorithm is also compared with some of the existing methods.
  • Keywords
    face recognition; visual databases; AdaBoost algorithm; Bern database; BioID database; Yale database; convolution filter; convolution template; eye localization algorithm; mean crossing function; multi-cue facial information; public databases; Convolution; Databases; Eyes; Face detection; Face recognition; Facial features; Filters; Iris; Robustness; Shape; AdaBoost; candidate point; mean crossing function; tunning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer, Control and Communication, 2009. IC4 2009. 2nd International Conference on
  • Conference_Location
    Karachi
  • Print_ISBN
    978-1-4244-3313-1
  • Electronic_ISBN
    978-1-4244-3314-8
  • Type

    conf

  • DOI
    10.1109/IC4.2009.4909266
  • Filename
    4909266