Skip to Main content Skip to Navigation
Journal articles

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

Sébastien Bougleux 1 Benoit Gaüzère 2, 3 David Blumenthal 4 Luc Brun 1
1 Equipe Image - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
3 DocApp - LITIS - Equipe Apprentissage
LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal-normandie-univ.archives-ouvertes.fr/hal-02110718
Contributor : Benoit Gaüzère <>
Submitted on : Thursday, July 11, 2019 - 10:25:30 AM
Last modification on : Thursday, March 5, 2020 - 10:48:02 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

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, Elsevier, 2018, ⟨10.1016/j.patrec.2018.03.032⟩. ⟨hal-02110718⟩

Share

Metrics

Record views

96

Files downloads

161