Structural Pattern Recognition with Graph Edit Distance - Approximation Algorithms and Applications (Hardcover, 1st ed. 2015)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Advances in Computer Vision and Pattern Recognition
Release date:	February 2016
First published:	2015
Authors:	Kaspar Riesen
Dimensions:	235 x 155 x 11mm (L x W x T)
Format:	Hardcover - Cloth over boards
Pages:	158
Edition:	1st ed. 2015
ISBN-13:	978-3-319-27251-1
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > Pattern recognition Promotions
LSN:	3-319-27251-9
Barcode:	9783319272511

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!