Global Registration of Multiple Point Clouds Using Semidefinite Programming
From MaRDI portal
Publication:5252586
DOI10.1137/130935458zbMath1322.90058arXiv1306.5226OpenAlexW2963381078MaRDI QIDQ5252586
No author found.
Publication date: 2 June 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5226
spectral gapconvex relaxationnoise stabilityexact recoveryrigidity theoryspectral relaxationsemidefinite program (SDP)global registrationrigid transforms
Semidefinite programming (90C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Related Items (13)
On the tightness of semidefinite relaxations for rotation estimation ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ Approximating the little Grothendieck problem over the orthogonal and unitary groups ⋮ 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 Spectral Method for Joint Community Detection and Orthogonal Group Synchronization ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance ⋮ The geometry of synchronization problems and learning group actions ⋮ Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions ⋮ Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Localization from incomplete noisy distance measurements
- Angular synchronization by eigenvectors and semidefinite programming
- Moment inequalities for sums of random matrices and their applications in optimization
- Semidefinite programming for discrete optimization and matrix completion problems
- Characterizing the universal rigidity of generic frameworks
- On the pseudo-inverse of the Laplacian of a bipartite graph
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Theory of semidefinite programming for sensor network localization
- Rigidity and energy
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Templates for convex cone problems with applications to sparse signal recovery
- Geometry and convergence analysis of algorithms for registration of 3D shapes
- Phase recovery, MaxCut and complex semidefinite programming
- Exact matrix completion via convex optimization
- Block Coordinate Descent Methods for Semidefinite Programming
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems
- Eigenvector synchronization, graph rigidity and the molecule problem
- Manopt, a Matlab toolbox for optimization on manifolds
- ON AFFINE RIGIDITY
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Spectral Properties of the Alignment Matrices in Manifold Learning
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Characterizing generic global rigidity
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Computing the Polar Decomposition—with Applications
- Conditions for Unique Graph Realizations
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Closest Unitary, Orthogonal and Hermitian Operators to a Given Operator
- The Geometry of Algorithms with Orthogonality Constraints
- New Perturbation Bounds for the Unitary Polar Factor
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Procrustes Problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Exact and stable recovery of rotations for robust synchronization
- Lx = b
- A Cheeger Inequality for the Graph Connection Laplacian
- Efficient rounding for the noncommutative grothendieck inequality
- Some Metric Inequalities in the Space of Matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Global Registration of Multiple Point Clouds Using Semidefinite Programming
