Journal ArticleDOI
Approximate graph edit distance computation by means of bipartite graph matching
Kaspar Riesen,Horst Bunke +1 more
Reads0
Chats0
TLDR
A novel algorithm is introduced which allows us to approximately, or suboptimally, compute edit distance in a substantially faster way and is emprically verified that the accuracy of the suboptimal distance remains sufficiently accurate for various pattern recognition applications.About:
This article is published in Image and Vision Computing.The article was published on 2009-06-01. It has received 654 citations till now. The article focuses on the topics: Graph operations & Line graph.read more
Citations
More filters
Journal ArticleDOI
New graph distance for deformable 3D objects recognition based on triangle-stars decomposition
TL;DR: A new graph matching technique to measure the distance between graphs, based on a new decomposition of triangular tessellations into triangle-stars, is proposed, which defines a metric space using graph embedding and graph kernel techniques and is proved that the proposed distance is a pseudo-metric.
Posted Content
An Efficient Probabilistic Approach for Graph Similarity Search
TL;DR: This paper proposes a novel probabilistic approach to efficiently estimate GED, and introduces a novel graph similarity measure by comparing branches between graphs, i.e., Graph Branch Distance (GBD), which can be efficiently calculated in polynomial time.
Proceedings ArticleDOI
Efficient retrieval of 3D building models using embeddings of attributed subgraphs
TL;DR: This work transforms the structured graph representation into a vector-based one by introducing a new concept of subgraph embeddings and provides comprehensive experiments showing that the introduced subgraphembeddings yield superior performance compared to state-of-the-art graph retrieval approaches.
Book ChapterDOI
Speeding-Up Graph-Based Keyword Spotting in Historical Handwritten Documents
TL;DR: A novel fast rejection heuristic is proposed that compares the node distribution of the query graph and the document graph in a polar coordinate system and shows that about 50% or more of the matchings can be omitted with this procedure while the KWS accuracy is not negatively affected.
Book ChapterDOI
Ring Based Approximation of Graph Edit Distance
TL;DR: This paper proposes to use rings as local structure, which are defined as collections of nodes and edges at fixed distances from the root node, and empirically shows that this allows to quickly compute a tight approximation of \(\mathrm {GED}\).
References
More filters
Journal ArticleDOI
The Protein Data Bank
Helen M. Berman,John D. Westbrook,Zukang Feng,Gary L. Gilliland,Talapady N. Bhat,Helge Weissig,Ilya N. Shindyalov,Philip E. Bourne +7 more
TL;DR: The goals of the PDB are described, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource are described.
Journal ArticleDOI
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Journal ArticleDOI
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Related Papers (5)
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
Kaspar Riesen,Horst Bunke +1 more
A distance measure between attributed relational graphs for pattern recognition
Alberto Sanfeliu,King-Sun Fu +1 more