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.

Triangulating a Plane

Författare

Redaktör

  • Heyden Anders
  • Kahl Fredrik

Summary, in English

In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to these points, we try to minimize the back-projection errors as functions of the plane parameters directly. As this is both geometrically and statistically meaningful our method performs better than the standard two step procedure. Furthermore, we show that the error residuals of this formulation are quasiconvex thereby making it very easy to solve using for example standard local optimization methods.

Publiceringsår

2011

Språk

Engelska

Sidor

13-23

Publikation/Tidskrift/Serie

Lecture Notes in Computer Science (Image Analysis : 17th Scandinavian Conference, SCIA 2011, Ystad, Sweden, May 2011. Proceedings)

Volym

6688

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Vision and Robotics (Autonomous Systems)
  • Mathematics

Nyckelord

  • Triangulation
  • convex optimization
  • computer vision

Conference name

17th Scandinavian Conference on Image Analysis (SCIA 2011)

Conference date

2011-05-23 - 2011-05-27

Conference place

Ystad, Sweden

Status

Published

Forskningsgrupp

  • Mathematical Imaging Group

ISBN/ISSN/Övrigt

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-642-21226-0 (print)
  • ISBN: 978-3-642-21227-7 (online)