Improving bipartite graph matching by assessing the assignment confidence
Authors:
- Miquel FerrerMFMiquel Ferrer
- Francesc SerratosaFSFrancesc Serratosa
- Kaspar RiesenKRKaspar Riesen
- 1 November 2015
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 65, 29-36
Abstract
No abstract availableFunding Information
- Swiss National Science Foundation (200021_153249)
- Hasler Foundation
This publication has 19 references indexed in Scilit:
- Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation2015
- Recent advances in graph-based pattern recognition with applications in document analysisPattern Recognition, 2011
- Learning Graph MatchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2009
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERINGInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- A survey of kernels for structured dataACM SIGKDD Explorations Newsletter, 2003
- A graduated assignment algorithm for graph matchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968