Weak Preprocessing Iris Feature Matching Based on Bipartite Graph
Iris recognition is widely regarded as one of the most reliable biometric identification technologies. Traditional methods, such as the Daugman algorithm typically normalize the annular iris region into a rectangular format during the preprocessing stage, followed by feature extraction and matching....
Saved in:
| Main Authors: | Jin Zhang, Kangwei Wang, Rongrong Shi, Feng Xie, Qinghe Zheng, Ruizhe Zhang, Cheng Wu, Yiming Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2025-01-01
|
| Series: | IET Signal Processing |
| Online Access: | http://dx.doi.org/10.1049/sil2/2013549 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bipartite Toughness and k-Factors in Bipartite Graphs
by: Guizhen Liu, et al.
Published: (2008-01-01) -
Double dominating sequences in bipartite and co-bipartite graphs
by: Gopika Sharma, et al.
Published: (2025-01-01) -
Communication grouping method of diversified tasks based on maximum matching of weighted bipartite graph
by: WANG Shijie, YANG Ruopeng
Published: (2025-08-01) -
Network slicing resource allocation algorithm based on bipartite graph matching in smart grids
by: Weiwei XIA, et al.
Published: (2024-03-01) -
Star Bicolouring of Bipartite Graphs
by: Daya Gaur, et al.
Published: (2024-08-01)