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 条
  • [1] An efficient parallel clustering algorithm for large scale database
    School of Electronic Information, Wuhan University, Wuhan, Hubei, China
    不详
    不详
    J. Softw., 2009, 10 (1119-1126): : 1119 - 1126
  • [2] An efficient clustering algorithm based on the k-nearest neighbors with an indexing ratio
    Qaddoura, Raneem
    Faris, Hossam
    Aljarah, Ibrahim
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2020, 11 (03) : 675 - 714
  • [3] An efficient clustering algorithm based on the k-nearest neighbors with an indexing ratio
    Raneem Qaddoura
    Hossam Faris
    Ibrahim Aljarah
    International Journal of Machine Learning and Cybernetics, 2020, 11 : 675 - 714
  • [4] An Efficient Document Indexing-Based Similarity Search in Large Datasets
    Trong Nhan Phan
    Jaeger, Markus
    Nadschlaeger, Stefan
    Kueng, Josef
    Tran Khanh Dang
    FUTURE DATA AND SECURITY ENGINEERING, FDSE 2015, 2015, 9446 : 16 - 31
  • [5] Efficient Large Scale Clustering based on Data Partitioning
    Bendechache, Malika
    Le-Khac, Nhien-An
    Kechadi, M-Tahar
    PROCEEDINGS OF 3RD IEEE/ACM INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS, (DSAA 2016), 2016, : 612 - 621
  • [6] An experimental comparison of clustering methods for content-based indexing of large image databases
    Hien Phuong Lai
    Muriel Visani
    Alain Boucher
    Jean-Marc Ogier
    Pattern Analysis and Applications, 2012, 15 : 345 - 366
  • [7] An efficient density-based clustering for multi-dimensional database
    Zhang, Lieliang
    Li, Zhiyang
    Liu, Weijiang
    Qu, Wenyu
    Wu, Yinan
    2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION, CYBERNETICS AND COMPUTATIONAL SOCIAL SYSTEMS (ICCSS), 2017, : 361 - 366
  • [8] An experimental comparison of clustering methods for content-based indexing of large image databases
    Hien Phuong Lai
    Visani, Muriel
    Boucher, Alain
    Ogier, Jean-Marc
    PATTERN ANALYSIS AND APPLICATIONS, 2012, 15 (04) : 345 - 366
  • [9] An Efficient Influence based Label Propagation Algorithm for Clustering Large Graphs
    Bhatia, Vandana
    Rani, Rinkle
    2017 INTERNATIONAL CONFERENCE ON INFOCOM TECHNOLOGIES AND UNMANNED SYSTEMS (TRENDS AND FUTURE DIRECTIONS) (ICTUS), 2017, : 420 - 426
  • [10] Efficient Clustering Method Based on Rough Set and Genetic Algorithm
    Chen, Jianyong
    Zhang, Changsheng
    CEIS 2011, 2011, 15