Given a linear plant and a linear model, the partial model matching consists of designing a stabilizing compensator so as to match several first Markov parameters of the model. Using a recently established solvability condition, all such compensators are parametrized. The degrees of freedom can then be used to optimize the system performance. 0 1997 Elsevier Science Ltd.

In this paper we describe our experience in creating a tool capable to provide traceability of the requirements between different versions of the LSB and POSIX standards. We propose an approach for merging requirement markup without exact matching of the documents by means of arithmetic hashing and context similarity analysis.

This paper introduces a novel efficient partial shape matching method named IS-Match. We use sampled points from the silhouette as a shape representation. The sampled points can be ordered which in turn allows to formulate the matching step as an order-preserving assignment problem. We propose an angle descriptor between shape chords combining the advantages of global and local shape descriptio...

Computing the Fréchet distance for surfaces is a surprisingly hard problem. It has been shown that it is NP-hard to compute the Fréchet distance between many nice classes of surfaces [God98], [Buc10]. On the other hand, a polynomial time algorithm exists for computing the Fréchet distance between simple polygons [Buc06]. This was the first paper to give an algorithm for computing the Fréchet di...

A primary shortcoming of existing techniques for 3D model matching is the reliance on global information of model’s structure. Models are matched in their entirety, depending on overall topology and geometry information. A current open challenge is how to perform partial matching. Partial matching is important for finding similarities across part models with different global shape properties an...

We consider the problem of translating a given pattern set B of size m, and matching every point of B to some point of a larger ground set A of size n in an injective way, minimizing the sum of the squared distances between matched points. We show that when B can only be translated along a line, there can be at most m(n − m) + 1 different matchings as B moves along the line, and hence the optim...

Matching deformable 3D shapes under partiality transformations is a challenging problem that has received limited focus in the computer vision and graphics communities. With this benchmark, we explore and thoroughly investigate the robustness of existing matching methods in this challenging task. Participants are asked to provide a point-to-point correspondence (either sparse or dense) between ...

Yo-Sung Ho Kwangju Institute of Science and Technology Department of Information and Communications 1 Oryong-dong, Puk-gu Kwangju, 500-712 Korea Abstract. The block-matching motion estimation algorithm using a translational motion model cannot provide acceptable image quality in low bit-rate coding. To improve coding performance, we can use image warping using affine transformation as a more co...

A graph matching algorithm is illustrated and its performance compared with that of a well known algorithm performing the same task. According to the proposed algorithm, the matching process is carried out by using a State Space Representation: a state represents a partial solution of the matching between two graphs, and a transition between states corresponds to the addition of a new pair of m...

A novel scheme is proposed for the efficient object tracking by using partial projections of a sparse set of pixels to eigenspaces. This paper shows a theoretical framework of the sparse eigentemplate matching and its application to a real-time face tracker. The sparse eigentemplate matching is formalized as a partial projection onto an eigenspace. Only using a small number of pixels, it facili...