000 04404ntm a2200373 i 4500
999 _c91142
_d91148
003 MY-KuUP
005 20251125105425.0
006 t||||fr|||| 000 0
007 ta
008 191112t20192019my a|||fram|| 000 0 eng d
020 _aTHE0008431(Local)
_qhardback
040 _aUMP
_beng
_cUMP
_erda
090 _aFSKKP .K43 2019 r Thesis
100 1 _aKhalaf, Emad Taha,
_eauthor.
245 1 3 _aAn efficient indexing and retrieval of iris biometrics data using hybrid transform and firefly based K-means algorithm title /
_cEmad Taha Khalaf
264 1 _aKuantan, Pahang :
_bUMP,
_c2019
264 4 _c© 2019
300 _axv, 172 pages :
_billustrations ;
_c30 cm. +
_e1 CD-ROM
336 _atext
_2rdacontent
336 _atext
_2rdacontent
337 _aunmediated
_2rdamedia
337 _acomputer
_2rdamedia
338 _avolume
_2rdacarrier
338 _acomputer disc
_2rdacarrier
347 _atext file
_bPDF
_2rda
500 _aFaculty of Computer Systems and Software Engineering
502 _aThesis (Doctor of Philosophy (Computer Science)) -- Universiti Malaysia Pahang – 2019
504 _aIncludes bibliographical references
520 3 _aThe explosive increase in the number of biometric images saved in most databases has made image indexing mandatory. These processes could influence the speed of data access as well as support their retrieval. Hence, researchers are focusing on how to determine suitable image features to be used for clustering and index, with an efficient searching process. The existing methods are unable to extract sufficient number of the most important features of iris image for clustering and indexing processes. However, one of the weaknesses of clustering is the process of extracting the most important features. A combination of three transformation methods, namely, Discrete Cosine Transformation (DCT), Discrete Wavelet Transform (DWT), and Singular Value Decomposition (SVD) for analyzing the iris image and for extracting its local features have yet to be utilized for image clustering and indexing. Another problem related to clustering is when choosing the initial centroids for each cluster randomly. To overcome this disadvantage, the Fireflies Algorithm (FA) was used because it has the ability to perform global searches and has quick convergence rate to optimize the initial clustering centers of the K-means algorithm, using a kind of weighted Euclidean distance to reduce the defects made by noise data and other uncertainties. This thesis presents a new method to extract the most relevant features of iris biometric images for indexing the database within minimum time and search area. The enhanced method combines three transformation methods for analyzing the iris image and extracting its local features. It uses a weighted K-means clustering algorithm based on the improved FA to optimize the initial clustering centers of K-means algorithm, known as Weighted K-means clustering-Improved Firefly Algorithm (WKIFA). For searches and retrieval, an efficient parallel technique has been presented by dividing the group of features into two b-trees based on index keys. Searches within a group can be done using a half-searching algorithm to improve the response time for data retrieval. The system has been tested on publicly available databases. The experimental results showed that the indexing system has a considerably low penetration rate of 0.98%, 0.13%, and 0.12%, and lower bin miss rate of 0.3037%, 0.4226%, and 0.2019% compared to the existing iris databases of the Chinese Academy of Science - Institute of Automation (CASIA), University of Bath (BATH), and Database of Indian Institute of Technology Kanpur (IITK), respectively. Results of the improved WKIFA showed that it was more effective for the clustering stage of the system. It even outperformed the traditional K-mean, by reducing the penetration rates to 0.131%, 0.088%, and 0.108%, and improving the accuracy by reducing the bin miss rate to 0.2604%, 0.309%, and 0.1548% of the aforementioned databases, respectively. Analysis of time complexity of retrieval showed that the computational complexity was reduced to O (log n), which was better than the existing methods.
610 2 0 _aFaculty of Computer Systems and Software Engineering
_xDissertations
650 0 _aUniversities and colleges
_xDisertations
650 0 _aTheses
942 _2lcc
_cTHESIS