Iris Location Algorithm Based on Union-Find-Set and Block Search

In view of the problem of unstable recognition effect and low robustness of a traditional iris location algorithm, an iris location algorithm based on union-find-set and block search is proposed. Firstly, the inner circle of the iris is roughly positioned by the method of retrieval, and then, the Ho...

Full description

Saved in:
Bibliographic Details
Published inJournal of sensors Vol. 2021; no. 1
Main Authors Huang, Long-yang, Zhang, Li-qiang, Duan, Xiao-li
Format Journal Article
LanguageEnglish
Published New York Hindawi 2021
John Wiley & Sons, Inc
Subjects
Algorithms
Biometric recognition systems
Convolution
Histograms
Hough transformation
Localization
Object recognition
Robustness
Searching
Online AccessGet full text

Cover

More Information
Summary:In view of the problem of unstable recognition effect and low robustness of a traditional iris location algorithm, an iris location algorithm based on union-find-set and block search is proposed. Firstly, the inner circle of the iris is roughly positioned by the method of retrieval, and then, the Hough transform is used to accurately locate the pupil. After that, the convolution operation is used to roughly locate the outer circle, and then, the original image is partitioned to search. And the grayscale change in the gray histogram of the screenshot is observed to accurately locate the outer circle. The obtained iris and the iris obtained by the traditional localization algorithm are processed by the same iris recognition algorithm. The results show that the proposed image is more effective in image recognition and has good robustness.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-725X
1687-7268
DOI:10.1155/2021/7300864