Lef3a: Pupil segmentation using Viterbi search algorithm - IEEE Xplore
ieeexplore.ieee.org › document
A Viterbi algorithm is applied to find the contour that maximizes the gradient value along a connex contour. Our method which we called Lef3a (a snake that ...
A Viterbi algorithm is applied to find the contour that maximizes the gradient value along a connex contour. Our method which we called Lef3a (a snake that ...
A non-circular pupil segmentation approach using Viterbi path research is presented and the performance of all segmentation methods coupled with a standard ...
A Viterbi algorithm is applied to find the contour that maximizes the gradient value along a connex contour. Our method which we called Lef3a (a snake that ...
An enhancement step is used in order to remove outliers from the gradient image. A Viterbi algorithm is applied to find the contour that maximizes the gradient ...
A Viterbi algorithm is applied to find the contour that maximizes the gradient value along a connex contour. Our method which we called Lef3a (a snake that ...
We propose a unified approach for the automatic and accurate segmentation of the pupil and iris from on-axis grayscale eye images.
Emine Krichen: Lef3a: Pupil segmentation using Viterbi search algorithm. 323-329.
Jan 2, 2019 · In this paper, we present a combination method of learning-based and edge-based algorithms for iris segmentation.
The Viterbi Algorithm at Different Resolutions for Enhanced Iris Segmentation ... Lef3a: Pupil Segmentation Using Viterbi Search Algorithm ...