Optimization of K-nearest neighbor using particle swarm optimization for face recognition

Face biometric has received more attention to recognize a person in a right way. However, the face recognition is considered to be hard due to size, ethnicity, illumination, pose, various expression, and age. In this work, a novel approach is proposed to recognize the human face based on K-nearest n...

Full description

Saved in:
Bibliographic Details
Published inNeural computing & applications Vol. 31; no. 11; pp. 7935 - 7944
Main Authors Sasirekha, K., Thangavel, K.
Format Journal Article
LanguageEnglish
Published London Springer London 01.11.2019
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0941-0643
1433-3058
DOI10.1007/s00521-018-3624-9

Cover

More Information
Summary:Face biometric has received more attention to recognize a person in a right way. However, the face recognition is considered to be hard due to size, ethnicity, illumination, pose, various expression, and age. In this work, a novel approach is proposed to recognize the human face based on K-nearest neighbor (KNN) with particle swarm optimization (PSO). Initially, the features are extracted using local binary pattern. The metaheuristic optimization algorithms such as genetic algorithm, PSO, and ant colony optimization are investigated for feature selection. The KNN classifier is optimized using the population-based metaheuristic algorithm PSO. Finally, the face recognition is performed using the proposed PSO–KNN algorithm. In this research, experiments have been conducted on real-time face images collected from 155 subjects each with ten orientations using Logitech Webcam and also on ORL face dataset. The experimental result of the proposed PSO–KNN is compared with other benchmark recognition techniques such as decision table, support vector machine, multilayer perceptron and conventional KNN, to conclude the efficacy of the proposed approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-018-3624-9