Loading, please wait...
:

product description page

Structural Pattern Recognition With Graph Edit Distance : Approximation Algorithms and Applications

Structural Pattern Recognition With Graph Edit Distance : Approximation Algorithms and Applications - image 1 of 1

About this item

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 discussed in the book.

Genre: Computers + Internet
Sub-Genre: Computer Vision + Pattern Recognition, Data Modeling + Design
Series Title: Advances in Computer Vision and Pattern Recognition
Format: Hardcover
Publisher: Springer Verlag
Author: Kaspar Riesen
Language: English
Street Date: February 8, 2016
TCIN: 50993785
UPC: 9783319272511
Item Number (DPCI): 248-13-9134
If the item details above aren’t accurate or complete, we want to know about it. Report incorrect product info.

Guest reviews

Prices, promotions, styles and availability may vary by store & online. See our price match guarantee. See how a store is chosen for you.