Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian
arXiv:2006.06658
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.
References in corpus (5)
- A General Multi-Graph Matching Approach via Graduated Consistency-regularized Boosting
- Nonconvex phase synchronization
- Near-Optimal Joint Object Matching via Convex Relaxation
- Message-passing algorithms for synchronization problems over compact groups
- ShapeFit and ShapeKick for Robust, Scalable Structure from Motion