Solving the multi-way matching problem by permutation synchronization

208 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On Valid Optimal Assignment Kernels and Applications to Graph Classification (2016, background): “[16] considered the problem of finding optimal assignments between multiple sets.”
A survey on graph kernels (2019, background): “[73] studied a generalization of the assignment problem to more than two sets, which was used to define transitive assignment kernels for graphs [74].”
Image Matching from Handcrafted to Deep Features: A Survey (2020, background): “Another body of work takes the initial (noisy) pairwisematching result as input, and aims to recover a globally consistent pairwise matching set (Kim et al. 2012; Pachauri et al. 2013; Huang and Guibas 2013; Chen et al. 2014; Zhou et al. 2015; Wang et al. 2018; Hu et al. 2018).”