DeepAI AI Chat
Log In Sign Up

Fast, Accurate and Memory-Efficient Partial Permutation Synchronization

by   Shaohan Li, et al.

Previous partial permutation synchronization (PPS) algorithms, which are commonly used for multi-object matching, often involve computation-intensive and memory-demanding matrix operations. These operations become intractable for large scale structure-from-motion datasets. For pure permutation synchronization, the recent Cycle-Edge Message Passing (CEMP) framework suggests a memory-efficient and fast solution. Here we overcome the restriction of CEMP to compact groups and propose an improved algorithm, CEMP-Partial, for estimating the corruption levels of the observed partial permutations. It allows us to subsequently implement a nonconvex weighted projected power method without the need of spectral initialization. The resulting new PPS algorithm, MatchFAME (Fast, Accurate and Memory-Efficient Matching), only involves sparse matrix operations, and thus enjoys lower time and space complexities in comparison to previous PPS algorithms. We prove that under adversarial corruption, though without additive noise and with certain assumptions, CEMP-Partial is able to exactly classify corrupted and clean partial permutations. We demonstrate the state-of-the-art accuracy, speed and memory efficiency of our method on both synthetic and real datasets.


page 1

page 2

page 3

page 4


Message Passing Least Squares Framework and its Application to Rotation Synchronization

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

Robust Group Synchronization via Cycle-Edge Message Passing

We propose a general framework for group synchronization with adversaria...

Approximate message passing from random initialization with applications to ℤ_2 synchronization

This paper is concerned with the problem of reconstructing an unknown ra...

Probabilistic Permutation Synchronization using the Riemannian Structure of the Birkhoff Polytope

We present an entirely new geometric and probabilistic approach to synch...

r-local sensing: Improved algorithm and applications

The unlabeled sensing problem is to solve a noisy linear system of equat...

A Fast Projected Fixed-Point Algorithm for Large Graph Matching

We propose a fast approximate algorithm for large graph matching. A new ...

Synchronisation of Partial Multi-Matchings via Non-negative Factorisations

In this work we study permutation synchronisation for the challenging ca...