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
-
Communication grouping method of diversified tasks based on maximum matching of weighted bipartite graph
by: WANG Shijie, YANG Ruopeng
Published: (2025-08-01) -
Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
by: A. I. Antonov, et al.
Published: (2015-03-01) -
Learning edge importance in bipartite graph-based recommendations
by: Robert Kwieciński, et al.
Published: (2022-09-01) -
Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
by: Luyi Li, et al.
Published: (2025-01-01) -
Neighbor-Enhanced Link Prediction in Bipartite Networks
by: Guangtao Cheng, et al.
Published: (2025-05-01)