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 …

Hybrid metaheuristics have received considerable interest these recent years in the field of
combinatorial optimization. A wide variety of hybrid approaches have been proposed in the …

This thesis addresses the issues of scale for practical implementations of simultaneous
localisation and mapping (SLAM) in extensive outdoor environments. Building an …

Data association is the process of relating features observed in the environment to features
viewed previously or to features in a map. This paper presents a graph theoretic method that …

Solid models are the critical data elements in modern computer-aided design (CAD)
environments, describing the shape and form of manufactured artifacts. Their growing …

The optimization of the control parameters of genetic algorithms is often a time consuming
and tedious task. In this work we take the meta-level genetic algorithm approach to control …

This paper first reviews some theoretical results in error-tolerant graph matching that were
obtained recently. The results include a new metric for error-tolerant graph matching based …

Many computer vision applications require a comparison between two objects, or between
an object and a reference model. When the objects or the scenes are represented by …

Solid models are the critical data elements in modern computer-aided design environments,
because they describe the shape and form of manufactured artifacts. Their growing ubiquity …

Graph Matching and Similarity Page 1 Chapter 10 Graph Matching and Similarity Horst Bunke
and Xiaoyi Jiang Many graphical interfacing problems relay on graph matching. In this chapter …