Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian
Computer Vision and Pattern Recognition
2021-10-11 v2 Numerical Analysis
Numerical Analysis
Probability
Machine Learning
Abstract
We propose an efficient and robust iterative solution to the multi-object matching problem. We first clarify serious limitations of current methods as well as the inappropriateness of the standard iteratively reweighted least squares procedure. In view of these limitations, we suggest a novel and more reliable iterative reweighting strategy that incorporates information from higher-order neighborhoods by exploiting the graph connection Laplacian. We demonstrate the superior performance of our procedure over state-of-the-art methods using both synthetic and real datasets.
Keywords
Cite
@article{arxiv.2006.06658,
title = {Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian},
author = {Yunpeng Shi and Shaohan Li and Gilad Lerman},
journal= {arXiv preprint arXiv:2006.06658},
year = {2021}
}