Search Results for author:
Found 11 papers, 1 papers with code
Non-Negative Spherical Relaxations for Universe-Free Multi-Matching and Clustering
We propose a novel non-negative spherical relaxation for optimization problems over binary matrices with injectivity constraints, which in particular has applications in multi-matching and clustering.
Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
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 minimises) a quadratic objective function.
Isometric Multi-Shape Matching
Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer.
Higher-order Projected Power Iterations for Scalable Multi-Matching
The matching of multiple objects (e. g. shapes or images) is a fundamental problem in vision and graphics.
Synchronisation of Partial Multi-Matchings via 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.
Distributed methods for synchronization of orthogonal matrices over graphs
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs.
A Combinatorial Solution to Non-Rigid 3D Shape-to-Image Matching
We propose a combinatorial solution for the problem of non-rigidly matching a 3D shape to 3D image data.
Shape-aware Surface Reconstruction from Sparse 3D Point-Clouds
Estimating the parameters of the GMM in a maximum a posteriori manner yields the reconstruction of the surface from the given data points.
Linear Shape Deformation Models with Local Support Using Graph-based Structured Matrix Factorisation
Representing 3D shape deformations by linear models in high-dimensional space has many applications in computer vision and medical imaging, such as shape-based interpolation or segmentation.
On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems
Two direct or centralized synchronization methods are presented for different graph topologies; the first one for quasi-strongly connected graphs, and the second one for connected graphs.
A Solution for Multi-Alignment by Transformation Synchronisation
Simulations demonstrate that for noisy transformations, a large proportion of missing data and even for wrong correspondence assignments the method delivers encouraging results.
