Abstract: Face recognition is one of the most talked and important research areas. A lot of work has been done on facial recognition. But most of the works suffered from the common problem. It is the execution time and matching delay .Features which has been extracted for matching need to be matched with faster algorithm to diminish the problem of execution time. In our proposed method, we have implemented principal component Analysis (PCA) for feature extraction and Hausdroff distance algorithm for matching rather than Euclidian distance algorithm
Keywords: Principal Component Analysis, Hausdroff distance algorithm, the eigen vectors and eigen values etc.
Title: Face Recognition Using Hausdroff Distance as a Matching Algorithm
Author: Rahul Singh Negi, Rekha Garg
International Journal of Engineering Research and Reviews
ISSN 2348-697X (Online)
Research Publish Journals
