Human face detection is often the first step in applications such as video surveillance, human computer interface, face recognition, and image database management. We propose a face detection algorithm for color images in the presence of varying lighting conditions as well as complex backgrounds. Our method detects skin regions over the entire image, and then generates face candidates based on the spatial arrangement of these skin patches. The algorithm constructs eye, mouth, and boundary maps for verifying each face candidate. Experimental results demonstrate successful detection over a wide variety of facial variations in color, position, scale, rotation, pose, and expression from several photo collections.

What does it mean for a deforming object to be "moving" (see Fig. 1)? How can we separate the overall motion (a finite-dimensional group action) from the more general deformation (a di#eomorphism)? In this paper we propose a definition of motion for a deforming object and introduce a notion of "shape average" as the entity that separates the motion from the deformation. Our definition allows us to derive novel and e#cient algorithms to register non-equivalent shapes using region-based methods, and to simultaneously approximate and register structures in grey-scale images. We also extend the notion of shape average to that of a "moving average" in order to track moving and deforming objects through time.

Abstract not found

The implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent union-find approach. Unlike the earlier

Two variants of dynamic link matching based on mathematical morphology are developed and tested for frontal face authentication, namely, the Morphological Dynamic Link Architecture and the Morphological Signal Decomposition - Dynamic Link Architecture. Local coefficients which weigh the contribution of each node in elastic graph matching according to its discriminatory power are derived. The performance of the proposed algorithms is evaluated in terms of their Receiver Operating Characteristic and the Equal Error Rate achieved in M2VTS database. The comparison with other frontal face authentication algorithms developed within M2VTS project indicates that Morphological Dynamic Link Architecture with discriminatory power coefficients is ranked as the best algorithm in terms of the Equal Error Rate. 1 Introduction Face recognition has exhibited a tremendous growth for more than two decades. A critical survey of the literature related to human and machine recognition is found in [1]. An ...

A novel dynamic link architecture based on multiscale morphological dilation-erosion is proposed for face verification in a cooperative scenario where the candidates claim an identity that is to be checked. The performance of the morphological dynamic link architecture (MDLA) is evaluated in terms of the receiver operating characteristic (ROC) for several threshold selections on the matching error in the M2VTS database. The experimental results indicate that the proposed method outperforms the dynamic link matching with Gabor based feature vectors. 1 Introduction Face recognition has exhibited a tremendous growth for more than two decades. A critical survey of the literature related to human and machine face recognition can be found in [1]. Two main categories for face recognition techniques are identified: those employing geometrical features and those using grey-level information (e.g. the eigenface approach). An approach that exploits both sources of information, that is, the grey...

Two novel variants of Dynamic Link Architecture that are based on mathematical morphology and incorporate coefficients which weigh the contribution of each node in elastic graph matching according to its discriminatory power are developed. They are the so called Morphological Dynamic Link Architecture and the Morphological Signal Decomposition-Dynamic Link Architecture. The proposed variants are tested for face authentication in a cooperative scenario where the candidates claim an identity to be checked. Their performance is evaluated in terms of their Receiver Operating Characteristic and the Equal Error Rate achieved in M2VTS database. An Equal Error Rate in the range 3.7-6.8% is reported. 1 Introduction Face recognition has exhibited a tremendous growth for more than two decades. A critical survey of the literature on human and machine face recognition can be found in [1]. An approach that exploits both sources of information, that is, the grey-level information and shape informat...

. A very attractive approach for face detection is based on multiresolution images (also known as mosaic images). Motivated by the simplicity of this approach, a rule-based face detection algorithm in frontal views is developed first. Second, a novel dynamic link architecture based on multiscale morphological dilation-erosion is proposed for face authentication. More specifically, a sparse grid is placed over the outcome of face detection stage for each person in a reference set. Subsequently, multiscale morphological operations are employed to yield a feature vector at each node of the grid and dynamic link matching is applied to verify the identity of each person from a test set. The first experimental results reported in this paper verify the superiority of the proposed method over the (standard) dynamic link matching that is based on Gabor wavelets. 1 Introduction Face recognition has been an active research topic in computer vision for more than two decades. A critical survey of ...

and to the memory of my dear late friend Chirag Doshi. asatho maa sadgamaya thamaso maa jyothirgamaya mrityour maa amritham gamaya From the unreal, lead me to the real; From darkness, lead me to the light; From death, lead me to immortality. From the Brihadaranyaka Upanishad ii

In this paper, morphological elastic graph matching is applied to frontal face authentication on databases ranging from small to large multimedia ones collected under either well-controlled or realworld conditions. It is shown that the morphological elastic graph matching achieves a very low equal error rate on databases collected under well-controlled conditions. However, its performance deteriorates when it is applied to databases recorded in real-world scenarios. The compensation for variable recording conditions such as changes in illumination, scale differences and varying face position prior to the application of morphological elastic matching is proposed. Keywords Frontal face verification, morphological elastic graph matching, large databases, face normalization, receiver operating characteristics. I. Introduction The interest and the research activities in automatic face recognition have increased significantly over the past few years. The growth is mainly driven by applicat...