LIBLSAP is a toolbox for Linear Sum Assignment Problem (LSAP) and Linear Sum Assignment Problem with Edition (LSAPE). It is written in C++ and it provides bindings for Matlab/Octave and Python. It is a free software distributed under CeCILL-C license. It was created to test the algorithms we develop during our research activities.Content
- compute primal and dual solutions for LSAP and LSAPE with the Hungarian algorithm
- compute a feasible non-exact solution for LSAP and LSAPE with greedy algorithms
- enumerate all (or k) solutions for LSAP and LSAPE
- no round-off errors for floatting-point values
- view repository: https://forge.greyc.fr/projects/liblsap/repository
- clone the current version with git: git clone https://forge.greyc.fr/git/liblsap
- David B. Blumenthal (Technical University of Munich)
- Sébastien Bougleux (Normandie Univ, UNICAEN, GREYC) - main developer
- Luc Brun (Normandie Univ, ENSICAEN, GREYC)
- Évariste Daller (Normandie Univ, UNICAEN, GREYC) - Master internship 2017
- Benoit Gaüzère (Normandie Univ, INSA Rouen, LITIS)
- S. Bougleux, B. Gaüzère, D.B. Blumenthal, L. Brun. Fast Linear Sum Assignment with Error-Correction and no Cost Constraints. Pattern Recognition Letters 134, 2020.
- É. Daller, S. Bougleux, B. Gaüzère, L. Brun. Approximate Graph Edit Distance by Several Local Searches in Parallel. 7th International Conference on Pattern Recognition Applications and Methods, 2018.
- S. Bougleux, B. Gaüzère, L. Brun. A Hungarian Algorithm for Error-Correcting Graph Matching. IAPR TC15 Workshop on Graph-based Represenations, LNCS 10310, Springer, 2017.
- S. Bougleux, L. Brun. Linear Sum Assignment with Edition. Research Report 2016.