Sparse representation based face recognition is the most recent technique used, this technique first codes a testing sample as a sparse linear combination of all the training samples, and then classifies the testing sample by evaluating which class leads to the minimum representation error. The l1-norm sparsity improves the face recognition accuracy. While most of the research focus has been in...

In this paper we present a system to automatically create a caricature drawing from a frontal face photograph. The system learns how to exaggerate features based on training examples from a particular caricaturist. The input to the system is a frontal face image along with its vector based line-drawing. The system creates a face shape model of the given face with a minimum of user interaction. ...

AAM has been successfully applied to face alignment, but its performance is very sensitive to initial values. In case the initial values are a little far distant from the global optimum values, there exists a pretty good possibility that AAM-based face alignment may converge to a local minimum. In this paper, we propose a progressive AAM-based face alignment algorithm which first finds the feat...

In this paper a new approach to face recognition is presented that achieves double dimension reduction, making the system computationally efficient with better recognition results and out perform common DCT technique of face recognition. In pattern recognition techniques, discriminative information of image increases with increase in resolution to a certain extent, consequently face recognition...

We propose a real time system for person detection, recognition and tracking using frontal and profile faces. The system integrates face detection, face recognition and tracking techniques. The face detection algorithm uses both frontal face and profile face detectors by extracting the ’Haar’ features and uses them in a cascade of boosted classifiers. The pose is determined from the face detect...

The question whether the recognition of individual faces is mandatory or task-dependent is still controversial. We employed the N250r component of the event-related potential as a marker of the activation of representations of facial identity in visual memory, in order to find out whether identity-related information from faces is encoded and maintained even when facial identity is task-irrelev...

In this paper a new approach to face recognition is presented that achieves double dimension reduction making the system computationally efficient with better recognition results. In pattern recognition techniques, discriminative information of image increases with increase in resolution to a certain extent, consequently face recognition results improve with increase in face image resolution an...

Face detection locates faces prior to various face-related applications. The objective of face detection is to determine whether or not there are any faces in an image and, if any, the location of each face is detected. Face detection in real images is challenging due to large variability of illumination and face appearances. This paper proposes a face detection algorithm using the 3×3 block ra...

Given a set S of n points, we show that the length of 1) the minimum weight triangulation (MWT ) of the minimum weight convex partition (MWCP ) of S (TMWCP ) is at most Θ(n) longer than the MWT of S if collinearity of two or more edges is allowed and Θ(log n) otherwise, 2) the MWT of the minimum spanning tree (MST ) of the MWCP of S (Tmst(MWCP )) is at most Θ(n) longer than the MWT of S if coll...