资源分类
》 资源 》论文》On the Solvability of Viewing Graphs

On the Solvability of Viewing Graphs

2019-10-24 | |  41 |   38 |   0
Abstract. A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a “viewing graph”. Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration depends on the structure of this graph. We study characterizations of “solvable” viewing graphs, and present several new results that can be applied to determine which pairs of views may be used to recover all camera parameters. We also discuss strategies for verifying the solvability of a graph computationally

上一篇：Learning to Detect and Track Visible and Occluded Body Joints in a Virtual World

下一篇：Deep Autoencoder for Combined Human Pose Estimation and Body Model Upscaling

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...