Abstract

De-duplication of biometrics is not scalable when the number of people to be enrolled into the biometric system runs into billions, while creating a unique identity for every person. In this paper, we propose an iris classification based on sparse representation of log-gabor wavelet features using on-line dictionary learning (ODL) for large-scale de-duplication applications. Three different iris classes based on iris fiber structures, namely, stream, flower, jewel and shaker, are used for faster retrieval of identities. Also, an iris adjudication process is illustrated by comparing the matched iris-pair images side-by-side to make the decision on the identification score using color coding. Iris classification and adjudication are included in iris de-duplication architecture to speed-up the identification process and to reduce the identification errors. The efficacy of the proposed classification approach is demonstrated on the standard iris database, UPOL.

Highlights

  • Various government sectors in the world provide welfare services like NREGS, TPDS, old age pensions, health insurance etc... for the benefit of the people

  • Three different iris classes based on iris fiber structures, namely, stream, flower, jewel and shaker, are used for faster retrieval of identities in large-scale de-duplication applications

  • 6 Conclusion In this paper, an iris classification is proposed based on sparse representation of log-gabor wavelet features using on-line dictionary learning (ODL) for large-scale de-duplication applications

Read more

Summary

Introduction

Various government sectors in the world provide welfare services like NREGS (national rural employment guarantee system), TPDS (targeted public distribution system), old age pensions, health insurance etc... for the benefit of the people. We propose an iris classification based on sparse representation of log-gabor wavelet features using on-line dictionary learning (ODL). An iris adjudication process is proposed by comparing the matched iris-pair images side-by-side to make the decision on the identification score using color coding. There are over 6.26 quadrillion (6,262,668,889,152,840) iris matches performed in de-centralized manner to remove duplicate enrollments in 61 days with high-end blade servers equipment which is not a scalable solution Increasing the blade servers is not an optimal solution, especially in large-scale iris databases There should be another layer for iris classification to reduce the search space in the de-duplication engine. An iris adjudication process is done by comparing the matched iris-pair images side-by-side to know the confidence-level on the matching score based on color coding

Proposed iris classification and adjudication framework
SVM-4Class-PCA-Kmeans classification approach
Conclusion
Full Text
Published version (Free)

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 call