Loading…
Development of Artificial Bee Colony Algorithm for Iris Segmentation
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 intell...
Saved in:
Published in: | IOP conference series. Materials Science and Engineering 2020-05, Vol.864 (1), p.12080 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 1757-8981 1757-899X |
DOI: | 10.1088/1757-899X/864/1/012080 |