Authors:
- Provides a thorough introduction to the concept of graph edit distance (GED)
- Describes a selection of diverse GED algorithms with step-by-step examples
- Presents a unique overview of recent pattern recognition applications based on GED
- Includes several novel and significant extensions of GED, with a special focus on fast approximation algorithms for GED
- Includes supplementary material: sn.pub/extras
Part of the book series: Advances in Computer Vision and Pattern Recognition (ACVPR)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (9 chapters)
-
Front Matter
-
Foundations and Applications of Graph Edit Distance
-
Front Matter
-
-
Recent Developments and Research on Graph Edit Distance
-
Front Matter
-
-
Back Matter
About this book
This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED). The book also provides a detailed review of a diverse selection of novel methods related to GED, and concludes by suggesting possible avenues for future research. Topics and features: formally introduces the concept of GED, and highlights the basic properties of this graph matching paradigm; describes a reformulation of GED to a quadratic assignment problem; illustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problem; reviews strategies for reducing both the overestimation of the true edit distance and the matching time in the approximation framework; examines the improvement demonstrated by the described algorithmic framework with respect to the distance accuracy and the matching time; includes appendices listing the datasets employed for the experimental evaluations discussedin the book.
Reviews
“The book presents the use of graphs in the field of structural pattern recognition. … The book is written in a very accessible fashion. The author gives many examples presenting the notations and problems considered. The book is suitable for graduate students and is an ideal reference for researchers and professionals interested in graph edit distance and its applications in pattern recognition.” (Krzystof Gdawiec, zbMATH 1365.68004, 2017)
“This book is exactly about this fascinating topic: the definition, the study of properties, and the areas of application of the graph edit distance in the realm of structural pattern recognition. … The book’s intended audience is advanced graduate students in science and engineering, but also professionals working in relevant fields.” (Dimitrios Katsaros, Computing Reviews, computingreviews.com, August, 2016)
Authors and Affiliations
-
Institut für Wirtschaftsinformatik, Fachhochschule Nordwestschweiz, Olten, Switzerland
Kaspar Riesen
About the author
Dr. Kaspar Riesen is a university lecturer of computer science in the Institute for Information Systems at the University of Applied Sciences and Arts Northwestern Switzerland, Olten, Switzerland.
Bibliographic Information
Book Title: Structural Pattern Recognition with Graph Edit Distance
Book Subtitle: Approximation Algorithms and Applications
Authors: Kaspar Riesen
Series Title: Advances in Computer Vision and Pattern Recognition
DOI: https://doi.org/10.1007/978-3-319-27252-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Hardcover ISBN: 978-3-319-27251-1Published: 08 February 2016
Softcover ISBN: 978-3-319-80101-8Published: 30 March 2018
eBook ISBN: 978-3-319-27252-8Published: 09 January 2016
Series ISSN: 2191-6586
Series E-ISSN: 2191-6594
Edition Number: 1
Number of Pages: XIII, 158
Number of Illustrations: 24 b/w illustrations, 4 illustrations in colour
Topics: Pattern Recognition, Data Structures