An improved hough transform algorithm in iris recognition system

• Main Author: Zadeh, Saeed Khorashadi
• Format: Thesis
• Language: English
• Published: 2012
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/31863/1/SaeedKhorashadiZadehMFSKSM2012.pdf; http://eprints.utm.my/id/eprint/31863/
• Institution: Universiti Teknologi Malaysia

The security is an important aspect in our daily life whichever the system is considered, security plays vital role. The biometric person identification technique based on the pattern of human iris is suitable to be applied to access control and provides strong e-security. Iris recognition is one of important biometric recognition approaches in human identification is very active topic in research and practical application. Iris Recognition System consists of Acquisition, Localization, Feature Extraction and Feature Matching phases. Localization stage includes Normalization and Segmentation phase. Circular Hough Transform is one the best suitable algorithm in segmentation phase, but as a result of having two for-loops in its structure; CHT algorithm consumes high time processing and uses high storage capacity. These drawbacks make it hardly appropriate for real time applications of iris recognition system. To improve time and storage complexity, firstly, a preprocessing of CUHK iris image dataset is done to eliminate unnecessarily regions and secondly, a radius-table is created based on pupil size variation of CUHK iris image dataset. The results show at least 40% efficiency in time complexity and minimum 20% efficiency in storage complexity.