Divide and Conquer: Efficient Large-Scale Structure from Motion Using Graph Partitioning
نویسندگان
چکیده
Despite significant advances in recent years, structure-frommotion (SfM) pipelines suffer from two important drawbacks. Apart from requiring significant computational power to solve the large-scale computations involved, such pipelines sometimes fail to correctly reconstruct when the accumulated error in incremental reconstruction is large or when the number of 3D to 2D correspondences are insufficient. In this paper we present a novel approach to mitigate the above-mentioned drawbacks. Using an image match graph based on matching features we partition the image data set into smaller sets or components which are reconstructed independently. Following such reconstructions we utilise the available epipolar relationships that connect images across components to correctly align the individual reconstructions in a global frame of reference. This results in both a significant speed up of at least one order of magnitude and also mitigates the problems of reconstruction failures with a marginal loss in accuracy. The effectiveness of our approach is demonstrated on some large-scale real world data sets.
منابع مشابه
Divide and conquer partitioning techniques for smart water networks
Inserting remote control valves in a water distribution system allows the implementation of the “divide and conquer” paradigm that consists in dividing a large network into smaller subsystems, also called water network partitioning (WNP), for applying water balance, pressure control and water quality protection. Some heuristic procedures, based on different techniques (graph theory, clustering,...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملA Divide and Conquer Framework for Distributed Graph Clustering
Graph clustering is about identifying clusters of closely connected nodes, and is a fundamental technique of data analysis with many applications including community detection, VLSI network partitioning, collaborative filtering, etc. In order to improve the scalability of existing graph clustering algorithms, we propose a novel divide and conquer framework for graph clustering, and establish th...
متن کاملClustering in WSN Based on Minimum Spanning Tree Using Divide and Conquer Approach
Due to heavy energy constraints in WSNs clustering is an efficient way to manage the energy in sensors. There are many methods already proposed in the area of clustering and research is still going on to make clustering more energy efficient. In our paper we are proposing a minimum spanning tree based clustering using divide and conquer approach. The MST based clustering was first proposed in 1...
متن کاملHypersfm I. . Introduction
We propose a novel algorithm that solves the Structure from Motion problem in a divide and conquer manner by exploiting its bipartite graph structure. Recursive partitioning has a rich history, stemming from sparse linear algebra and finite element methods, and are also appealing for solving large-scale SfM problems. However, an important and less explored question is how to generate good parti...
متن کامل