Share Email Print
cover

Proceedings Paper

An efficient scheme of obtaining valid iris texture
Author(s): Yun Lei; XiaoQing Ding
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Obtaining valid iris texture is the precondition of iris based personal verification and identification. With a special camera, illumination environment and users' cooperation play an important role in capturing high quality iris image. However, the captured iris images are usually corrupted by partial occlusion (by eyelids and eyelashes) and white spots (from specular refection). An efficient scheme of obtaining valid iris texture is described in this paper. The described scheme includes two parts: a new algorithm for locating iris texture and a novel algorithm for segmenting corrupted iris texture. In order to overcome the drawbacks of traditional iris texture location methods, which are sensitive to white spots and occlusion, a new location algorithm is proposed. The proposed location algorithm is able to locate iris texture rapidly by avoiding the tremendous computation demands imposed by Canny detector, Hough transformation and integrodifferential operator. In addition, a novel segmentation algorithm is proposed in the latter part of this paper to exclude the occlusion regions from the corrupted annular iris texture. Experiments show that the proposed scheme is efficient and robust for obtaining valid iris texture, even if partial occlusion and white spots appear. Moreover, the average time cost of our scheme is about 150ms on Pentium IV 2.8GHz PC, which satisfies the real-time requirement.

Paper Details

Date Published: 1 March 2005
PDF: 8 pages
Proc. SPIE 5672, Image Processing: Algorithms and Systems IV, (1 March 2005); doi: 10.1117/12.584713
Show Author Affiliations
Yun Lei, Tsinghua Univ. (China)
XiaoQing Ding, Tsinghua Univ. (China)


Published in SPIE Proceedings Vol. 5672:
Image Processing: Algorithms and Systems IV
Edward R. Dougherty; Jaakko T. Astola; Karen O. Egiazarian, Editor(s)

© SPIE. Terms of Use
Back to Top