A Closed-Form Solution to Local Non-Rigid Structure-from-Motion
- URL: http://arxiv.org/abs/2011.11567v2
- Date: Tue, 13 Jul 2021 12:59:01 GMT
- Title: A Closed-Form Solution to Local Non-Rigid Structure-from-Motion
- Authors: Shaifali Parashar, Yuxuan Long, Mathieu Salzmann and Pascal Fua
- Abstract summary: We show that, under widely applicable assumptions, we can derive a new system of equation in terms of the surface normals.
Our reconstructions, obtained from two or more views, are significantly more accurate than those of state-of-the-art methods.
- Score: 107.60023055615302
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A recent trend in Non-Rigid Structure-from-Motion (NRSfM) is to express
local, differential constraints between pairs of images, from which the surface
normal at any point can be obtained by solving a system of polynomial
equations. The systems of equations derived in previous work, however, are of
high degree, having up to five real solutions, thus requiring a computationally
expensive strategy to select a unique solution. Furthermore, they suffer from
degeneracies that make the resulting estimates unreliable, without any
mechanism to identify this situation.
In this paper, we show that, under widely applicable assumptions, we can
derive a new system of equation in terms of the surface normals whose two
solutions can be obtained in closed-form and can easily be disambiguated
locally. Our formalism further allows us to assess how reliable the estimated
local normals are and, hence, to discard them if they are not. Our experiments
show that our reconstructions, obtained from two or more views, are
significantly more accurate than those of state-of-the-art methods, while also
being faster.
Related papers
- Augmented neural forms with parametric boundary-matching operators for solving ordinary differential equations [0.0]
This paper introduces a formalism for systematically crafting proper neural forms with boundary matches that are amenable to optimization.
It describes a novel technique for converting problems with Neumann or Robin conditions into equivalent problems with parametric Dirichlet conditions.
The proposed augmented neural forms approach was tested on a set of diverse problems, encompassing first- and second-order ordinary differential equations, as well as first-order systems.
arXiv Detail & Related papers (2024-04-30T11:10:34Z) - Efficient Alternating Minimization Solvers for Wyner Multi-View
Unsupervised Learning [0.0]
We propose two novel formulations that enable the development of computational efficient solvers based the alternating principle.
The proposed solvers offer computational efficiency, theoretical convergence guarantees, local minima complexity with the number of views, and exceptional accuracy as compared with the state-of-the-art techniques.
arXiv Detail & Related papers (2023-03-28T10:17:51Z) - D-CIPHER: Discovery of Closed-form Partial Differential Equations [80.46395274587098]
We propose D-CIPHER, which is robust to measurement artifacts and can uncover a new and very general class of differential equations.
We further design a novel optimization procedure, CoLLie, to help D-CIPHER search through this class efficiently.
arXiv Detail & Related papers (2022-06-21T17:59:20Z) - Message Passing Neural PDE Solvers [60.77761603258397]
We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators.
We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes.
We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
arXiv Detail & Related papers (2022-02-07T17:47:46Z) - Semi-Implicit Neural Solver for Time-dependent Partial Differential
Equations [4.246966726709308]
We propose a neural solver to learn an optimal iterative scheme in a data-driven fashion for any class of PDEs.
We provide theoretical guarantees for the correctness and convergence of neural solvers analogous to conventional iterative solvers.
arXiv Detail & Related papers (2021-09-03T12:03:10Z) - Characterizing possible failure modes in physics-informed neural
networks [55.83255669840384]
Recent work in scientific machine learning has developed so-called physics-informed neural network (PINN) models.
We demonstrate that, while existing PINN methodologies can learn good models for relatively trivial problems, they can easily fail to learn relevant physical phenomena even for simple PDEs.
We show that these possible failure modes are not due to the lack of expressivity in the NN architecture, but that the PINN's setup makes the loss landscape very hard to optimize.
arXiv Detail & Related papers (2021-09-02T16:06:45Z) - Dimension Free Generalization Bounds for Non Linear Metric Learning [61.193693608166114]
We provide uniform generalization bounds for two regimes -- the sparse regime, and a non-sparse regime.
We show that by relying on a different, new property of the solutions, it is still possible to provide dimension free generalization guarantees.
arXiv Detail & Related papers (2021-02-07T14:47:00Z) - Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space.
We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
arXiv Detail & Related papers (2020-12-09T20:19:32Z) - Robust Finite-State Controllers for Uncertain POMDPs [25.377873201375515]
Uncertain partially observable decision processes (uPOMDPs) allow the probabilistic transition observation functions of standard POMDPs to belong to an uncertainty set.
We develop an algorithm to compute finite-memory policies for uPOMDPs.
arXiv Detail & Related papers (2020-09-24T02:58:50Z) - Non-Convex Exact Community Recovery in Stochastic Block Model [31.221745716673546]
Community detection in graphs that are generated according to symmetric block models (SBMs) has received much attention lately.
We show that in the logarithmic sparsity regime of the problem, with high probability the proposed two-stage method can exactly recover the two communities down to the information-theoretic limit in $mathcalO(nlog2n/loglog n)$ time.
We also conduct numerical experiments on both synthetic and real data sets to demonstrate the efficacy of our proposed method and complement our theoretical development.
arXiv Detail & Related papers (2020-06-29T07:03:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.