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

Summary, in English

We consider the problem of L2-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimizing the L2 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ö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

2008

Språk

Engelska

Sidor

95-98

Dokumenttyp

Konferensbidrag

Ämne

  • Mathematics
  • Computer Vision and Robotics (Autonomous Systems)

Conference name

Swedish Symposium on Image Analysis (SSBA) 2008

Conference date

2008-03-13 - 2008-03-14

Conference place

Lund, Sweden

Status

Published

Forskningsgrupp

  • Mathematical Imaging Group