Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1809.02966 v1 pith:NAVHDTI2 submitted 2018-09-09 cs.CV

classification cs.CV
keywords functionseffectivelylearnedleastls-netmonocularmotionnonlinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 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.

Discussion (0). Continue with ORCID to comment.

Pith tools