Abstract
In conventional iris recognition Systems, iris matching is considered as binary-classification problem—authentic matching and imposter matching. Many existing methods employ simple distance to implement iris matching, such as Hamming distance. These methods can't make full use of iris feature and generate relatively high FRR (False Reject Rate), FAR (False Accept Rate), in addition, these methods are less robust. To overcome this problem, in this paper, we treat iris matching as a multi-classification problem and use ferns classifier which fit nicely into a naive Bayesian framework to implement iris matching. To recognize iris, the classifier uses hundreds of binary feature vectors and approximates class posterior probability. Finally, our proposed iris matching method is tested in verification experiment. Experimental results show that the proposed method can greatly improve performance of iris recognition system.
Sign-in/Register to access full text options 
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.
