Del i serien Advances in Computer Vision and Pattern Recognition

Structural Pattern Recognition with Graph Edit Distance

Approximation Algorithms and Applications

Inbunden, Engelska, 2016

AvKaspar Riesen

1 449 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

1 449 kr

Skickas inom 10-15 vardagar

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.

Produktinformation

Utgivningsdatum2016-02-08
Mått155 x 235 x 16 mm
Vikt430 g
FormatInbunden
SpråkEngelska
SerieAdvances in Computer Vision and Pattern Recognition
Antal sidor158
Upplaga16001
FörlagSpringer International Publishing AG
ISBN9783319272511

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Databaser inom Data och IT

Part I: Foundations and Applications of Graph Edit Distance.- Introduction and Basic Concepts.- Graph Edit Distance.- Bipartite Graph Edit Distance.- Part II: Recent Developments and Research on Graph Edit Distance.- Improving the Distance Accuracy of Bipartite Graph Edit Distance.- Learning Exact Graph Edit Distance.- Speeding Up Bipartite Graph Edit Distance.- Conclusions and Future Work.- Appendix A: Experimental Evaluation of Sorted Beam Search.- Appendix B: Data Sets.

"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)