scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Face recognition for look-alikes: A preliminary study

TL;DR: The analysis shows that neither humans nor automatic face recognition algorithms are efficient in recognizing look-alikes, and an algorithm is proposed to improve the face verification accuracy.
Abstract: One of the major challenges of face recognition is to design a feature extractor and matcher that reduces the intraclass variations and increases the inter-class variations. The feature extraction algorithm has to be robust enough to extract similar features for a particular subject despite variations in quality, pose, illumination, expression, aging, and disguise. The problem is exacerbated when there are two individuals with lower inter-class variations, i.e., look-alikes. In such cases, the intra-class similarity is higher than the inter-class variation for these two individuals. This research explores the problem of look-alike faces and their effect on human performance and automatic face recognition algorithms. There is three fold contribution in this research: firstly, we analyze the human recognition capabilities for look-alike appearances. Secondly, we compare human recognition performance with ten existing face recognition algorithms, and finally, proposed an algorithm to improve the face verification accuracy. The analysis shows that neither humans nor automatic face recognition algorithms are efficient in recognizing look-alikes.
Citations
More filters
Journal ArticleDOI
TL;DR: It is found that Deep Learning (DL) has mostly outperformed numerous methods using manually designed features by automatically learning and extracting important information from facial features, and enable significant visual recognition functions by improving accuracy in most applications.
Abstract: Face is the most considerable constituent that people use to recognize one another. Humans can quickly and easily identify each other by their faces and since facial features are unobtrusive to lighting condition and pose, face remains as a dynamic recognition approach to human. Kinship recognition refers to the task of training a machine to recognize the blood relation between a pair of kin and non-kin faces (verification) based on features extracted from facial images, and to determine the exact type or degree of that relation (identification). Automatic kinship verification and identification is an interesting areas for investigation, and it has a significant impact in many real world applications, for instance, forensic, finding missing family members, and historical and genealogical research. However, kinship recognition is still not largely explored due to insufficient database availability. In this paper we present a survey on issues and challenges in kinship verification and identification, related previous works, current trends and advancements in kinship recognition, and potential applications and research direction for the future. We also found that Deep Learning (DL) has mostly outperformed numerous methods using manually designed features by automatically learning and extracting important information from facial features, and enable significant visual recognition functions by improving accuracy in most applications.

28 citations


Cites background from "Face recognition for look-alikes: A..."

  • ...and presence of structural components, occlusions, emotions, facial expression, makeup, cosmetic surgery, aging, rotations, pose variations, noise, scale, cluttering, and resolution, twins, and so forth [2, 36, 40, 48, 65]....

    [...]

Journal ArticleDOI
TL;DR: This work introduces three real-world open-set face recognition methods across facial plastic surgery changes and a look-alike face by 3D face reconstruction and sparse representation, and proposes likeness dictionary learning.
Abstract: The open-set problem is among the problems that have significantly changed the performance of face recognition algorithms in real-world scenarios. Open-set operates under the supposition that not all the probes have a pair in the gallery. Most face recognition systems in real-world scenarios focus on handling pose, expression and illumination problems on face recognition. In addition to these challenges, when the number of subjects is increased for face recognition, these problems are intensified by look-alike faces for which there are two subjects with lower intra-class variations. In such challenges, the inter-class similarity is higher than the intra-class variation for these two subjects. In fact, these look-alike faces can be created as intrinsic, situation-based and also by facial plastic surgery. This work introduces three real-world open-set face recognition methods across facial plastic surgery changes and a look-alike face by 3D face reconstruction and sparse representation. Since some real-world databases for face recognition do not have multiple images per person in the gallery, with just one image per subject in the gallery, this paper proposes a novel idea to overcome this challenge by 3D modeling from gallery images and synthesizing them for generating several images. Accordingly, a 3D model is initially reconstructed from frontal face images in a real-world gallery. Then, each 3D reconstructed face in the gallery is synthesized to several possible views and a sparse dictionary is generated based on the synthesized face image for each person. Also, a likeness dictionary is defined and its optimization problem is solved by the proposed method. Finally, the face recognition is performed for open-set face recognition using three proposed representation classifications. Promising results are achieved for face recognition across plastic surgery and look-alike faces on three databases including the plastic surgery face, look-alike face and LFW databases compared to several state-of-the-art methods. Also, several real-world and open-set scenarios are performed to evaluate the proposed method on these databases in real-world scenarios. This paper uses 3D reconstructed models to recognize look-alike faces.A feature is extracted from both facial reconstructed depth and texture images.This paper proposes likeness dictionary learning.Three open-set classification methods are proposed for real-world face recognition.

27 citations


Cites background or methods from "Face recognition for look-alikes: A..."

  • ...5) The proposed method improves the face recognition rate across plastic surgery and look-alike faces on three databases including the plastic surgery face [3], look-alike face [9] and LFW [16] databases....

    [...]

  • ...Unlike most mentioned approaches in [2]-[9], the proposed method is implemented under open-set situations as fully automatic, and handles continuous pose and expression variations in real-world scenarios....

    [...]

  • ...Among these challenges, face recognition across plastic surgery and look-alike are major ones that are one of the most important problems to be solved and have only been lately addressed by few researchers in [2]-[5] and [6]-[9] for face recognition across facial plastic surgery and look-alike faces, respectively....

    [...]

  • ...Therefore, the proposed method is efficient for face recognition for look-alike faces in open-set and real-world scenarios, while the mentioned method in [2]-[9] cannot handle the problem of open-set face recognition....

    [...]

  • ...The images were taken from the look-alike face database [9]....

    [...]

Journal ArticleDOI
TL;DR: The proposed LGS variants attempt to improve the performance of the face identification system under the influence of pose changes, facial expression changes, illumination variation, makeup, accessories, accessories and facial complexity.
Abstract: This paper reports a face identification system for visible, look–alike and post–surgery face images of individuals using some novel variants which are exploited from local graph structure (LGS). The proposed LGS variants attempt to improve the performance of the face identification system under the influence of pose changes, facial expression changes, illumination variation, makeup, accessories (glasses) and facial complexity (look alike and plastic surgery). The idea is to represent each pixel along with its neighborhood pixels of a face image based on the regenerated directed local graph structure. From the newly defined local graph structure a binary pattern is generated for each pixel and this binary string is then converted into a decimal value and generates a transformed pattern. Finally, this transformed pattern is used to generate a concatenated histogram which is then used for matching and identification by using three well-known classifiers, namely, locally scaled sum of squared differences (LSSD), locally scaled sum of absolute differences (LSAD), and histogram intersection (HI). Unlike prior works, face images do not have to undergo the preprocessing stages as each novel variant deals with local structure of a face image by disregarding other effects. The UMIST, the JAFFE, the Extended Yale Face B, the Look-alike and the Plastic Surgery face databases are used for the evaluation. Extensive experiments on face databases exhibit promising and convincing results. Further, the experimental results have led to a robust identification system which is found to be invariant to different challenges made of due to capturing environment and face modality changes.

25 citations


Cites background or methods from "Face recognition for look-alikes: A..."

  • ...…context of the face identification on the five challenging databases, viz. the UMIST (Kisku et al., 2011), the JAFFE (Suruliandi, Meena, & Rose, 2012), the Extended Yale Face B (UCSD Repository, 2001), the Look-alike (Lamba et al., 2011) and the Plastic Surgery (Singh et al., 2010) face databases....

    [...]

  • ...Look-alike face database was proposed by Lamba et al. (Lamba et al., 2011)....

    [...]

  • ..., 2011), the JAFFE (Suruliandi, Meena, & Rose, 2012), the Extended Yale Face B (UCSD Repository, 2001), the Look-alike (Lamba et al., 2011) and the Plastic Surgery (Singh et al....

    [...]

  • ...5.2 Experimental Setup and Protocol AC CE PT ED M AN US CR IP T The experiment is conducted on the UMIST (Kisku et al., 2011), the JAFFE (Suruliandi, Meena, & Rose, 2012), the Extended Yale Face B (UCSD Repository, 2001), the Look-alike (Lamba et al., 2011) and the Plastic Surgery (Singh et al., 2010) face databases....

    [...]

  • ...Table 3 shows the comparison summary where recognition rate in the context of the face identification on the five challenging databases, viz. the UMIST (Kisku et al., 2011), the JAFFE (Suruliandi, Meena, & Rose, 2012), the Extended Yale Face B (UCSD Repository, 2001), the Look-alike (Lamba et al., 2011) and the Plastic Surgery (Singh et al., 2010) face databases....

    [...]

Proceedings ArticleDOI
01 Sep 2016
TL;DR: This survey pulls together the literature to date in the ability of biometric techniques to distinguish between identical twins, identifies available datasets for research, points out topics of uncertainty and suggests possible future research.
Abstract: The ability of biometric techniques to distinguish between identical twins is of interest for multiple reasons. The research literature touching on this topic is spread across a variety of areas. This survey pulls together the literature to date in this area, identifies available datasets for research, points out topics of uncertainty and suggests possible future research.

20 citations


Cites background from "Face recognition for look-alikes: A..."

  • ...Lamba et al. [29] consider a generalization of the identical twin problem, namely the task of distinguishing 'look-alikes' such as impersonators (in this context, twins are considered 'biological look-alikes' by the authors)....

    [...]

Proceedings ArticleDOI
01 Nov 2012
TL;DR: The result from surgical and non-surgical face database shows that the proposed face recognition system can easily tackle illumination, pose, expression, occlusion and plastic surgery variations in face images.
Abstract: Facial plastic surgery changes facial features to large extend and thus creating a major problem to face recognition system. This paper proposes a new face recognition system using novel shape local binary texture (SLBT) feature from face images cascaded with periocular feature for plastic surgery invariant face recognition. In-spite of many uniqueness and advantages, the existing feature extraction methods are capable of extracting either shape or texture feature. A method which can extract both shape and texture feature is more attractive. The proposed SLBT can extract global shape, local shape and texture information from a face image by extracting local binary pattern (LBP) instead of direct intensity values from shape free patch of active appearance model (AAM). The experiments conducted using MUCT and plastic surgery face database shows that the SLBT feature performs better than AAM and LBP features. Further increase in recognition rate is achieved by cascading SLBT features from face with LBP features from periocular regions. The result from surgical and non-surgical face database shows that the proposed face recognition system can easily tackle illumination, pose, expression, occlusion and plastic surgery variations in face images.

18 citations


Cites background from "Face recognition for look-alikes: A..."

  • ...This creates problem in look-alike situation, where the inter-class variation between look-alikes (similar looking faces) are reasonably small [10]....

    [...]

References
More filters
Proceedings Article
03 Dec 1996
TL;DR: This presentation reports results of applying the Support Vector method to problems of estimating regressions, constructing multidimensional splines, and solving linear operator equations.
Abstract: The Support Vector (SV) method was recently proposed for estimating regressions, constructing multidimensional splines, and solving linear operator equations [Vapnik, 1995]. In this presentation we report results of applying the SV method to these problems.

2,632 citations


"Face recognition for look-alikes: A..." refers methods in this paper

  • ...To verify the identity, a decision toacceptor reject is made on the test pattern using a thresholdt, Decision(sprobe) = { Accept, if SVM output> t Reject, otherwise....

    [...]

  • ...For SVM, best results are obtained using the radial basis function with kernel parameter = 4....

    [...]

  • ...In the testing phase, the match score vector obtained by matching the gallery and probe pair,sprobe is classified using the trained SVM....

    [...]

  • ...The match score vectors is used as input to the SVM classifier....

    [...]

  • ...Since SVM requires training, the match scores and their labels obtained from the training database are used to train SVM for classification....

    [...]

Book ChapterDOI
08 Oct 1997
TL;DR: A new method for performing a nonlinear form of Principal Component Analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
Abstract: A new method for performing a nonlinear form of Principal Component Analysis is proposed. By the use of integral operator kernel functions, one can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all possible d-pixel products in images. We give the derivation of the method and present experimental results on polynomial feature extraction for pattern recognition.

2,223 citations

Journal ArticleDOI
TL;DR: In the Fall of 2000, a database of more than 40,000 facial images of 68 people was collected using the Carnegie Mellon University 3D Room to imaged each person across 13 different poses, under 43 different illumination conditions, and with four different expressions.
Abstract: In the Fall of 2000, we collected a database of more than 40,000 facial images of 68 people. Using the Carnegie Mellon University 3D Room, we imaged each person across 13 different poses, under 43 different illumination conditions, and with four different expressions. We call this the CMU pose, illumination, and expression (PIE) database. We describe the imaging hardware, the collection procedure, the organization of the images, several possible uses, and how to obtain the database.

1,880 citations

Journal ArticleDOI
TL;DR: A hierarchical system that closely follows the organization of visual cortex and builds an increasingly complex and invariant feature representation by alternating between a template matching and a maximum pooling operation is described.
Abstract: We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the organization of visual cortex and builds an increasingly complex and invariant feature representation by alternating between a template matching and a maximum pooling operation. We demonstrate the strength of the approach on a range of recognition tasks: From invariant single object recognition in clutter to multiclass categorization problems and complex scene understanding tasks that rely on the recognition of both shape-based as well as texture-based objects. Given the biological constraints that the system had to satisfy, the approach performs surprisingly well: It has the capability of learning from only a few training examples and competes with state-of-the-art systems. We also discuss the existence of a universal, redundant dictionary of features that could handle the recognition of most object categories. In addition to its relevance for computer vision, the success of this approach suggests a plausibility proof for a class of feedforward models of object recognition in cortex

1,779 citations


"Face recognition for look-alikes: A..." refers background in this paper

  • ...To recognize an individual, the visual cortex exploits spatial correlations by pro cessing overlapping information extracted at global and lo cal levels and effectively combines them to make a decision [14]....

    [...]

Proceedings ArticleDOI
20 May 2002
TL;DR: Between October 2000 and December 2000, a database of over 40,000 facial images of 68 people was collected, using the CMU 3D Room to imaged each person across 13 different poses, under 43 different illumination conditions, and with four different expressions.
Abstract: Between October 2000 and December 2000, we collected a database of over 40,000 facial images of 68 people. Using the CMU (Carnegie Mellon University) 3D Room, we imaged each person across 13 different poses, under 43 different illumination conditions, and with four different expressions. We call this database the CMU Pose, Illumination and Expression (PIE) database. In this paper, we describe the imaging hardware, the collection procedure, the organization of the database, several potential uses of the database, and how to obtain the database.

1,697 citations