Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems

In English

Författare

Summary, in English

Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these problems is a Newton like scheme which uses the: hessian of the function to iteratively find a, local solution. Although fast, this strategy inevitably leeds to issues with poor local minima, and missed global minima. In this paper rather than trying to develop all algorithm that is guaranteed to always work, we show that it is often possible to verify that a local solution is in fact; also global. We present a simple test that verifies optimality of a solution using only a few linear programs. We show oil both synthetic and real data that for the vast majority of cases we are able to verify optimality. Further more we show even if the above test fails it is still often possible to verify that the local solution is global with high probability.

Avdelning/ar

Publiceringsår

2009

Språk

Engelska

Sidor

686-695

Publikation/Tidskrift/Serie

Image Analysis, Proceedings

Volym

5575

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Mathematics

Conference name

16th Scandinavian Conference on Image Analysis

Conference date

2009-06-15 - 2009-06-18

Conference place

Oslo, Norway

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1611-3349
  • ISSN: 0302-9743