z-logo
open-access-imgOpen Access
Swarm based Intelligent Feature Optimization Technique for ECG based Biometric Human Recognition
Author(s) -
Kiran Kumar Patro,
Mengbin Rao,
Preetam Kumar
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.e1041.0785s319
Subject(s) - particle swarm optimization , computer science , artificial intelligence , pattern recognition (psychology) , biometrics , feature extraction , feature (linguistics) , normalization (sociology) , data mining , machine learning , philosophy , linguistics , sociology , anthropology
Recently, rapid growth in network technology and communication leads to widening human activities, so that a strong identification system is necessary. This work aims to build an accurate identification technology based on unique physiological characteristics of ECG. The Biometric recognition of ECG primarily depends on the quality of its features. Feature extraction is performed on parameters of a cardiac cycle based on the fiducial approach and large data sets of features have been extracted. The extracted dataset contains irrelevant, correlated and over-fitted features, which misleads the biometric system performance so that an effective feature optimization is needed to sort out those features to avoid redundancy in the data. In this paper, a novel swarm based intelligent feature optimization method; Particle Swarm Optimization (PSO) is used to generate feature subset based on a fitness function with joint entropy. The dataset from optimization phase are fed to classifiers such as ANN, K-NN and SVM for recognition. The proposed approach is tested with available open source MIT-BIH ECG ID database. Finally, a comparison is made with and without feature optimization in which PSO with KNN shows recognition accuracy of 97.8931%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here