The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Triangulating a Plane

På svenska

Author

Editor

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

Publishing year

2011

Language

English

Pages

13-23

Publication/Series

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

Volume

6688

Document type

Conference paper

Publisher

Springer

Topic

  • Computer Vision and Robotics (Autonomous Systems)
  • Mathematics

Keywords

  • 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

Research group

  • Mathematical Imaging Group

ISBN/ISSN/Other

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