Elastic graph matching has been proposed as a practical implementation of dynamic link matching, which is a neural network with dynamically evolving links between a reference model and an input image. Each node of the graph contains features that characterize the neighborhood of its location in the image. The elastic graph matching usually consists of two consecutive steps, namely a matching with a rigid grid, followed by a deformation of the grid, which is actually the elastic part. The deformation step is introduced in order to allow for some deformation, rotation, and scaling of the object to be matched. This method is applied here to the authentication of human faces where candidates claim an identity that is to be checked. The matching error as originally suggested is not powerful enough to provide satisfying results in this case. We introduce an automatic weighting of the nodes according to their significance. We also explore the significance of the elastic deformation for an application of face-based person authentication. We compare performance results obtained with and without the second matching step. Results show that the deformation step slightly increases the performance, but has lower influence than the weighting of the nodes. The best results are obtained with the combination of both aspects. The results provided by the proposed method compare favorably with two methods that require a prior geometric face normalization, namely the synergetic and eigenface approaches.

This paper investigates the application of statistical pattern recognition methods in the framework of the dynamic link matching approach. This method describes objects by means of local frequency information on nodes of a sparse grid. Matching of an input image with a reference is achieved by displacement and deformation of the grid. This method is applied here to the authentication of human faces in a cooperative scenario where candidates claim an identity that is to be checked. The matching error is not powerful enough to provide satisfying results in this case. We introduce an automatic weighting of the nodes according to their significance. Results show that for regular grids, this weighting leads to a significant improvement of the performance.

A layered motion estimation scheme using fuzzy clustering is introduced in this paper. Once motion estimation is performed a modified objective criterion is applied to discard non significant classes.

Keywords: LTS1 Reference LTS-CONF-1995-018 Record created on 2006-06-14, modified on 2016-08-08

This paper describes a spatiotemporal framework for motion estimation, based on a fully parametric motion model. The model type defines a group of transformations. The motion estimation consists in finding a subgroup which leaves the image sequence invariant.