1,657 research outputs found
Maximized Posteriori Attributes Selection from Facial Salient Landmarks for Face Recognition
This paper presents a robust and dynamic face recognition technique based on
the extraction and matching of devised probabilistic graphs drawn on SIFT
features related to independent face areas. The face matching strategy is based
on matching individual salient facial graph characterized by SIFT features as
connected to facial landmarks such as the eyes and the mouth. In order to
reduce the face matching errors, the Dempster-Shafer decision theory is applied
to fuse the individual matching scores obtained from each pair of salient
facial features. The proposed algorithm is evaluated with the ORL and the IITK
face databases. The experimental results demonstrate the effectiveness and
potential of the proposed face recognition technique also in case of partially
occluded faces.Comment: 8 pages, 2 figure
A Novel Approach to Face Recognition using Image Segmentation based on SPCA-KNN Method
In this paper we propose a novel method for face recognition using hybrid SPCA-KNN (SIFT-PCA-KNN) approach. The proposed method consists of three parts. The first part is based on preprocessing face images using Graph Based algorithm and SIFT (Scale Invariant Feature Transform) descriptor. Graph Based topology is used for matching two face images. In the second part eigen values and eigen vectors are extracted from each input face images. The goal is to extract the important information from the face data, to represent it as a set of new orthogonal variables called principal components. In the final part a nearest neighbor classifier is designed for classifying the face images based on the SPCA-KNN algorithm. The algorithm has been tested on 100 different subjects (15 images for each class). The experimental result shows that the proposed method has a positive effect on overall face recognition performance and outperforms other examined methods
Face Recognition by Fusion of Local and Global Matching Scores using DS Theory: An Evaluation with Uni-classifier and Multi-classifier Paradigm
Faces are highly deformable objects which may easily change their appearance
over time. Not all face areas are subject to the same variability. Therefore
decoupling the information from independent areas of the face is of paramount
importance to improve the robustness of any face recognition technique. This
paper presents a robust face recognition technique based on the extraction and
matching of SIFT features related to independent face areas. Both a global and
local (as recognition from parts) matching strategy is proposed. The local
strategy is based on matching individual salient facial SIFT features as
connected to facial landmarks such as the eyes and the mouth. As for the global
matching strategy, all SIFT features are combined together to form a single
feature. In order to reduce the identification errors, the Dempster-Shafer
decision theory is applied to fuse the two matching techniques. The proposed
algorithms are evaluated with the ORL and the IITK face databases. The
experimental results demonstrate the effectiveness and potential of the
proposed face recognition techniques also in the case of partially occluded
faces or with missing information.Comment: 7 pages, 6 figures, IEEE Computer Vision and Pattern Recognition
Workshop on Biometric
Shape Representations Using Nested Descriptors
The problem of shape representation is a core problem in computer vision. It can be argued that shape representation is the most central representational problem for computer vision, since unlike texture or color, shape alone can be used for perceptual tasks such as image matching, object detection and object categorization.
This dissertation introduces a new shape representation called the nested descriptor. A nested descriptor represents shape both globally and locally by pooling salient scaled and oriented complex gradients in a large nested support set. We show that this nesting property introduces a nested correlation structure that enables a new local distance function called the nesting distance, which provides a provably robust similarity function for image matching. Furthermore, the nesting property suggests an elegant flower like normalization strategy called a log-spiral difference. We show that this normalization enables a compact binary representation and is equivalent to a form a bottom up saliency. This suggests that the nested descriptor representational power is due to representing salient edges, which makes a fundamental connection between the saliency and local feature descriptor literature. In this dissertation, we introduce three examples of shape representation using nested descriptors: nested shape descriptors for imagery, nested motion descriptors for video and nested pooling for activities. We show evaluation results for these representations that demonstrate state-of-the-art performance for image matching, wide baseline stereo and activity recognition tasks
Correlation Method Based PCA Subspace using Accelerated Binary Particle Swarm Optimization for Enhanced Face Recognition
The capacity to perceive human countenances is an exhibit of unfathomable human insight. Clinicians inferred that comprehensive and highlight based methodologies are double courses to the face acknowledgment [1]. Most early methodologies in face acknowledgment extricate nearby highlights from face pictures. Be that as it may, the kind of nearby highlights which are most steady and discriminative for face acknowledgment is obscure. Because of challenges in heartily separating nearby highlights from face pictures, analysts started to utilize the entire face area as the crude info to an acknowledgment framework, and created all-encompassing coordinating strategies. There are a large number of productions in face acknowledgment utilizing all-encompassing methodologies. Furthermore, for the most part this kind of methodologies can attain to preferred execution over highlight based methodologies [2], [3]. Notwithstanding, the execution of comprehensive coordinating techniques will drop when there are varieties because of outflows or postures. Also, neighbourhood highlights extricated from nearby districts of a face picture are stronger to these varieties than the worldwide highlights. This inspires us to re-ponder the highlight based methodologies
- …