Euclidean Structure from N>=2 Parallel Circles: Theory and Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Euclidean Structure from N>=2 Parallel Circles: Theory and Algorithms

Abstract

Our problem is that of recovering, in one view, the 2D Euclidean structure, induced by the projections of N parallel circles. This structure is a prerequisite for camera calibration and pose computation. Until now, no general method has been described for N > 2. The main contribution of this work is to state the problem in terms of a system of linear equations to solve.We give a closed-form solution as well as bundle adjustment-like refinements, increasing the technical applicability and numerical stability. Our theoretical approach generalizes and extends all those described in existing works for N = 2 in several respects, as we can treat simultaneously pairs of orthogonal lines and pairs of circles within a unified framework. The proposed algorithm may be easily implemented, using well-known numerical algorithms. Its performance is illustrated by simulations and experiments with real images.
Fichier principal
Vignette du fichier
GurdjosSturmYu-eccv2006.pdf (1.04 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00387126 , version 1 (24-05-2009)

Identifiers

  • HAL Id : inria-00387126 , version 1

Cite

Pierre Gurdjos, Peter Sturm, Yihong Wu. Euclidean Structure from N>=2 Parallel Circles: Theory and Algorithms. European Conference on Computer Vision, May 2006, Graz, Austria. pp.238-252. ⟨inria-00387126⟩
477 View
460 Download

Share

Gmail Facebook X LinkedIn More