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
Proceedings ArticleDOI
Offline Signature Verification using Structural Dynamic Time Warping
TL;DR: This paper proposes to match the underlying graphs from different local perspectives and combine the resulting assignments by means of Dynamic Time Warping and demonstrates that the proposed approach outperforms state-of-the-art methods with respect to both accuracy and runtime.
Journal ArticleDOI
Hierarchical Adaptive Pooling by Capturing High-Order Dependency for Graph Representation Learning
TL;DR: Huang et al. as discussed by the authors proposed a hierarchical graph-level representation learning framework, which is adaptively sensitive to graph structures, i.e., HAP clusters local substructures incorporating with high-order dependencies.
Proceedings ArticleDOI
Combinatorial Learning of Graph Edit Distance via Dynamic Embedding
TL;DR: Wang et al. as mentioned in this paper proposed a hybrid approach by combing the interpretability of traditional search-based techniques for producing the edit path, as well as the efficiency and adaptivity of deep embedding models to achieve a cost-effective GED solver.
Book ChapterDOI
On the Influence of Node Centralities on Graph Edit Distance for Graph Classification
TL;DR: Five different options for Bipartite Graph Matching are proposed and it is shown that the type of local structure and the distance defined between these structures is relevant for graph classification.
Book ChapterDOI
A local adaptation of the histogram radon transform descriptor: an application to a shoe print dataset
TL;DR: A local adaptation of the HRT (Histogram Radon Transform) descriptor is provided and the best local matching between the connected components is found and the similarity between two images is defined as mean of local similarity measures.
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