Learning to solve nonlinear least squares for monocular stereo

9Citations
Citations of this article
180Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 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.

Cite

CITATION STYLE

APA

Clark, R., Bloesch, M., Czarnowski, J., Leutenegger, S., & Davison, A. J. (2018). Learning to solve nonlinear least squares for monocular stereo. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11212 LNCS, pp. 291–306). Springer Verlag. https://doi.org/10.1007/978-3-030-01237-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free