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
A graph-based approach for the retrieval of multi-modality medical images
Ashnil Kumar,Jinman Kim,Lingfeng Wen,Lingfeng Wen,Michael J. Fulham,Michael J. Fulham,Dagan Feng,Dagan Feng +7 more
TL;DR: This paper proposes a new graph structure derived from complete graphs that structurally constrains the edges connected to tumour vertices based upon the spatial proximity of tumours and organs, and presents a similarity matching algorithm that accounts for different feature sets for graph elements from different imaging modalities.
Posted Content
Deep Graph Matching Consensus
TL;DR: Deep Graph Matching Consensus (DGC) as discussed by the authors is a two-stage neural architecture for learning and refining structural correspondences between graphs, which uses localized node embeddings computed by a graph neural network to obtain an initial ranking of soft correspondence between nodes.
Proceedings ArticleDOI
A Novel Learning-Free Word Spotting Approach Based on Graph Representation
TL;DR: A novel handwritten word spotting approach based on graph representation that comprises both topological and morphological signatures of handwriting that outperforms the state-of-the-art structural methods.
Book ChapterDOI
Attributed Graph Matching using Local Descriptions
TL;DR: This paper shows how local descriptions are used to define a node-to-node cost in an assignment problem using the Hungarian method and proposes a distance formula to compute the distance between attributed graphs.
Journal ArticleDOI
Measuring similarity of graph nodes by neighbor matching
TL;DR: This work proposes one novel method of that sort, with a refined concept of similarity of nodes that involves matching their neighbors that has some additional desirable properties that, to the knowledge, the existing methods lack.
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