scholarly journals Iris Matching Step Implementation in FPGA

2019 ◽  
Vol 2 (1) ◽  
pp. 26-36
Author(s):  
Aumama M. Farhan ◽  
M. F. Al-Gailani

Iris recognition system is broadly being utilized as it has distinctive patterns that gives it a powerful strategy to distinguish between persons for identification purposes. However, this system in this implementation requires large memory capacity and high computation time. These factors make us in a challenge to find a way to run this algorithm in a hardware platform. The hardware implementation features reduce the execution time by exploiting the parallelism and pipeline. The present work addresses this issue when reducing execution time by implementing the matching step using hamming distance algorithm on the target device FPGA KINTEX 7 using Xilinx system generator. The obtained result demonstrates that the execution time has been accelerated to 1.32 ns, which is almost at least four times faster than existing works

2017 ◽  
Vol 1 (4-2) ◽  
pp. 175
Author(s):  
Abdulrahman Aminu Ghali ◽  
Sapiee Jamel ◽  
Kamaruddin Malik Mohamad ◽  
Nasir Abubakar Yakub ◽  
Mustafa Mat Deris

With the prominent needs for security and reliable mode of identification in biometric system. Iris recognition has become reliable method for personal identification nowadays. The system has been used for years in many commercial and government applications that allow access control in places such as office, laboratory, armoury, automated teller machines (ATMs), and border control in airport. The aim of the paper is to review iris recognition algorithms. Iris recognition system consists of four main stages which are segmentation, normalization, feature extraction and matching. Based on the findings, the Hough transform, rubber sheet model, wavelet, Gabor filter, and hamming distance are the most common used algorithms in iris recognition stages.  This shows that, the algorithms have the potential and capability to enhanced iris recognition system. 


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Spencer Fowers ◽  
Alok Desai ◽  
Dah-Jye Lee ◽  
Dan Ventura ◽  
James Archibald

This paper presents a novel feature descriptor called TreeBASIS that provides improvements in descriptor size, computation time, matching speed, and accuracy. This new descriptor uses a binary vocabulary tree that is computed using basis dictionary images and a test set of feature region images. To facilitate real-time implementation, a feature region image is binary quantized and the resulting quantized vector is passed into the BASIS vocabulary tree. A Hamming distance is then computed between the feature region image and theeffectively descriptive basis dictionary imageat a node to determine the branch taken and the path the feature region image takes is saved as a descriptor. The TreeBASIS feature descriptor is an excellent candidate for hardware implementation because of its reduced descriptor size and the fact that descriptors can be created and features matched without the use of floating point operations. The TreeBASIS descriptor is more computationally and space efficient than other descriptors such as BASIS, SIFT, and SURF. Moreover, it can be computed entirely in hardware without the support of a CPU for additional software-based computations. Experimental results and a hardware implementation show that the TreeBASIS descriptor compares well with other descriptors for frame-to-frame homography computation while requiring fewer hardware resources.


2020 ◽  
Vol 8 (6) ◽  
pp. 2298-2303

By an growing demand for security systems, identification of individuals based on biometric techniques has been a major role of research and education. Biometric recognition examines unique behavioral characteristics, such as an iris, face, retina, voice, fingerprint, hand geometry etc. The iris is one of the highly consistentmethods that used to identify individuals because it is fixed and does not change throughout life. This features have led to increasing importance in its use for biometric recognition. In this study, we proposed a system combiningDiscrete Wavelet Transformation and Principal Component Analysis forfeature extraction process of an iris. The idea of using DWT behind PCA is to decrease the resolution of the iris pattern. The Discrete Wavelet Transform (DWT) is depend on sub-band codingwhichreduces the computation time and resources required. PCA is used for further extraction. Our experimental calculation supports the efficient performance of the proposed system.


2020 ◽  
Vol 9 (6) ◽  
pp. 2358-2363
Author(s):  
Shahrizan Jamaludin ◽  
Nasharuddin Zainal ◽  
W. Mimi Diyana W. Zaki

Iris recognition has been around for many years due to an extensive research on the uniqueness of human iris. It is well known that the iris is not similar to each other which means every human in the planet has their own iris pattern and cannot be shared. One of the main issues in iris recognition is iris segmentation. One element that can reduce the accuracy of iris segmentation is the presence of specular reflection. Another issue is the speed of specular reflection removal since the iris recognition system needs to process a lot of irises. In this paper, a specular reflection removal method was proposed to achieve a fast and accurate specular reflection removal. Some modifications were implemented on the existing pixels properties method. Based on the results, the proposed method achieved the fastest execution time, the highest segmentation accuracy and the highest SSIM compared to the other methods. This proves that the proposed method is fast and accurate to be implemented in the iris recognition systems.


Author(s):  
Guangzhu Xu ◽  
Yide Ma ◽  
Zaifeng Zhang

Iris recognition has been shown to be very accurate for human identification. In this chapter, an efficient and automatic iris recognition system using Intersecting Cortical Model (ICM) neural network is presented which includes two parts mainly. The first part is image preprocessing which has three steps. First, iris location is implemented based on local areas. Then the localized iris area is normalized into a rectangular region with a fixed size. At last the iris image enhancement is implemented. In the second part, the ICM neural network is used to generate iris codes and the Hamming Distance between two iris codes is calculated to measure the dissimilarity. In order to evaluate the performance of the proposed algorithm, CASIA v1.0 iris image database is used and the recognition results show that the system has good performance.


Author(s):  
Isam Abu Qasmieh ◽  
Hiam Alquran ◽  
Ali Mohammad Alqudah

A fast and accurate iris recognition system is presented for noisy iris images, mainly the noises due to eye occlusion and from specular reflection. The proposed recognition system will adopt a self-customized support vector machine (SVM) and convolution neural network (CNN) classification models, where the models are built according to the iris texture GLCM and automated deep features datasets that are extracted exclusively from each subject individually. The image processing techniques used were optimized, whether the processing of iris region segmentation using iterative randomized Hough transform (IRHT), or the processing of the classification, where few significant features are considered, based on singular value decomposition (SVD) analysis, for testing the moving window matrix class if it is iris or non-iris. The iris segments matching techniques are optimized by extracting, first, the largest parallel-axis rectangle inscribed in the classified occluded-iris binary image, where its corresponding iris region is crosscorrelated with the same subject’s iris reference image for obtaining the most correlated iris segments in the two eye images. Finally, calculating the iriscode Hamming distance of the two most correlated segments to identify the subject’s unique iris pattern with high accuracy, security, and reliability.


Author(s):  
Raed T. Al-Zubi ◽  
Khalid A. Darabkh ◽  
Nayel Al-Zubi

One of the crucial and inherent issues in a practical iris recognition system is the occlusion that happens due to eyelids and eyelashes. This occlusion increases the complexity and degrades the performance of matching and feature extraction processes. Generally, two types of approaches have been proposed to solve this issue. The first approach requires generating an iris mask that indicates which part of the iris is useful and which others are occluded. However, in the second approach, a fixed region of interest (ROI) within the iris area is selected to avoid the regions of occlusion. In this paper, we experimentally study both approaches but due to the latter characteristic, which is its ability to simplify the matching and feature extraction processes, it has been adopted in our techniques used, specifically for iris segmentation, iris normalization, and feature extraction. Accordingly, for matching and feature extraction, the lower side of the pupillary region (i.e. the innermost 25% of the lower half of the iris ring) is found to be the best ROI. This small area of iris is almost free of eyelids and eyelashes and it contains abundant texture information. Interestingly, this selection of small area helps us in proposing a simple yet efficient technique for feature extraction, called mean-based feature extraction technique (MB-FET). This technique is based on analyzing the local intensity variations. The proposed technique achieves a lower processing burden than other traditional methods such as Fourier or wavelet decompositions (e.g. Gabor wavelet). In most traditional techniques, many parameters (e.g. five parameters for 2D-Gabor filter) must be optimally determined in advance to achieve an accurate feature extraction process. Unfortunately, these parameters may not match various variations in image capturing conditions (e.g. variations in illumination due to change in image capturing distance). Moreover, the basic functions of the traditional methods are fixed in advance (off-line) and do not necessarily match the texture of all irises in the database. However, for our proposed technique MB-FET, there is no need to determine in advance any parameter or basic function. MB-FET dynamically adapts its parameter (only one parameter) with intensity variations. The proposed technique generates a binary iris code, hence a simple and fast matching process is done using the Hamming distance. The experimental results using the CASIA iris database show that the proposed technique achieves promising results for a robust and reliable iris recognition.


2020 ◽  
Author(s):  
Rodrigo N. França ◽  
David A. Ribeiro ◽  
Renata L. Rosa ◽  
Demostenes Z. Rodriguez

Nowadays, recognition patterns play an important role in several applications, in which the iris recognition is widely developed in authentication systems today. For such systems models, it is necessary to use as input high quality images, which will reduce possible recognition errors. Thus, this article develops experimental tests to study the image quality on the performance of the iris recognition, using different quality metrics. Thus, experiments are conducted with different iris images and applying the Hamming distance algorithm as reference measurement to accept or denied an user authentication. To this end the OSIRIS platform was used in the tests, because it permits to calculate the Hamming Distance between two binary codes. Based on the results obtained in the tests using different metrics, can be inferred that the image quality has a considerable impact on the performance of an iris recognition system. Therefore, the image capture process is an important step.


2018 ◽  
Vol 1 (2) ◽  
pp. 34-44
Author(s):  
Faris E Mohammed ◽  
Dr. Eman M ALdaidamony ◽  
Prof. A. M Raid

Individual identification process is a very significant process that resides a large portion of day by day usages. Identification process is appropriate in work place, private zones, banks …etc. Individuals are rich subject having many characteristics that can be used for recognition purpose such as finger vein, iris, face …etc. Finger vein and iris key-points are considered as one of the most talented biometric authentication techniques for its security and convenience. SIFT is new and talented technique for pattern recognition. However, some shortages exist in many related techniques, such as difficulty of feature loss, feature key extraction, and noise point introduction. In this manuscript a new technique named SIFT-based iris and SIFT-based finger vein identification with normalization and enhancement is proposed for achieving better performance. In evaluation with other SIFT-based iris or SIFT-based finger vein recognition algorithms, the suggested technique can overcome the difficulties of tremendous key-point extraction and exclude the noise points without feature loss. Experimental results demonstrate that the normalization and improvement steps are critical for SIFT-based recognition for iris and finger vein , and the proposed technique can accomplish satisfactory recognition performance. Keywords: SIFT, Iris Recognition, Finger Vein identification and Biometric Systems.   © 2018 JASET, International Scholars and Researchers Association    


Sign in / Sign up

Export Citation Format

Share Document