资源论文Euclidean Structure from N ≥ 2 Parallel Circles: Theory and Algorithms

Euclidean Structure from N ≥ 2 Parallel Circles: Theory and Algorithms

2020-03-27 | |  65 |   39 |   0

Abstract

Our problem is that of recovering, in one view, the 2D Eu- clidean structure, induced by the pro jections 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.

上一篇:From Tensor-Driven Diffusion to Anisotropic Wavelet Shrinkage

下一篇:Example Based Non-rigid Shape Detection

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...