Abstract

This paper describes a new iris recognition algorithm, which uses a low level of details. Combining statistical classification and elastic boundary fitting, the iris is first localized. Then, the localized iris image is down-sampled by a factor of m, and filtered by a modified Laplacian kernel. Since the output of the Laplacian operator is sensitive to a small shift of the full-resolution iris image, the outputs of the Laplacian operator are computed for all space-shifts. The quantized output with maximum entropy is selected as the final feature representation. Experimentally we showed that the proposed method produces superb performance in iris segmentation and recognition. Index Terms: iris segmentation, iris recognition, shift-invariant, multiscale Laplacian kernel.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call