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.

Fast Optimal Three View Triangulation

Författare

Redaktör

  • Yasushi Yagi
  • In So Kweon
  • Sing Bing Kang
  • Hongbin Zha

Summary, in English

We consider the problem of $L_2$-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimizing the $L_2$ norm of the reprojection error gives a statistically optimal estimate. This has been solved for two views. However, for three or more views, it is not clear how this should be done. A previously proposed, but computationally impractical, method draws on Gr{"o}bner basis techniques to solve for the complete set of stationary points of the cost function. We show how this method can be modified to become significantly more stable and hence given a fast implementation in standard IEEE double precision. We evaluate the precision and speed of the new method on both synthetic and real data. The algorithm has been implemented in a freely available software package which can be downloaded from the Internet.

Avdelning/ar

Publiceringsår

2007

Språk

Engelska

Sidor

549-559

Publikation/Tidskrift/Serie

Lecture Notes in Computer Science

Volym

4844

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Vision and Robotics (Autonomous Systems)
  • Mathematics

Nyckelord

  • Triangulation
  • Gröbner Basis
  • Optimal

Conference name

Asian Conference on Computer Vision (ACCV 2007), 2007

Conference date

2007-11-18 - 2007-11-22

Conference place

Tokyo, Japan

Status

Published

Forskningsgrupp

  • Mathematical Imaging Group

ISBN/ISSN/Övrigt

  • ISBN: 978-3-540-76389-5