LS-Net: Learning to Solve Nonlinear Least Squares for Monocular Stereo

09/09/2018
by   Ronald Clark, et al.
3

Sum-of-squares objective functions are very popular in computer vision algorithms. However, these objective functions are not always easy to optimize. The underlying assumptions made by solvers are often not satisfied and many problems are inherently ill-posed. In this paper, we propose LS-Net, a neural nonlinear least squares optimization algorithm which learns to effectively optimize these cost functions even in the presence of adversities. Unlike traditional approaches, the proposed solver requires no hand-crafted regularizers or priors as these are implicitly learned from the data. We apply our method to the problem of motion stereo ie. jointly estimating the motion and scene geometry from pairs of images of a monocular sequence. We show that our learned optimizer is able to efficiently and effectively solve this challenging optimization problem.

READ FULL TEXT

page 3

page 11

page 12

research
01/08/2021

Nonlinear Optimization in R using nlopt

In this article, we present a problem of nonlinear constraint optimizati...
research
05/24/2019

Neuro-Optimization: Learning Objective Functions Using Neural Networks

Mathematical optimization is widely used in various research fields. Wit...
research
12/02/2022

Transformer-Based Learned Optimization

In this paper, we propose a new approach to learned optimization. As com...
research
04/10/2019

Least Squares Auto-Tuning

Least squares is by far the simplest and most commonly applied computati...
research
04/22/2016

Opt: A Domain Specific Language for Non-linear Least Squares Optimization in Graphics and Imaging

Many graphics and vision problems can be expressed as non-linear least s...
research
05/03/2014

Supervised Descent Method for Solving Nonlinear Least Squares Problems in Computer Vision

Many computer vision problems (e.g., camera calibration, image alignment...

Please sign up or login with your details

Forgot password? Click here to reset