Different distance based PCA+LDA fusion Technique for Face recognition
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 9, Issue 1
Abstract
Since last few years, face Recognition has become one of the most challenging task in the pattern recognition field. The Face recognition plays very important role in many applications like video surveillance, retrieval of an identity from a database for criminal investigations and forensic applications. The face is considered as good biometric for many reasons: the acquisition process is nonintrusive and does not require collaboration of the subject to be recognized. The acquisition process of a face from a scene is simpler and cheaper than the acquisition of other biometrics as the iris and the fingerprint. On the other hand, many problems arise, because of the variability of many parameters like face expression, pose, scale, lighting, and other environmental parameters.Face recognition involved in application like problem of recognition of an identity in a scene. A system that automatically recognizes a face in a scene, first detects it and normalize it with respect to the pose, lighting and scale. Then, the system tries to associate the face to one or more faces stored in its database, and gives the set of faces that are considered as nearest to the detected face. This requires more computational resources and very robust algorithms for detection, normalization and recognition. In this paper we have implement different face recognition methods like Principle component analysis, Linear discriminant analysis and Fusion of PCA and LDA for face recognition. And better recognition rate is achieved by implementing different similarity measures between images
Authors and Affiliations
Dhiren Pandit , Dr. Jayesh Dhodiya
Keywords
Related Articles
- EP ID EP126522
- DOI -
- Views 99
- Downloads 0
On Most Generalized Topologies on a Non Empty Set
The purpose of this paper is to introduce a notion of continuity called (G ,D)- continuity between two non empty sets X and Y, and its relationships with other functions are studied.
Some Applications of the Resampling Methods in Computational Physics
The statistical methods are being very important for estimating the unknown parameters in computational physics. Between them we can mention the resampling methods: the jackknife and bootstrap estimate. In our work we ha...
Degree of Approximation of a Function Belongingto W (Lr, ξ (t)) (r > 1)-Class by (E, 1)(C, 2) Product Summabilty Transform
The field of approximation theory is so vast that it plays an increasingly important role in applications in pure and applied mathematics. The present study deals with a theorem concerning the degree of approximation of...
Detour Distant Divisor Graphs
Let G = (V,E) be a (p, q) - graph. The longest path P is called a detour distant divisor path if l(P) is a divisor of q . A detour distant divisor graph DD(G) of graph G = (V,E) has the vertex set V = V (G) and two verti...
Fact Type Results in Half Domination in Graphs
Let G = (V, E) be a finite graph with n vertices and m edges. A subset D⊆ V of vertices in a graph G is called half dominating set if at least half of the vertices of V(G) are either in D or adjacent to vertices of D. (i...