Exact and stable recovery of rotations for robust synchronization

DOI10.1093/IMAIAI/IAT005zbMath1309.65070arXiv1211.2441OpenAlexW2963537367MaRDI QIDQ5175646

Lanhui Wang, Amit Singer

Publication date: 24 February 2015

Published in: Information and Inference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.2441

zbMATH Keywords

convex optimizationsemidefinite programmingcomputer visioncomputer graphicsnumerical simulationalternating direction methodleast squares solutionsemidefinite relaxationsensor network localizationleast unsquared deviationsynchronization of rotations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (33)

Joint Alignment from Pairwise Differences with a Noisy Oracle ⋮ Continuous symmetry breaking along the Nishimori line ⋮ Orientation estimation of cryo-EM images using projected gradient descent method ⋮ From intrinsic optimization to iterated extended Kalman filtering on Lie groups ⋮ On the local stability of semidefinite relaxations ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ Synchronization over Cartan Motion Groups via Contraction ⋮ Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method ⋮ Distributed methods for synchronization of orthogonal matrices over graphs ⋮ Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis ⋮ A survey of structure from motion. ⋮ Lagrangian Duality in Complex Pose Graph Optimization ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ Synchronization problems in computer vision with closed-form solutions ⋮ The noise-sensitivity phase transition in spectral group synchronization over compact groups ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ Graph connection Laplacian and random matrices with random blocks ⋮ Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences ⋮ Concentration of the Kirchhoff index for Erdős-Rényi graphs ⋮ The geometry of synchronization problems and learning group actions ⋮ Near-Optimal Bounds for Phase Synchronization ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs ⋮ Generalized shapes and point sets correspondence and registration ⋮ Nonconvex Phase Synchronization ⋮ Group synchronization on grids ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Robust group synchronization via cycle-edge message passing ⋮ Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions ⋮ Spectral Synchronization of Multiple Views in SE(3) ⋮ Robust computation of linear models by convex relaxation

This page was built for publication: Exact and stable recovery of rotations for robust synchronization