Graph-Based Parallel Large Scale Structure from Motion

12/23/2019
by   Yu Chen, et al.
27

While Structure from Motion (SfM) achieves great success in 3D reconstruction, it still meets challenges on large scale scenes. In this work, large scale SfM is deemed as a graph problem, and we tackle it in a divide-and-conquer manner. Firstly, the images clustering algorithm divides images into clusters with strong connectivity, leading to robust local reconstructions. Then followed with an image expansion step, the connection and completeness of scenes are enhanced by expanding along with a maximum spanning tree. After local reconstructions, we construct a minimum spanning tree (MinST) to find accurate similarity transformations. Then the MinST is transformed into a Minimum Height Tree (MHT) to find a proper anchor node and is further utilized to prevent error accumulation. When evaluated on different kinds of datasets, our approach shows superiority over the state-of-the-art in accuracy and efficiency. Our algorithm is open-sourced at https://github.com/AIBluefisher/GraphSfM.

READ FULL TEXT

page 9

page 10

research
03/02/2023

GBMST: An Efficient Minimum Spanning Tree Clustering Based on Granular-Ball Computing

Most of the existing clustering methods are based on a single granularit...
research
01/28/2023

AdaSfM: From Coarse Global to Fine Incremental Adaptive Structure from Motion

Despite the impressive results achieved by many existing Structure from ...
research
12/21/2016

Trilaminar Multiway Reconstruction Tree for Efficient Large Scale Structure from Motion

Accuracy and efficiency are two key problems in large scale incremental ...
research
08/03/2017

A Unified View-Graph Selection Framework for Structure from Motion

View-graph is an essential input to large-scale structure from motion (S...
research
04/02/2021

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

This paper presents new parallel algorithms for generating Euclidean min...
research
01/19/2018

Minimum spanning tree release under differential privacy constraints

We investigate the problem of nodes clustering under privacy constraints...
research
05/09/2017

Efficient Structure from Motion for Oblique UAV Images Based on Maximal Spanning Tree Expansions

The primary contribution of this paper is an efficient Structure from Mo...

Please sign up or login with your details

Forgot password? Click here to reset