Iris Recognition Using

Feature Extraction Of Box

Counting Fractal Dimension
 Proposed Experiment
Introduction Methodology Conclusion
Method Result

Introduction
 Proposed Experiment
Introduction Methodology Conclusion
Method Result

Psycological

B
I
O
M
BIOMETRIC E
T
R
I
C

Behavioral
 Proposed Experiment
Introduction Methodology Conclusion
Method Result

1 Reduce noise image using Gaussian filter with standard devices

Edge detection processes (𝜎). This process aim to make thin lines of image undetect as
find edge from the object edge
2
Calculate gradient intensity of image with determining gradient
direction to particular direction
3 Canny
Non maximum suppresion process to muffle undesired pixel Edge
into point edge Detection
4
Thresholding Hysteresis Process or process of minimizing the
emerging edge to produce accurate edge line. In other words,
this process converts the pixel value to zero if it is deemed unfit
to be an edge
 Proposed Experiment
Introduction Methodology Conclusion
Method Result
1
Edge detection using Canny edge detection
Hough transform is a
method for finding regular 2 Find parameters of the center coordinates
shape from the image as
𝑥𝑐 and 𝑦𝑐 , and the radius 𝑟 for outer iris
line, circle image, etc
3
Find parameters of the center coordinates
𝑥𝑐 and 𝑦𝑐 , and the radius 𝑟 for inner iris or Iris
circle of pupil Localication

which are able to define any circle according

to the equation

2
(𝑥𝑗 −𝑥𝑐 )2 + 𝑦𝑗 − 𝑦𝑐 = 𝑟2
 Proposed Experiment
Introduction Methodology Conclusion
Method Result

Normalization of the iris

dataset is the stage where
the annular iris obtained 𝑰 𝒙 𝒓, 𝜽 , 𝒚 𝒓, 𝜽 → 𝑰 𝒓, 𝜽 (2)
from the normalized
segmentation results into a with
two-dimensional 𝒙 𝒓, 𝜽 = 𝟏 − 𝒓 𝒙𝒑 𝜽 + 𝒓𝒙𝒍 𝜽 (3)
rectangular block And Iris
𝒚 𝒓, 𝜽 = 𝟏 − 𝒓 𝒚𝒑 𝜽 + 𝒓𝒚𝒍 𝜽 (4) Normalization
Where
𝒙𝒑 𝜽 = 𝒙𝒑𝟎 𝜽 + 𝒓𝒑 ∗ 𝒄𝒐𝒔 𝜽 (5)
𝒚𝒑 𝜽 = 𝒚𝒑𝟎 𝜽 + 𝒓𝒑 ∗ 𝒔𝒊𝒏 𝜽 (6)
𝒙𝒍 𝜽 = 𝒙𝒍𝟎 𝜽 + 𝒓𝒍 ∗ 𝒄𝒐𝒔 𝜽 (7)
𝒚𝒍 𝜽 = 𝒚𝒍𝟎 𝜽 + 𝒓𝒍 ∗ 𝒔𝒊𝒏 𝜽 (8)
 Proposed Experiment
Introduction Methodology Conclusion
Method Result
1
Covering the object area with square boxes with size 𝑟 ratio. 𝑟
Fractal dimension is not like value change from 1 to 2𝑛 , with 𝑛 = 0,1,2, …
Euclide dimension, the fractal
dimension has a non-integer 2
number of dimension. Calculate value of 𝑁(𝑟) , the number of boxes containing the
object
Calculating the dimensions 3
of an image using the box- Calculate value of log
1
and log 𝑁(𝑟) Box
𝑟
counting method is done by Counting
covering the object area with 4
1
a square box with varying Creating a straight line from value of log and log 𝑁(𝑟)
𝑟
sizes 5
Calculate the slope of a straight line with the following
σ𝑛 𝑛
𝑘=1 𝑥 σ𝑘=1 𝑦
σ𝑛
𝑘=1 𝑥𝑦 𝑛
equation: ∝= 2
σ𝑛
𝑘=1 𝑥
𝑛
σ𝑘=1 𝑥 2
𝑛
 Proposed Experiment
Introduction Methodology Conclusion
Method Result

Cross Validation k-fold cross-validation C

R
O
S
Testing Data Training Data
Cross-validation is a method to divide data S
into two parts, training data, and testing data
V
A
L
I
D
A
T
I
O
N
 Proposed Experiment
Introduction Methodology Conclusion
Method Result

K-Nearest Neighbor 𝑛
𝐷 𝑥, 𝑦 = ෍ 𝑥𝑖 − 𝑦𝑖 2
is a classified method
𝑖=1
based on learning data
K
that has a close distance N
to the object N
Where 𝐷 is distance
between a point on testing
data 𝑥 and training data 𝑦
that will be classifiying
Methodology
 Start

Data
Proposed Experiment
Introduction Methodology Conclusion
Method Result
Localization Iris

Normalization iris
Database
Box Counting

K-fold cross validation

In this study, the data of iris was K-nearest neighbor

chosen from CASIA database and

randomly selected. Accuracy

Finish
Eksperiment
Result
 Proposed Experimental
Introduction Methodology Conclusion
Method Result

Error per iteration

Average
K value First Second Third Fourth Fifth Accuracy %)
of error
Iteration Iteration Iteration Iteration Iteration

K=1 0,0833 0,125 0,1111 0,1277 0,1333 0,11608 88.39 ± 2

K=2 0,2 0,1429 0,1143 0,102 0,1167 0,13518 86.48 ± 3.9 R

K=3 0,0714 0,0714 0,0789 0,08 0,0667 0,07368 𝟗𝟐. 𝟔𝟑𝟐 ± 𝟎. 𝟓𝟔 E
K=4 0,1667 0,125 0,0882 0,1042 0,1333 0,12348 87.65 ± 2.99
S
U
K=5 0,0909 0,1304 0,1081 0,0833 0,0833 0,0992 90.08 ± 2.02
L
K=6 0,1538 0,0833 0,1111 0,1042 0,1 0,11048 88.952 ± 2.62 T
K=7 0,0909 0,1304 0,1538 0,1277 0,1167 0,1239 87.61 ± 2.28

K=8 0,0909 0,2174 0,1667 0,1429 0,1333 0,15024 84.976 ± 4.64

K=9 0,0909 0,1538 0,1351 0,125 0,1833 0,13762 86.23 ± 0.03

K=10 0,1818 0,3043 0,2895 0,3061 0,3 0,27634 72.366 ± 5.32

 Proposed Experiment
Introduction Methodology Conclusion
Method Result

1. Iris recognition in this research consist of 3 step, Segmentation using Hough

transform and Daugman’s rubber sheet model, feature extraction using box
counting fractal dimension, and feature matching using KNN (K-Nearest
Neighbor). Based on research, it is known that value of each person is
different.
2. Box counting is used feature extraction of iris recognition.
3. The best accuracy value is obtained with K=3 and the accuracy value is
92.632 ± 0.56
 Reference

[1] Backes A R and Bruno O M 2008 A new Approach to Estimate Fractal

Dimension of Texture Image (Heidelberg: Springer) chapter 2 pp
136-143
[2] Chen W K, Lee J N, Han W Y, Shih C K, and Chang K C 2013 Iris Recognition
based on bidimensional empirical mode decomposition and fractal
dimension Information Science. 221 (2013) 439-451
[3] Institute of Automation, Chinese Academy of Science. CASIA Iris Image
Database, http://biometrics.idealtest.org/, was accessed on January
12, 2017.
 Reference
[4] Jain Ramesh, Kasturi Rangachar, Schunck Brian G 1995 Machine Vision (New York:
McGraw-Hill, Inc)

[5] Juniati D and Budayasa I K 2016 Geometri Fractal & Aplikasinya (Surabaya: Unesa
University Press)

[6] Masek L 2003 Recognition for Human Iris Pattern for Biometrics Identification (Australia:
University of Western Australia)

[7] Ndaumanu R I, Kusrini, Arief M R 2014 Analisis Prediksi Tingkat Pengunduran Diri
Mahasiswa dengan Metode K-Nearest Neighbor Jatisi (Vol 1) pp1- 15.

[8] Patil P S 2015 IRIS Classification based on Fractal Dimension Box Counting Method
International Journal of Computer Applications Vol 112(11) pp 21-27
 Reference

[9] Prasetyo Eko 2011 Pengolahan Citra Digital dan Aplikasinya Menggunakan
Matlab (Yogyakarta: Andi Yogyakarta)
[10] Putra, Darma 2009 Sistem Biometrika. (Yogyakarta: Andi Yogyakarta)
[11] Refaeilzadeh P, Tang L, Liu H 2008 Cross-Validation (Arizona: Arizona State
University)
[12] Reitermanova Z 2010 Data Splitting WDS’ 10 Proceedings of Contributed
Papers (Prague: Matfyzpress) pp 31-36
[13] Safitri D W and Juniati D 2017 Classification of diabetic retinopathy using
fractal dimension analysis of eye fundus image AIP Conference
Proceedings. 020011(2017)