Optimized Algorithms Based Iris Recognition System
Optimized Algorithms Based Iris Recognition System
Abstract
Human Being’s eyes are recognized as the most efficient biometric trait. Because of its great
accuracy, reliability as well as originality iris recognition is included in numerous fields associated
with access control as well as security. For efficient working of the iris recognition system the
researchers have to face many challenges in designing an effective system. In this article the author
discusses the new way of individual identification depending upon the iris recognition developed by
many researchers. It includes various techniques used by them and their effectiveness in iris
recognition process.
Keywords: Artificial neural, Gabor filter, Genetic algorithm, K-Mean clustering, Log Gabor filter,
Network
Introduction
Growth of information technology along with risks upon security has increased the need of a robust as well as
extremely accurate human recognition system. Authentication of any human can be carried out by means of
password, biometrics or even smart cards. Keeping in mind password and handling smart card is tough, therefore
biometrics dependent authentication system is extremely recommended. Biometrics means the scientific discipline
which includes identifiers such as fingerprints, iris, face and also voice that are unique measurable features utilized to
tag or explain a person’s identity. The biometric traits are unique to a person because they are hereditary in nature
thus turned out to be more accurate as compared to traditional human authentication schemes.12 This system collects
the biometric features of an individual, elicit-ate the characteristics with the gathered biometric traits and matches
the elicited features together with the one saved in the database, in order to confirm the claimed identity. Iris is
recognized as more stable as well as distinctive as the design and structure involving iris left constant in course of life.
The possibility that two different individual possess similar iris is 1 in 1078 (Morimoto et al., 2005). There are multiple
problems throughout entire procedure of Iris Recognition in the form of obtaining high quality picture, segmentation
of the concentric boundaries, scalability, and appropriate characteristic representation as well as matching. John
Dougman proposed first iris recognition system; afterwards various techniques had been proposed to enhance this
biometric system. The procedure of iris recognition includes some pre-processing phases like localization,
segmentation as well as normalization and also some filtering methods are employed to produce iris templates. The
final binary template (iris code) can be generated by quantizing the phase details included in the filtered normalized
image. The acquired binary template is then saved in the database. Bit-based metrics such as hamming distance is
utilized for assessment of iris codes during iris recognition Inverse Biometrics refers to the procedure of reconstructing
or maybe re-engineering the biometric template to acquire details regarding the identification related to the
template.5
1
Department of Computer Engineering and Technology, Guru Nanak Dev University, Amritsar, Punjab, India.
2
Department of Electronics and Communication Engineering, DAV Institute of Engineering and Technology, Jalandhar, Punjab,
India.
Correspondence: Ms. Amanpreet Kaur, Guru Nanak Dev University, Amritsar, Punjab, India.
E-mail Id: [email protected]
How to cite this article: Kaur A, Singh A. Optimized Algorithms Based Iris Recognition System. J Adv Res Image Proc Appl 2017;
4(1&2): 8-15.
In today’s situation in which the biometric systems are for forensic applications, etc. Within this article, a
taking over the traditional authentication techniques, different scheme for iris recognition has been explained
inverse biometrics provides for a critical security threat. using multiple classifiers. Performance of the every
Since iris recognition is utilized in offering single employed selection technique is calculated using
authentication or personal identification for extremely parameters like false real rate, false acceptance rate,
confidential as well as secure systems including airports, etc.
Literature Survey
Table 1.Comparison of Different State of Art
Authors Year Reference No. Parameters Techniques Strengths Limitations
John D January [1] Pupillary and Band pass 2-D filter For badly focused Not so
2004 the outer kernel, 2-D wavelet images of eye, accurate
(IEEE) (limbus) demodulation Demodulation because of
boundary of phase sequence false matches
iris bits are set
High speed
performance
Araghi March [2] Covariance Discrete wavelet Simulation results Less amount
LF, et 2010 matrix transform by are very promising of data set
al. (IMECS) utilizing This method offers used
Competitive Neural good class
Network (LVQ) discriminacy
Sibai FN 2010 [3] RGB values Feed forward High accuracy up Only a single
et al. (Elsevier) extracted artificial Neural to 93.33% Iris was
from the iris network with the processed
jpeg image back propagation instead of
algorithm Whole pair
Raja SV 2013 [4] Accuracy rate, Genetic algorithm High accuracy rate In the starting
et al. (IJCA) average time Neural network and reduced stage, the
learning time is network
achieved started
mugging up
rather than
learning as
well as
predicting
Galbally 2013 [5] Motion blur, Genetic algorithm High level of Not much
J et al. (Elsevier) contrast, matching among accurate
occlusion real samples
Rai H et 2013 [6] Zigzag Support vector Efficient for both Small dataset
al. (Elsevier) collarette area machine, hamming identification as used
of iris distance, parabola well as verification
detection, trimmed
median filter
De 2014 [7] Mean, relative Histogram, FIRME provides a Behave
Marsico (Elsevier) error Hamming distance solution for both negatively
M et al. CSUM algorithm face spoofing because of
detection, and for bad
optimal sample acquisition,
selection, by sensor
utilizing iterative problem,
entropy evaluation incorrect
device
orientation
9
Kaur A et al. J. Adv. Res. Image Proc. Appl. 2017; 4(1&2)
Raja KB 2014 [8] Equal error Deep sparse Real life dataset Not so much
et al. (Elsevier) rate (EER), filtering usedProvide high accurate since
contrast, degree of Robust accuracy is
diameter features 75%
Sánchez 2015 [9] Percentage of Modular neural Optimizes the Division of
D et al. (Elsevier) complexity network, genetic multiple modular tasks cannot
algorithm neural networks Be done
which utilize
different data
points in the
training phase,
providing multiple
results in the same
evolution
Bhateja 2015 [10] Sparse k-nearest distance Highly accurate
AK et (PATREC) Concentration classifier, and efficient
al. Index, cumulative sparse method
Confidence concentration Combines the
Index index based strengths of three
classifiers, sector classifiers
based classifier,
genetic algorithm,
canny edge
detection, hough
transform
Ibrahim 2016 [11] False Libor Masek and Accuracy rate is Error rate
AA et (JCC) acceptance genetic algorithms, higher increases with
al. rate, and Principal the
correct Component increase in
recognition Analysis (PCA) number of
Rate, False samples
Rejection Rate and the
recognition
rate
decreases
when large
samples are
utilized
Kaur R 2016 [12] False Genetic Algorithm Provides high Small amount
et al. (IJCET) acceptance accuracy rate and of data set
rate, false real low error used
rate
10
J. Adv. Res. Image Proc. Appl. 2017; 4(1&2) Kaur A et al.
11
Kaur A et al. J. Adv. Res. Image Proc. Appl. 2017; 4(1&2)
12
J. Adv. Res. Image Proc. Appl. 2017; 4(1&2) Kaur A et al.
Artificial neural network (ANN) is a self-learning The selection operator allows selecting a parent
approach that imitates the properties of biological chromosomes based on their related fitness values. The
nervous systems. It is a system that changes its chromosomes having the best fitness values are
parameters based on external or internal information forwarded to the next generations. This sort of selection
that flows through the network during the learning is referred as elitism. There are various selection
phase. operators available for usage among which three main
selection operators utilized in this article are: 2.1 Rank
Genetic Algorithms Selection: In this, the population is categorized based on
the fitness values. The fitness allocated to every single
A fundamental genetic algorithm consists of three chromosome relies upon its location among the
operators: Selection, Crossover, and Mutation. The individual’s rank and not on the actual fitness value. The
algorithm begins by considering a set of chromosomes probability of every single chromosome getting selected
(usually the elements or units on which we want to for mating is actually their fitness normalized with the
apply genetic algorithms), called population. The overall fitness of population.
chromosomes of the present population are employed
to produce offspring which is forwarded to the next Roulette Wheel Selection
generation or population hoping that newly generated
offspring chromosomes will be better in comparison to The chromosomes tend to be mapped to contiguous
parent chromosomes.18 sections of a line in a way that each portion is equal in
size to its fitness. Any arbitrary number is produced, and
Fitness Evaluation the chromosome whose section spans the random
number is selected. Till the needed number of
While producing offspring chromosomes, initially the chromosomes is obtained (called mating population),
fitness of all the chromosomes within consideration is the procedure is repeated another time.20
determined by means of predefined fitness function.
13
Kaur A et al. J. Adv. Res. Image Proc. Appl. 2017; 4(1&2)
14
J. Adv. Res. Image Proc. Appl. 2017; 4(1&2) Kaur A et al.
deep sparse filtering. Pattern Recognition Letters and computationally efficient approach for
2015; 57: 33-42. unconstrained iris segmentation. Image and Vision
9. Sánchez D, Melin P, Castillo O. Optimization of Computing 2010; 28(2): 261-9.
modular granular neural networks using a 15. Fatt Ng RY, Tay YH, Mok KM. A review of iris
hierarchical genetic algorithm based on the recognition algorithms. Transactions Information
database complexity applied to human recognition. Technology 2008; 2: 1-7.
Information Sciences 2015; 309: 73-101. 16. Sahmoud SA, Abuhaiba IS. Efficient iris
10. Bhateja AK, Sharma S, Chaudhury S, et al. Iris segmentation method in unconstrained
recognition based on sparse0 representation and k- environments. Pattern Recognition Letters 2013;
nearest subspace with genetic algorithm. Pattern 46(12): 3174-85.
Recognition Letters 2016; 73: 13-8. 17. Rankin DM, Scotney BW, Morrow PJ, et al. Iris
11. Ibrahim AA, Khalaf TA, Ahmed BM. Design and recognition failure over time: the effects of texture.
implementation of iris pattern recognition using Pattern Recognition Letters 2012; 45(1): 145-50.
wireless network system. Journal of Computer and 18. Chen R, Lin X, Ding T. Liveness detection for iris
Communications 2016; 4(7): 15. recognition using multispectral images. Pattern
12. Kaur R, Kaur P. Optimizing the genetic algorithm to Recognition Letters 2012; 33(12): 1514-9.
resynthesize iris patterns from iris Code Template. 19. Zuo J, Schmid N, Chen X. On generation and analysis
International Journal of Current Engineering and of synthetic iris images. Transactions on Information
Technology 2016; 6. Forensics and Security 2007; 2(1): 77-90.
13. Canny J. A computational approach to edge 20. Cui J, Wang Y, Huang J, et al. An iris image synthesis
detection. Transactions on Pattern Analysis and method based on PCA and super-resolution.
Machine Intelligence 1986; 8(6): 679-86. International Conference on Pattern Recognition,
14. Chen Y, Adjouadi M, Han C, et al. A highly accurate UK. 2004. DOI: 10.1109/ICPR.2004.1333804.
15