• DocumentCode
    3748532
  • Title

    Optimizing the Viewing Graph for Structure-from-Motion

  • Author

    Chris Sweeney;Torsten Sattler; H?llerer;Matthew Turk;Marc Pollefeys

  • Author_Institution
    Univ. of California, Santa Barbara, Santa Barbara, CA, USA
  • fYear
    2015
  • Firstpage
    801
  • Lastpage
    809
  • Abstract
    The viewing graph represents a set of views that are related by pairwise relative geometries. In the context of Structure-from-Motion (SfM), the viewing graph is the input to the incremental or global estimation pipeline. Much effort has been put towards developing robust algorithms to overcome potentially inaccurate relative geometries in the viewing graph during SfM. In this paper, we take a fundamentally different approach to SfM and instead focus on improving the quality of the viewing graph before applying SfM. Our main contribution is a novel optimization that improves the quality of the relative geometries in the viewing graph by enforcing loop consistency constraints with the epipolar point transfer. We show that this optimization greatly improves the accuracy of relative poses in the viewing graph and removes the need for filtering steps or robust algorithms typically used in global SfM methods. In addition, the optimized viewing graph can be used to efficiently calibrate cameras at scale. We combine our viewing graph optimization and focal length calibration into a global SfM pipeline that is more efficient than existing approaches. To our knowledge, ours is the first global SfM pipeline capable of handling uncalibrated image sets.
  • Keywords
    "Geometry","Image reconstruction","Cameras","Optimization","Pipelines","Image edge detection","Matrix decomposition"
  • Publisher
    ieee
  • Conference_Titel
    Computer Vision (ICCV), 2015 IEEE International Conference on
  • Electronic_ISBN
    2380-7504
  • Type

    conf

  • DOI
    10.1109/ICCV.2015.98
  • Filename
    7410455