Fast linear sum assignment with error-correction and no cost constraints - Normandie Université Access content directly
Journal Articles Pattern Recognition Letters Year : 2018

Fast linear sum assignment with error-correction and no cost constraints

Abstract

We propose an algorithm that efficiently solves the linear sum assignment problem with error-correction and no cost constraints. This problem is encountered for instance in the approximation of the graph edit distance. The fastest currently available solvers for the linear sum assignment problem require the pairwise costs to respect the triangle inequality. Our algorithm is as fast as these algorithms, but manages to drop the cost constraint. The main technical ingredient of our algorithm is a cost-dependent factorization of the node substitutions.
Fichier principal
Vignette du fichier
main.pdf (701.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02110718 , version 1 (11-07-2019)

Identifiers

Cite

Sébastien Bougleux, Benoit Gaüzère, David Blumenthal, Luc Brun. Fast linear sum assignment with error-correction and no cost constraints. Pattern Recognition Letters, 2018, ⟨10.1016/j.patrec.2018.03.032⟩. ⟨hal-02110718⟩
88 View
529 Download

Altmetric

Share

Gmail Facebook X LinkedIn More