Article Fingerprint
ReserarchID
CSTGVE2585
This paper is about the different algorithms which are used for face recognition. There are so many algorithms which are available for face recognition .There are two approaches by which the face can be recognize i.e. face Geometry based and face appearance based. The appearance based technique is also sub divided into two technique i.e. local feature and global feature based. The technique of local feature based are Discrete Cosine Transform (DCT).In this paper we study the two global features (holistic) appearance based algorithm i.e. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) in which every face image is converted into 1D, we are using 1D for all the calculation and then compare these two algorithm with the help of FAR (False Acceptance Rate),FRR (False Rejection Rate),Time, Memory and checks which algorithm gives the better result.
Hemant Makwana. 2014. \u201cComparison of Different Algorithm for Face Recognition\u201d. Global Journal of Computer Science and Technology - F: Graphics & Vision GJCST-F Volume 13 (GJCST Volume 13 Issue F9).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 102
Country: India
Subject: Global Journal of Computer Science and Technology - F: Graphics & Vision
Authors: Hemant Makwana, Taranpreet Singh (PhD/Dr. count: 0)
View Count (all-time): 303
Total Views (Real + Logic): 9070
Total Downloads (simulated): 2469
Publish Date: 2014 02, Mon
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.