<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A comparison of iris image segmentation techniques</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>M S Semyonov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>E V Myasnikov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Samara National Research University</institution>
          ,
          <addr-line>Moskovskoe Shosse 34, Samara, Russia, 443086</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>163</fpage>
      <lpage>169</lpage>
      <abstract>
        <p>The paper compares three different methods of iris image segmentation, namely the method using the Daugman`s integro-differential operator, the method using the Hough transform for the detection of circles, and the method based on the analysis of the distribution of edge points. The accuracy and run time of the implemented methods were estimated in the experimental study conducted using the MMU Iris Image Database. The carried out research has shown that the method using the Daugman`s integro-differential operator has the greatest accuracy, and the method based on the analysis of the distribution of boundary points has the shortest operating time.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, identifying a person by his/her biometric parameters becomes a more and more
popular field of research. The reason for this is both the increased interest in the biometric
identification by public and commercial bodies and the intensive development of technical tools of
recording, storage and processing of such information. Today, a broad range of features of human
body is used for the identification, including face images [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], fingerprints, iris patterns, voice,
manner of walking etc. The identification of a person by an iris pattern is of particular interest in this
list, because this method ensures the most accurate identification [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        In fact, the iris is a circular movable diaphragm with a diameter of about 12 mm, at the core of
which there is a round hole, a pupil [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. An example iris image is presented in figure 1.
      </p>
      <p>
        The iris color (eye color) depends on the coloration (pigmentation) of iris anterior surface visible
through the transparent cornea [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. However, if the iris color changes during the first 10-12 years of a
human life and may change in old age, the iris pattern with clear individual characteristics, which is
formed during the intrauterine growth, remains almost the same throughout the human life [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ].
These iris characteristics cause significant interest to this identification method.
      </p>
      <p>Generally, the identification systems using an iris image are built according to the classical scheme:
- selection of an informative region (iris) on the image,
- feature description of the selected region,
- comparison of the feature descriptions.</p>
      <p>
        In this case, the quality assessment of both obtained images and effectiveness of individual method
stages may be included into the above scheme [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>It should be noted that the accuracy of the first of the above-mentioned stages (selection of the iris
on the image) plays an important role in the achievement of high quality.</p>
      <p>
        The selection of the region corresponding to the iris on the image is the segmentation-related task
that can be completed using a variety of methods. Specifically, the approaches based on the edge
detection [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], thresholding [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], Daugman's integro-differential operator [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], circular Hough
Transform [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] etc. are popular.
      </p>
      <p>When using these approaches, the internal and external iris boundaries (boundaries “iris-sclera”
and “pupil-iris”) are sought, and the further approximation of detected boundaries with circles is
performed. It should be noted that such approximation is only the first stage of a segmentation,
because after selecting the ring (which may be non-concentric) formed by these circles, the part of the
iris may remain closed and shaded by eyelids and eyelashes.</p>
      <p>This paper describes the experimental comparison of three approaches to the selection of the iris on
the image.</p>
      <p>This paper has the following structure. Sections 2-4 briefly describe the methods considered in this
report. Specifically, Section 2 describes the method based on the Daugman's integro-differential
operator, Section 3 describes the method based on the circular Hough transform, and Section 4
describes the method based on the edge detection and edge points distribution analysis. The results of
experimental studies carried out with MMU Iris Image Database are presented in Section 5. In the end
of this paper, there are Section 6 containing the conclusion and Section 7 containing the reference list.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The method based on the Daugman's integro-differential operator</title>
      <p>According to the method based on the Daugman's integro-differential operator, the possible centers of
the iris should be calculated first on an input image Iin. To do this, the points on Iin with the brightness
level below the predefined threshold are selected. Then, the points, which correspond to the local
minima of the brightness, are selected from the above-mentioned points.</p>
      <p>Local minimum is the minimum of the circular neighborhood with a radius equal to the minimum iris
radius. In this method, the minimum and maximum radii of the iris should be set to overlap a little bit
the iris radius values from the image database.</p>
      <p>
        Then, the parameters of circle approximating boundary “iris-sclera” should be calculated. This is
done by using the Daugman's integro-differential operator [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] defined as the maximum of the
smoothed derivative of the average image intensity along the round contour with coordinates (x0, y0)
and radius r:
Here I(x, y) is the image intensity function, Gσ(r) is the Gaussian smoothing function, s is the circle
contour with the coordinates (x0, y0) and radius r. This operator is applied for the points of Iin selected
as possible iris centres and having r values changing from minimum to maximum iris radius.
      </p>
      <p>Example of how the method described in this section works for figure 1 is presented in figure 2.</p>
    </sec>
    <sec id="sec-3">
      <title>3. The method based on the circular Hough transform</title>
      <p>
        According to the method based on the circular Hough Transform, the Canny edge detector [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] is
applied first to the input image Iin to generate the image of edge points Ied1. The intervals of the pupil
and iris radius values used for searching should be established beforehand, depending on an existing
image database, so as to overlap a little bit these values.
      </p>
      <p>
        Then, the parameters of the circle, which approximates the “iris-sclera” boundary, should be
determined on the image Ied1 of edge points using the circular Hough transform [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Maximum and
minimum radii used for searching are taken from the pre-determined interval of iris radius values.
      </p>
      <p>
        Thereafter, image Ied2 is made up of the points of the image Ied1 that are within the circle determined
at the first stage. The parameters of the circle, which approximates the “pupil-iris” boundary, should
be determined on the image Ied2 using the circular Hough transform [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Maximum and minimum radii
used for searching are taken from the pre-determined interval of pupil radius values.
      </p>
      <p>An example obtained using this method is shown in figure 3.</p>
    </sec>
    <sec id="sec-4">
      <title>4. The method based on the analysis of the edge points distribution</title>
      <p>As a part of this work, the method based on the circular Hough transform and the analysis of the edge
point distribution was proposed. This method includes the following stages. At the first stage, the iris
internal boundary (boundary “pupil-iris”) should be selected on the input image, and the parameters of
the circle approximating the pupil should be determined. At the second stage, the iris external
boundary (boundary “iris-sclera”) is selected, and the parameters of the circle approximating the iris
external boundary are determined using the least squares method. These stages are described below in
more detail.</p>
      <sec id="sec-4-1">
        <title>4.1. Pupil boundary determination</title>
        <p>
          To determine the internal boundary of the iris, the Canny edge detector [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] is applied to the input
image Iin to generate the image Ied1 of edge points. Then, using the circular Hough transform [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], the
centre and the radius Rpupil of a pupil are determined on Ied1. The minimum and maximum circle radii
used for searching with Hough transform should be taken so as to overlap a little bit the pupil radius
values from the image database.
        </p>
        <p>Figure 4 below provides the example of pupil boundary determination for the image depicted in
figure 1.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Determination of iris external boundary</title>
        <p>
          To determine the iris external boundary, the function of the edge point distribution from the pupil
centre, which is described in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], is analyzed. The Canny edge detector [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] is applied to the input
image Iin to generate the image Ied2 of edge points. The parameters of the Canny edge detector, which
used to search for the pupil and iris boundaries, are different and should be selected in an experimental
fashion based on the existing image set. It is known [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] that the value of the iris external radius Riris is
within the range (5/4Rpupil, 5Rpupil), so the points, the distance from which to the pupil centre is not
within the specified range, shall be removed from Ied2. The function f(R) of the edge point distribution
on the distance R to the centre of the pupil shall be calculated for the obtained image. It is expected
that this function has a local maximum around the target iris radius value, because the pupil and the
iris are approximately concentric. However, this maximum may hide among other maxima caused by
the noise contamination of the image Ied2.
        </p>
        <p>An example of the graph of the function f(r) of the edge point distribution on the distance R to the
centre of the pupil is shown in figure 5. The argument r of the function f(r) equals to the difference
between R and Rpupil.</p>
        <p>Thereafter, the direct search for the local maxima of the f(R) function is performed starting with the
highest maximum. For the selected local maximum RM, the edge points, which fall into the ring
defined by the radii RM – s and RM + s, are approximated by the circle using the least squares method.
The circle, for which the approximation error is lower than the predefined value, is selected. It is
considered that this circle approximates the iris external boundary.</p>
        <p>An example obtained using this method is shown in figure 6.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiment</title>
      <p>To compare the accuracy of segmentation and operation time of the above methods, the simulation
experiment was carried out. All methods were implemented in MATLAB. The experiment is carried
out on a personal computer powered by Intel Core i5-4210M with a frequency 2.6 GHz and
randomaccess memory of 6 GB.</p>
      <p>
        When conducting this experiment, 30 iris images taken from MMU Iris Image Database [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] were
used. For each image, the expert performed the reference (true) segmentation and defined the true
values of pupil and iris boundary parameters (centre coordinates and radii). Thereafter, the similar
values of parameters were assessed using each of the methods considered in this paper.
      </p>
      <p>
        To assess the precision of each method, the Jaccard index [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] averaged over all test images was
used. The Jaccard index is defined in this paper as the ratio between the intersection of rings (non
necessarily concentric) with reference and evaluated parameters, and the area of interconnection of
these rings. Besides, the image-averaged operation time of the assessed methods was evaluated.
      </p>
      <p>The results of the experiments are presented in Table 1 and figures 7, 8. Specifically, “A” section
describes the method based on the Daugman's integro-differential operator, “B” section describes the
method based on the circular Hough transform, and “C” section describes the method based on the
analysis of the edge point distribution.</p>
      <p>Method</p>
      <p>A
B
C</p>
      <p>These results demonstrate that the Daugman's integro-differential operator is the most precise, but
requires the longest operation time. The method based on the circular Hough transform is a little bit
less precise, but has a significantly lower operation time (in 2.5 times).</p>
      <p>The method based on the analysis of the edge point distribution was the fastest one (almost 6 times
faster than the method of Daugman's integro-differential operator). In this case, it showed the same
precision with the used data set as the method based on the Hough transform.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>Three methods of assessment of iris boundary parameters were evaluated in this study, namely: the
method based on the Daugman's integro-differential operator, the method based on the circular Hough
transform, and the method based on the analysis of the edge point distribution.</p>
      <p>For images from MMU Iris Image Database, the reference segmentation of iris images was
performed, and numerical experiments to assess the precision and operating time of implemented
methods were carried out. The experiments show that the method of the Daugman's
integrodifferential operator is the most precise with regard to the applied data set, and the method based on
the analysis of the edge point distribution proposed in this paper is marked by the lowest operation
time and has the same level of precision as the Hough transformation.</p>
      <p>In future, it is planned to use study results to develop the method of person identification by the
picture of iris.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>The reported study was funded by RFBR according to the research project no. 18-01-00748 a.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Nemirovskiy</surname>
            <given-names>V B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoyanov A K and Goremykina D S 2016</surname>
          </string-name>
          <article-title>Face recognition based on the proximity measure clustering</article-title>
          <source>Computer Optics</source>
          <volume>40</volume>
          (
          <issue>5</issue>
          )
          <fpage>740</fpage>
          -
          <lpage>745</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2016- 40-5-
          <fpage>740</fpage>
          -745
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Savchenko</surname>
            <given-names>A V</given-names>
          </string-name>
          <year>2017</year>
          <article-title>Maximum-likelihood dissimilarities in image recognition with deep neural networks</article-title>
          <source>Computer Optics</source>
          <volume>41</volume>
          (
          <issue>3</issue>
          )
          <fpage>422</fpage>
          -
          <lpage>430</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2017-41-3-
          <fpage>422</fpage>
          -430
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Multiple</given-names>
            <surname>Biometric Grand Challenge (MBGC - 2007) (</surname>
          </string-name>
          <article-title>Access mode</article-title>
          : http://www.nist.gov /itl/iad/ig/mbgc.cfm)
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Petrovsky B V 1988 Large Medical Encyclopedia</surname>
          </string-name>
          (Moscow: Soviet Encyclopedia)
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Pryves</surname>
            <given-names>M G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lysenkov N K and Bushkovich V I 1974 Human Anatomy</surname>
          </string-name>
          (Moscow: Medicine) p
          <fpage>670</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Velkhover</surname>
            <given-names>E S</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ananin</surname>
            <given-names>V F</given-names>
          </string-name>
          <year>1991</year>
          <article-title>Introduction to iridology</article-title>
          .
          <source>Pupillodiagnosis</source>
          (Moscow: UDN) p
          <fpage>212</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Konovalov</surname>
            <given-names>V V</given-names>
          </string-name>
          and
          <string-name>
            <surname>Antonov A A 1990 Practical Iridology</surname>
          </string-name>
          (Moscow: Okulius) p
          <fpage>88</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Matveyev</surname>
            <given-names>I A</given-names>
          </string-name>
          <year>2014</year>
          <article-title>Methods and Algorithms for Automatic Processing of Images of the Iris (Moscow)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Gonzalez</surname>
            <given-names>R</given-names>
          </string-name>
          and
          <string-name>
            <surname>Woods R 2005 Digital Image Processing</surname>
          </string-name>
          (Moscow: Technosphere)
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Ling L L and Brito D F 2010 Fast and Efficient Iris Image Segmentation J. Medical</surname>
          </string-name>
          and
          <source>Biological Engineering</source>
          <volume>30</volume>
          (
          <issue>6</issue>
          )
          <fpage>381</fpage>
          -
          <lpage>392</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Daugman</surname>
            <given-names>J G</given-names>
          </string-name>
          <year>2004</year>
          <article-title>How iris recognition works Proc</article-title>
          .
          <source>IEEE Trans. Circ. Syst. Video Technol</source>
          .
          <volume>14</volume>
          (
          <issue>1</issue>
          )
          <fpage>21</fpage>
          -
          <lpage>30</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Basit</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Javed</surname>
            <given-names>M 2007</given-names>
          </string-name>
          <article-title>Localization of iris in gray scale image using intensity gradient J</article-title>
          .
          <source>Optics and Lasers in Engineering</source>
          <volume>45</volume>
          <fpage>1107</fpage>
          -
          <lpage>1114</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Canny J F 1986</surname>
          </string-name>
          <article-title>A computational approach to edge detection J</article-title>
          .
          <source>IEEE Trans. Pattern Anal. Machine Intelligence</source>
          <volume>8</volume>
          (
          <issue>6</issue>
          )
          <fpage>679</fpage>
          -
          <lpage>698</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Chygrynsky</surname>
            <given-names>V V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Efimov Y S and Matveyev</surname>
            <given-names>I A</given-names>
          </string-name>
          <year>2016</year>
          <article-title>Fast algorithm for determining pupil and iris boundaries J</article-title>
          .
          <source>Machine Learning and Data Analysis</source>
          <volume>2</volume>
          (
          <issue>2</issue>
          )
          <fpage>159</fpage>
          -
          <lpage>172</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>MMU</given-names>
            <surname>Iris Image</surname>
          </string-name>
          <article-title>Database (Access mode: http://pesonna</article-title>
          .mmu.edu.my/ccteo/)
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Jaccard P 1901 Distribution de</surname>
          </string-name>
          <article-title>la flore alpine dans le Bassin des Dranses et dans quelques regions voisines J</article-title>
          .
          <source>Bull. Soc. Vaudoise sci. Natur</source>
          .
          <volume>37</volume>
          <fpage>241</fpage>
          -
          <lpage>272</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>