Synchronisation of Partial Multi-Matchings via Non-negative Factorisations

03/16/2018
by   Florian Bernard, et al.
0

In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the property that the set of pairwise matchings is cycle-consistent, i.e. in the full matching case all compositions of pairwise matchings over cycles must be equal to the identity. Motivated by clustering and matrix factorisation perspectives of cycle-consistency, we derive an algorithm to tackle the permutation synchronisation problem based on non-negative factorisations. In order to deal with the inherent non-convexity of the permutation synchronisation problem, we use an initialisation procedure based on a novel rotation scheme applied to the solution of the spectral relaxation. Moreover, this rotation scheme facilitates a convenient Euclidean projection to obtain a binary solution after solving our relaxed problem. In contrast to state-of-the-art methods, our approach is guaranteed to produce cycle-consistent results. We experimentally demonstrate the efficacy of our method and show that it achieves better results compared to existing methods.

READ FULL TEXT

page 5

page 9

page 11

research
07/01/2020

On the tenacity of cycle permutation graph

A special class of cubic graphs is the cycle permutation graphs. A cycle...
research
05/30/2022

Structure of non-negative posets of Dynkin type 𝔸_n

We study, in terms of directed graphs, partially ordered sets (posets) I...
research
02/06/2019

CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification Algorithm for Multi-Agent Data Association

A fundamental challenge in many robotics applications is to correctly sy...
research
10/11/2022

Kernelized multi-graph matching

Multigraph matching is a recent variant of the graph matching problem. I...
research
03/28/2023

CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapes

Jointly matching multiple, non-rigidly deformed 3D shapes is a challengi...
research
11/26/2018

Higher-order Projected Power Iterations for Scalable Multi-Matching

The matching of multiple objects (e.g. shapes or images) is a fundamenta...
research
03/30/2022

Fast, Accurate and Memory-Efficient Partial Permutation Synchronization

Previous partial permutation synchronization (PPS) algorithms, which are...

Please sign up or login with your details

Forgot password? Click here to reset