Iris code matching using adaptive Hamming distance
The most popular metric distance used in iris code matching is Hamming distance. In this paper, we improve the performance of iris code matching stage by applying adaptive Hamming distance. Proposed method works with Hamming subsets with adaptive length. Based on density of masked bits in the Hammin...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2016
|
| Subjects: |
| _version_ | 1796862069655470080 |
|---|---|
| author | Dehkordi, A. B. Abu-Bakar, S. A. R. |
| author_facet | Dehkordi, A. B. Abu-Bakar, S. A. R. |
| author_sort | Dehkordi, A. B. |
| collection | ePrints |
| description | The most popular metric distance used in iris code matching is Hamming distance. In this paper, we improve the performance of iris code matching stage by applying adaptive Hamming distance. Proposed method works with Hamming subsets with adaptive length. Based on density of masked bits in the Hamming subset, each subset is able to expand and adjoin to the right or left neighbouring bits. The adaptive behaviour of Hamming subsets increases the accuracy of Hamming distance computation and improves the performance of iris code matching. Results of applying proposed method on Chinese Academy of Science Institute of Automation, CASIA V3.3 shows performance of 99.96% and false rejection rate 0.06. |
| first_indexed | 2024-03-05T20:05:59Z |
| format | Conference or Workshop Item |
| id | utm.eprints-73381 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T20:05:59Z |
| publishDate | 2016 |
| publisher | Institute of Electrical and Electronics Engineers Inc. |
| record_format | dspace |
| spelling | utm.eprints-733812017-11-21T08:17:09Z http://eprints.utm.my/73381/ Iris code matching using adaptive Hamming distance Dehkordi, A. B. Abu-Bakar, S. A. R. TK Electrical engineering. Electronics Nuclear engineering The most popular metric distance used in iris code matching is Hamming distance. In this paper, we improve the performance of iris code matching stage by applying adaptive Hamming distance. Proposed method works with Hamming subsets with adaptive length. Based on density of masked bits in the Hamming subset, each subset is able to expand and adjoin to the right or left neighbouring bits. The adaptive behaviour of Hamming subsets increases the accuracy of Hamming distance computation and improves the performance of iris code matching. Results of applying proposed method on Chinese Academy of Science Institute of Automation, CASIA V3.3 shows performance of 99.96% and false rejection rate 0.06. Institute of Electrical and Electronics Engineers Inc. 2016 Conference or Workshop Item PeerReviewed Dehkordi, A. B. and Abu-Bakar, S. A. R. (2016) Iris code matching using adaptive Hamming distance. In: 4th IEEE International Conference on Signal and Image Processing Applications, ICSIPA 2015, 19-21 Oct 2015, Kuala Lumpur, Malaysia. https://www.scopus.com/inward/record.uri?eid=2-s2.0-84971634697&doi=10.1109%2fICSIPA.2015.7412224&partnerID=40&md5=2cf3d4fb585dabd5cef97526dd786c8b |
| spellingShingle | TK Electrical engineering. Electronics Nuclear engineering Dehkordi, A. B. Abu-Bakar, S. A. R. Iris code matching using adaptive Hamming distance |
| title | Iris code matching using adaptive Hamming distance |
| title_full | Iris code matching using adaptive Hamming distance |
| title_fullStr | Iris code matching using adaptive Hamming distance |
| title_full_unstemmed | Iris code matching using adaptive Hamming distance |
| title_short | Iris code matching using adaptive Hamming distance |
| title_sort | iris code matching using adaptive hamming distance |
| topic | TK Electrical engineering. Electronics Nuclear engineering |
| work_keys_str_mv | AT dehkordiab iriscodematchingusingadaptivehammingdistance AT abubakarsar iriscodematchingusingadaptivehammingdistance |