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.

Triangulation of Points, Lines and Conics

In English

Författare

  • Klas Josephson
  • Fredrik Kahl

Summary, in English

The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most basic geometric problems in computer vision and photogrammetry. Yet, previous methods fail to guarantee optimal reconstructions—they are either plagued by local minima or rely on a non-optimal cost-function. A common framework for the triangulation problem of points, lines and conics is presented. We define what is meant by an optimal triangulation based on statistical principles and then derive an algorithm for computing the globally optimal solution. The method for achieving the global minimum is based on convex and concave relaxations for both fractionals and monomials. The performance of the method is evaluated on real image data.

Avdelning/ar

Publiceringsår

2008

Språk

Engelska

Sidor

215-225

Publikation/Tidskrift/Serie

Journal of Mathematical Imaging and Vision

Volym

32

Issue

2

Dokumenttyp

Artikel i tidskrift

Förlag

Springer

Ämne

  • Computer Vision and Robotics (Autonomous Systems)
  • Mathematics

Nyckelord

  • Triangulation
  • Global optimization
  • RATIOS PROBLEM
  • SUM

Status

Published

Forskningsgrupp

  • Mathematical Imaging Group

ISBN/ISSN/Övrigt

  • ISSN: 0924-9907