THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION

Donatello Conte, Pasquale Foggia, Carlo Sansone, Mario Vento

International Journal of Pattern Recognition and Artificial Intelligence · 2004 · 1.4K citations · 122 references

Concepts

TL;DR

A recent paper has asked what graph matching really means in pattern recognition. This study aims to characterize the role of graphs within the pattern recognition field. The authors present two taxonomies: one classifying graph‑matching algorithms from the late 1970s onward, and another categorizing common graph‑based applications in pattern recognition and machine vision.

Abstract

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 role that graphs play within the Pattern Recognition field. To this aim two taxonomies are presented and discussed. The first includes almost all the graph matching algorithms proposed from the late seventies, and describes the different classes of algorithms. The second taxonomy considers the types of common applications of graph-based techniques in the Pattern Recognition and Machine Vision field.

References

122