scispace - formally typeset
Journal ArticleDOI

Approximate graph edit distance computation by means of bipartite graph matching

Kaspar Riesen, +1 more
- 01 Jun 2009 - 
- Vol. 27, Iss: 7, pp 950-959
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
Book ChapterDOI

Offline Signature Verification by Combining Graph Edit Distance and Triplet Networks

TL;DR: In this paper, a structural approach to offline signature verification based on graph edit distance was combined with a statistical approach based on metric learning with deep neural networks. And they demonstrate that combining the structural and statistical models leads to significant improvements in performance, profiting from their complementary properties.
Proceedings ArticleDOI

Graph Edit Distance Based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition

TL;DR: A new algorithm to measure the distance between triangular tessellations using a new decomposition of triangular tESsellations into triangle-Stars is proposed, which assures a minimum number of disjoint Triangle-Stars, offers a better measure by covering a larger neighborhood and uses a set of descriptors which are invariant or at least oblivious under most common deformations.
Journal ArticleDOI

An algorithm for weighted sub-graph matching based on gradient flows

TL;DR: An algorithm for matching the weighted sub-graphs based on gradient flows is proposed in this paper and the experimental results show that the proposed sub- graph matching is feasible.
Journal ArticleDOI

A Graph-based approach for Kite recognition

TL;DR: The proposed approach combines graph invariants with a geometric graph edit distance computation leading to an efficient Kite identification process and performs extensive experiments both on real and synthetic Kite graph data sets to attest the effectiveness of the approach.
Journal ArticleDOI

On the Impact of Using Utilities Rather than Costs for Graph Matching

TL;DR: The introduction of a transformation process in order to convert the underlying cost model into a utility model is introduced and it is empirically confirmed that the positive effects of this transformation on five benchmark graph sets with respect to the accuracy and run time of a distance based classifier.
References
More filters
Journal ArticleDOI

The Protein Data Bank

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)