The authors review major recent developments in establishing stereo correspondence for
the extraction of the 3D structure of a scene. Broad categories of stereo algorithms are …

The notions of distance and similarity play a key role in many machine learning approaches,
and artificial intelligence in general, since they can serve as an organizing principle by …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

We present an algorithm for graph isomorphism and subgraph isomorphism suited for
dealing with large graphs. A first version of the algorithm has been presented in a previous …

A recent paper posed the question:" Graph Matching: What are we really talking about?". Far
from providing a definite answer to that question, in this paper we will try to characterize the …

Feature-based methods for non-rigid registration frequently encounter the correspondence
problem. Regardless of whether points, lines, curves or surface parameterizations are used …

The field of multi-agent system (MAS) is an active area of research within artificial
intelligence, with an increasingly important impact in industrial and other real-world …

A graduated assignment algorithm for graph matching is presented which is fast and
accurate even in the presence of high noise. By combining graduated nonconvexity, two …

Error-tolerant graph matching is a powerful concept that has various applications in pattern
recognition and machine vision. In the present paper, a new distance measure on graphs is …

A large number of problems in AI and other areas of computer science can be viewed as
special cases of the constraint-satisfaction problem. Some examples are machine vision …