Pages that link to "Item:Q5252586"
From MaRDI portal
The following pages link to Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586):
Displaying 15 items.
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- Surface fitting and registration of point clouds using approximations of the unsigned distance function (Q631004) (← links)
- On the tightness of semidefinite relaxations for rotation estimation (Q2127273) (← links)
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
- The geometry of synchronization problems and learning group actions (Q2223632) (← links)
- Distributed methods for synchronization of orthogonal matrices over graphs (Q2407194) (← links)
- Stable Camera Motion Estimation Using Convex Programming (Q3192651) (← links)
- Simultaneous Registration of Multiple Corresponding Point Sets (Q4800584) (← links)
- Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics (Q5025782) (← links)
- Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
- Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance (Q5364201) (← links)
- Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions (Q5867627) (← links)
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization (Q6166053) (← links)
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
