Hamming Cut

Matching
Algorithm
For Iris
Recognition
Presented by:
R Sai Suryanarayana Sastry
Roll no: 19311A1261
 1. Introduction
2. Identification using Iris recognition
3. Finding Iris in an Image
4. Hamming cut matching Algorithm
Contents 5. Advantages of this algorithm
6. Disadvantages of this algorithm
7. Applications
8. Conclusion
Introduction

John Daugman developed and patented the first algorithms to perform iris recognition in
1953
Hamming – cut matching is also one of the algorithm which reduces the comparison time
for matching the iris code with database
We compare the iris codes of the current person who wants to access the database and
gives the matched results to the user
 As the iris recognition technology produces very low false rate when compared to the
other biometrics results it is very preferable in many systems such as airports, banks,
defense, etc..
Identification using Iris recognition

Iris recognition is one of the biometric systems which utilize iris patterns as
a method of gathering unique information about an individual.
It is considered to be one of the most reliable biometrics with some of the
lowest false rejection and false acceptance rates
The iris, the colored portion of the eye, is approximately 11mm (0.433
inches) in diameter and consists of several layers
 Finding Iris in
an Image
 An iris has a mesh-like texture to it,
with numerous overlays and
patterns that can measured by the
computer.

 The iris-recognition software uses

about 256 “degrees of freedom” or
“points of reference” to search the
data for a match.

 The camera such as CCD having a

high resolution can be set at a
distance of 4 inches to 40 inches
 Hamming cut matching Algorithm
• START THE PROCESS
• WHILE(FOR ALL RECORDS IN
DATA
• BASE)
• HAM=0, I=0, K=0
• WHILE ( I<2047)
• READ A[I] ,D[K]
• /* A is the current iris code
bit ,D is the
• Database iris code bit */
• IF ( A[I] ==D[K])
• • EXIT PROGRAM
THEN
• HAM->HAM+1 • X: TRANSFER THE CONTROL TO
• IF( HAM = MAX ) • THE NEXT DATABASE RECORD
• /* HAM is the hamming • END WHILE
• match MAX is the maximum • PRINT ( “YOU ARE NOT OUR
• AUTHORISED PERSON”);
limit for hamming
• Distance */ • STOP THE PROCESS
• THEN GOTO X;
• ELSE I->I+1, K->K+1
• ENDIF
• ENDIF
• END WHILE
 Advantages of Hamming cut matching
Algorithm

Scalability and speed is high when compared to other systems.

Since this algorithm reduces the comparison time
Uniqueness will be maintained even between the multi-birth
children
The problems of handling forgotten PINs/passwords and
lost/stolen keys or access cards are eliminated
 Disadvantages of Hamming cut matching
Algorithm

Can't use a regular camera; requires IR light source and sensor. Visible light
must be minimized for highest accuracy.
Iris is small in size and can’t be located from a few meters distance. A
person needs to be in close distance with the iris scanning device to be
enrolled on the system properly.
The constant use of this system may cause harm to the iris because it is
constantly being scanned with infrared light.
 Applications of Hamming cut matching
Algorithm

Hamming – cut matching algorithm which reduces the comparison time for
matching the iris code with database
cell phone and other wireless-device-based authentication can use Iris
recognition
Iris based biometric ATM’s are more secure than conventional pin based
ATM’s because it requires biometric verification which cannot be stolen,
copied or faked.
 Passwords, token cards and PINs are all
risks to the security of an organization
due to human nature. Our inability to
remember complex passwords and
tendency to write these down along
with losing token cards or forgetting
PINs all contribute to the possible
Conclusion breakdown in security for an
organization.
If a two-factor authentication system is
implemented, iris recognition with a
hand scanner for the verification, then
the strength of authentication
increases
Thank you