Year-end Sale % OFF 
Abstract
In this paper, we present a new method for iris recognition based on elastic graph matching and Gabor wavelets. We have used the circular Hough transform to determine the iris boundaries. Individual segmented irises are represented as labeled graphs. Nodes are labeled with jets; edges are labeled with distance vectors. A similarity function is defined to compare two graphs, taking into account the similarities of individual jets and the relative distortion of the graphs. For matching and recognition, only jets referring to corresponding points are compared. Recognition results are given for galleries of irises from CASIA version 1 and UBIRIS databases. The numerical results show that, the elastic graph matching is a effective technique for iris matching process. We also compare our results with previous results and find out that, the elastic graph matching is an effective matching performance.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
