An iris recognition algorithm using local extreme points

  • Jiali Cui*
  • , Yunhong Wang
  • , Tieniu Tan
  • , Li Ma
  • , Zhenan Sun
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The performance of an iris recognition algorithm depends greatly on its classification ability as well as speed. In this paper, an iris recognition algorithm using local extreme points is proposed. It first detects the local extreme points along the angular direction as key points. Then, the sample vector along the angular direction is encoded into a binary feature vector according to the surface trend (gradient) characterized by the local extreme points. Finally, the Hamming distance between two iris patterns is calculated to make a decision. Extensive experimental results show the high performance of the proposed method in terms of accuracy and speed.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsDavid Zhang, Anil K. Jain
PublisherSpringer Verlag
Pages442-449
Number of pages8
ISBN (Print)3540221468, 9783540221463
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3072
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An iris recognition algorithm using local extreme points'. Together they form a unique fingerprint.

Cite this