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.

Local Refinement for Stereo Regularization

In English

Författare

Summary, in English

Stereo matching is an inherently difficult problem due to ambiguous and noisy texture. The non-convexity and non- differentiability makes local linear (or quadratic) approximations poor, thereby preventing the use of standard local descent methods. Therefore recent methods are predominantly based on discretization and/or random sampling of some class of approximating surfaces (e.g. planes). While these methods are very efficient in generating a rough surface estimate, via either fusion of proposals or label propagation, the end result is usually not as smooth as desired. In this paper we show that, if the objective function is decomposed correctly, local refinement of candidate solutions can be performed using an ADMM approach. This allows searching over more general function classes, thereby resulting in visually more appealing smooth surface estimations.

Publiceringsår

2014

Språk

Engelska

Sidor

4056-4061

Publikation/Tidskrift/Serie

Pattern Recognition (ICPR), 2014 22nd International Conference on

Dokumenttyp

Konferensbidrag

Förlag

IEE

Ämne

  • Mathematics
  • Computer Vision and Robotics (Autonomous Systems)

Conference name

22nd International Conference on Pattern Recognition (ICPR 2014)

Conference date

2014-08-24 - 2014-08-28

Conference place

Stockholm, Sweden

Status

Published

Forskningsgrupp

  • Mathematical Imaging Group

ISBN/ISSN/Övrigt

  • ISSN: 1051-4651