Open AccessDevelopment of Artificial Bee Colony Algorithm for Iris Segmentation
Author(s) -
Zaheera Zainal Abidin,
Nor Aini Zakaria,
Zuraida Abal Abas,
S. N. A. Azizan
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/864/1/012080
Subject(s) - iris (biosensor) , segmentation , computer science , convergence (economics) , algorithm , artificial intelligence , artificial bee colony algorithm , image segmentation , image (mathematics) , swarm intelligence , population , pattern recognition (psychology) , particle swarm optimization , biometrics , demography , sociology , economics , economic growth
Iris segmentation is a crucial process in the iris recognition that it locates and captures the unique features inside the human iris image. However, iris image contains high noise rate and sometimes a genuine user is recognized as non-genuine by computer system. An algorithm from swarm-based intelligence is demanded for natural search images. Therefore, an experimental investigation was conducted to explore artificial bee colony (ABC) algorithm for iris segmentation. The ABC algorithm measures the performance of convergence in learning the authentic iris features. Based on the findings, the average fitness is always less than or equal to the best fitness, and the differences between the two goes on decreasing over time, which is until the algorithm completely converges. The parameters of ABC Algorithm are programmed with at best 100 times of calculation to collect the best iteration and best fitness. In fact, results showed that ABC uses the population for every iteration instead of a single iteration. Number of iterations directly affect the time of optimal search for ideal convergence, which meets the aim of this study. As a conclusion, if the mean and standard deviation is low in values, it is proven that the speed of searching the iris features is faster and more robust.