171 citations · 535 across the 42 of their papers we have counts for
5 papers · 1 filter
Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
Florian Bernard, Daniel Cremers, Johan Thunberg
We address the non-convex optimisation problem of finding a sparse matrix on the Stiefel manifold (matrices with mutually orthogonal columns of unit length) that maximises (or mini…
A Lifting method for analyzing distributed synchronization on the unit sphere
Johan Thunberg, Johan Markdahl, Florian Bernard +1
This paper introduces a new lifting method for analyzing convergence of continuous-time distributed synchronization/consensus systems on the unit sphere. Points on the d-dimensiona…
DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
Florian Bernard, Christian Theobalt, Michael Moeller
In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tig…
Distributed methods for synchronization of orthogonal matrices over graphs
Johan Thunberg, Florian Bernard, Jorge Goncalves
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equ…
On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems
Johan Thunberg, Florian Bernard, Jorge Goncalves
Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are…