Stable camera motion estimation using convex programming
From MaRDI portal
Abstract: We study the inverse problem of estimating n locations (up to global scale, translation and negation) in from noisy measurements of a subset of the (unsigned) pairwise lines that connect them, that is, from noisy measurements of for some pairs (i,j) (where the signs are unknown). This problem is at the core of the structure from motion (SfM) problem in computer vision, where the 's represent camera locations in . The noiseless version of the problem, with exact line measurements, has been considered previously under the general title of parallel rigidity theory, mainly in order to characterize the conditions for unique realization of locations. For noisy pairwise line measurements, current methods tend to produce spurious solutions that are clustered around a few locations. This sensitivity of the location estimates is a well-known problem in SfM, especially for large, irregular collections of images. In this paper we introduce a semidefinite programming (SDP) formulation, specially tailored to overcome the clustering phenomenon. We further identify the implications of parallel rigidity theory for the location estimation problem to be well-posed, and prove exact (in the noiseless case) and stable location recovery results. We also formulate an alternating direction method to solve the resulting semidefinite program, and provide a distributed version of our formulation for large numbers of locations. Specifically for the camera location estimation problem, we formulate a pairwise line estimation method based on robust camera orientation and subspace estimation. Lastly, we demonstrate the utility of our algorithm through experiments on real images.
Recommendations
- Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences
- Global registration of multiple point clouds using semidefinite programming
- Computer Vision - ECCV 2004
- Optimization criteria and geometric algorithms for motion and structure estimation
- Exact camera location recovery by least unsquared deviations
Cites work
- scientific article; zbMATH DE number 1229396 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- A distribution-free M-estimator of multivariate scatter
- A matroid on hypergraphs, with applications in scene analysis and geometry
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Computer Vision - ECCV 2004
- Conditions for Unique Graph Realizations
- Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
- Exact and stable recovery of rotations for robust synchronization
- Exact matrix completion via convex optimization
- Global registration of multiple point clouds using semidefinite programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- LAPACK Users' Guide
- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
- On affine rigidity
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Robust PCA via Outlier Pursuit
- Robust computation of linear models by convex relaxation
- Robust principal component analysis?
- Semidefinite Programming
- Solving semidefinite-quadratic-linear programs using SDPT3
- Spectra of graphs
- Spectral Properties of the Alignment Matrices in Manifold Learning
- Stable camera motion estimation using convex programming
- The Molecule Problem: Exploiting Structure in Global Optimization
- Theory of semidefinite programming for sensor network localization
Cited in
(14)- Spectral synchronization of multiple views in \(\mathrm{SE}(3)\)
- Global registration of multiple point clouds using semidefinite programming
- Exact camera location recovery by least unsquared deviations
- Hardness results for structured linear systems
- Robust group synchronization via cycle-edge message passing
- Geometric interpretations of compatibility for fundamental matrices
- Computer Vision - ECCV 2004
- Synchronization over Cartan motion groups via contraction
- Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences
- Stable camera motion estimation using convex programming
- Camera Motion Parameter Estimation Technique Using 2D Homography and LM Method Based on Projective and Permutation Invariant Features
- ShapeFit: exact location recovery from corrupted pairwise directions
- A survey of structure from motion
- Feature‐based recursive observer design for homography estimation and its application to image stabilization
This page was built for publication: Stable camera motion estimation using convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192651)
