Iris Localization Algorithm based on Effective Area
Iris localization is the most crucial part of the iris processing because its accuracy can directly affect the accuracy of biometric identification in subsequent steps. Yet, the quality of iris images may be sharply degraded due to interference from eyelashes and reflections during image acquisition...
        Saved in:
      
    
          | Published in | International journal of antennas and propagation Vol. 2021; pp. 1 - 11 | 
|---|---|
| Main Authors | , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        New York
          Hindawi
    
        2021
     John Wiley & Sons, Inc Wiley  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1687-5869 1687-5877 1687-5877  | 
| DOI | 10.1155/2021/2049646 | 
Cover
| Summary: | Iris localization is the most crucial part of the iris processing because its accuracy can directly affect the accuracy of biometric identification in subsequent steps. Yet, the quality of iris images may be sharply degraded due to interference from eyelashes and reflections during image acquisition, which can affect the localization accuracy adversely. To solve the problem, an iris localization algorithm based on effective area is proposed. First, YOLOv4 is used to crop the image to obtain the effective iris area, which is beneficial in improving the accuracy of subsequent localization. Furthermore, a method to remove reflective noise is proposed, which can effectively avoid the problem of noise interference in the process of inner boundary determination. Finally, aiming at the edge deviation caused by eyelashes, an outer boundary adjustment method is proposed. The experimental results show that the proposed method achieves good performance in the localization of iris images of both good quality and noise interference and outperforms other state-of-the-art methods. | 
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14  | 
| ISSN: | 1687-5869 1687-5877 1687-5877  | 
| DOI: | 10.1155/2021/2049646 |