Efficient Classifying and Indexing for Large Iris Database Based on Enhanced Clustering Method

被引:3
|
作者
Khalaf, Emad Taha [1 ]
Mohammad, Muamer N. [2 ]
Moorthy, Kohbalan [1 ]
Khalaf, Ahmad Taha [3 ]
机构
[1] Univ Malaysia Pahang, Soft Comp & Intelligent Syst Res Grp, Fac Comp Syst & Software Engn, Kuantan 26300, Pahang, Malaysia
[2] Minist Commun Iraq, State Co Internet Serv, Baghdad, Iraq
[3] SEGi Univ, Fac Med, 9 Jalan Teknol,PJU 5, Petaling Jaya 47810, Selangor, Malaysia
来源
STUDIES IN INFORMATICS AND CONTROL | 2018年 / 27卷 / 02期
关键词
Iris Biometric; Clustering; K-means Algorithm; Fireflies Algorithm; Computational Intelligence;
D O I
10.24846/v27i2y201807
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Explosive growth in the volume of stored biometric data has resulted in classification and indexing becoming important operations in image database systems. A new method is presented in this paper to extract the most relevant features of iris biometric images for indexing the iris database. Three transformation methods DCT, DWT and SVD were used to analyse the iris image and to extract its local features. The clustering method shouldering on the responsibility of determining the partitioning and classification efficiencies of the system has been improved. In the current work, the new Weighted K-means algorithm based on the Improved Firefly Algorithm (WKIFA) has been used to overcome the shortcomings in using the Fireflies Algorithm (FA). The proposed method can be used to perform global search and exhibits quick convergence rate while optimizing the initial clustering centers of the K-means algorithm. From the experimental results, the proposed method was indeed more effective for clustering and classification and outperformed the traditional k-mean algorithm. The Penetration Rates underwent reductions and reached the levels of 0.98, 0.13 and 0.12 for three different databases. Also, the Bin Miss Rates decreased to 0.3037, 0.4226 and 0.2019 for the investigated databases.
引用
收藏
页码:191 / 200
页数:10
相关论文
共 50 条
  • [21] Classifying method of iris image based on wavelet packet and neural network
    Lv Qianxing
    Zhou Zhiping
    Ji Zhicheng
    PROCEEDINGS OF THE 26TH CHINESE CONTROL CONFERENCE, VOL 4, 2007, : 580 - +
  • [22] Efficient binary code indexing with pivot based locality sensitive clustering
    Wei Zhang
    Ke Gao
    Yongdong Zhang
    Jintao Li
    Multimedia Tools and Applications, 2014, 69 : 491 - 512
  • [23] Efficient phrase-based document indexing for web document clustering
    Hammouda, KM
    Kamel, MS
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (10) : 1279 - 1296
  • [24] Efficient binary code indexing with pivot based locality sensitive clustering
    Zhang, Wei
    Gao, Ke
    Zhang, Yongdong
    Li, Jintao
    MULTIMEDIA TOOLS AND APPLICATIONS, 2014, 69 (02) : 491 - 512
  • [25] A kernelized spectral clustering method based on local affinity preserving indexing for document clustering
    1600, ICIC Express Letters Office, Tokai University, Kumamoto Campus, 9-1-1, Toroku, Kumamoto, 862-8652, Japan (07):
  • [26] An efficient similarity search based on indexing in large DNA databases
    Jeong, In-Seon
    Park, Kyoung-Wook
    Kang, Seung-Ho
    Lim, Hyeong-Seok
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2010, 34 (02) : 131 - 136
  • [27] Efficient content-based indexing of large image databases
    El-Kwae, EA
    Kabuka, MR
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2000, 18 (02) : 171 - 210
  • [28] An Efficient DBG Indexing Method for Large-Scale Read Mapping
    Yu C.-Y.
    Li J.-J.
    Ma H.-T.
    Zhao Y.-H.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2023, 44 (06): : 770 - 776
  • [29] An enhanced and efficient clustering algorithm for large data using MapReduce
    Li, Hongbiao
    Liu, Ruiying
    Wang, Jingdong
    Wu, Qilong
    IAENG International Journal of Computer Science, 2019, 46 (01)
  • [30] Enhanced iris recognition method based on multi-unit iris images
    Shin, Kwang Yong
    Kim, Yeong Gon
    Park, Kang Ryoung
    OPTICAL ENGINEERING, 2013, 52 (04)