Graph Matching Algorithms and Applications

Description

Graphs are a flexible and powerful representation mechanism that has been successfully applied in computer vision, pattern recognition and related areas. When graphs are used to represent objects of a particular domain, the recognition problem turns into the task of graph matching. In this project we study a variety of issues, including efficient algorithms for graph matching, the adaption of concepts and techniques based on vector representations to the domain of graphs, and special classes of graphs that allow matching with polynomial complexity.

Research Staff

• Kaspar Riesen

Financial support

• Swiss National Science Foundation
• IM2

Tools

• Papers on graph matching
• Graph Matching Toolkit, 271k, alternative Version Graph Matching Toolkit, 673k. Does not compile out of the box.
• See also PHd Thesis of B.T. Messmer, 598k