DeepAI AI Chat
Log In Sign Up

Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian

by   Yunpeng Shi, et al.

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 propose 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.


page 1

page 2

page 3

page 4


Connection graph Laplacian methods can be made robust to noise

Recently, several data analytic techniques based on connection graph lap...

Solving Jigsaw Puzzles By The Graph Connection Laplacian

We propose a novel mathematical framework to address the problem of auto...

TRex: A Tomography Reconstruction Proximal Framework for Robust Sparse View X-Ray Applications

We present TRex, a flexible and robust Tomographic Reconstruction framew...

Message Passing Least Squares Framework and its Application to Rotation Synchronization

We propose an efficient algorithm for solving group synchronization unde...

Stochastic Iterative Graph Matching

Recent works leveraging Graph Neural Networks to approach graph matching...

Learning Tensor Latent Features

We study the problem of learning latent feature models (LFMs) for tensor...

Simplicial Complex based Point Correspondence between Images warped onto Manifolds

Recent increase in the availability of warped images projected onto a ma...