A Graph Repository for Learning Error-Tolerant Graph Matching

In the last years, efforts in the pattern recognition field have been especially focused on developing systems that use graph based representations. To that aim, some graph repositories have been presented to test graph-matching algorithms or to learn some parameters needed on such algorithms. The aim of these tests has always been to increase the recognition ratio in a classification framework. Nevertheless, some graph-matching applications are not solely intended for classification purposes, but to detect similarities between the local parts of the objects that they represent. Thus, current state of the art repositories provide insufficient information. We present a graph repository structure such that each register is not only composed of a graph and its class, but also of a pair of graphs and a ground-truth correspondence between them, as well as their class. This repository structure is useful to analyse and develop graph-matching algorithms and to learn their parameters in a broadly manner. We present seven different databases, which are publicly available, with these structure and present some quality measures experimented on them.