Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications (Advances in Computer Vision and Pattern Recognition)

Kaspar Riesen

  • 出版商: Springer
  • 出版日期: 2018-04-15
  • 售價: $4,828
  • 貴賓價: 9.5$4,587
  • 語言: 英文
  • 頁數: 172
  • 裝訂: Paperback
  • ISBN: 3319801015
  • ISBN-13: 9783319801018
  • 相關分類: 電腦視覺資料結構與演算法

下單後立即進貨 (1週~2週)


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.