Hamming-cut-matching algorithm in iris recognition seminar report/pdf/ppt download
Abstract : This paper deals with the basics of iris, its properties and how it adds some advantageous features to recognize the correct person.
In this paper we discuss the details regarding the information about how the iris is located, to distinguish it from other parts of the eye, how the scanner scans the whole pattern of the iris while enrolling and matching and how the scanned patterns are converted into 256 bytes of data so that it can be stored in the database.
We compare the iris codes of the current person who wants to access the database and gives the matched results to the user accordingly.
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 ,defence , etc.., where the security plays one of the major role.
But in the case of fields where the database is huge, the comparison time is very high.
This paper includes the implementation of HAMMING-CUT-MATCHING algorithm which reduces the comparison time for matching the iris code with database so that we can use iris recognition in case of huge databases like voting system.
As we have used hand geometry for verifying the identified person, it adds the security to the whole system. Finally this paper contains the applications of the combined features of the recognition of iris and verification of hand geometry in airport.
Please find the following attachments"Hamming-cut-matching algorithm in iris recognition seminar report/pdf/ppt download" here...............