This article describes how automatically specializing a fairly naive pattern matcher by partial evaluation leads to the Knuth, Morris & Pratt algorithm. Interestingly enough, no theorem proving is needed to achieve the partial evaluation, as was previously argued, and it is suucient to identify a static component in the computation to get the result { a deterministic nite automaton. This experi...

We present a novel approach to matching 3D faces with expressions, deformations and outliers. The matching is performed through an accurate and robust algorithm for registering face meshes. The registration algorithm incorporates prior anthropometric knowledge through the use of suitable landmarks and regions of the face to be used with the Iterative Closest Point (ICP) registration algorithm. ...

Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic...

A novel approach to assessing colour appearance is described. It is based on a new technique—partial hue-matching—which allows for measuring colour in terms of component hues objectively, without resorting to verbal definitions. The new method is believed to have a potential to be as exact as colorimetric techniques. In contrast to classical colour matching, which implies visual equivalence of ...

The statistical matching problem involves the integration of multiple datasets where some variables are not observed jointly. This missing data pattern leaves most statistical models unidentifiable. Statistical inference is still possible when operating under the framework of partially identified models, where the goal is to bound the parameters rather than to estimate them precisely. In many m...

In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achiev...

Curve matching is a fundamental problem which occurs in many applications. In this paper, we extend the Fréchet distance to measure partial curve similarity, study its properties, and develop efficient algorithms to compute it. In particular, under the L1 or L∞ metrics, we present an algorithm to compute, in O(m2) time, the partial Fréchet distance between a segment and a polygonal curve of siz...

Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show a rigorous approach allowing to find matching par...

The latest multi-biometric grand challenge (MBGC 2008) sets up a new experiment in which near infrared (NIR) face videos containing partial faces are used as a probe set and the visual (VIS) images of full faces are used as the target set. This is challenging for two reasons: (1) it has to deal with partially occluded faces in the NIR videos, and (2) the matching is between heterogeneous NIR an...

This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models relying on partial matching in order to ensure high accuracy, coverage, robustness, low complexity while being anytime. Indeed, contrary to state of the art, this model does not simply match the context of the active user to the c...