Skip to main navigation Skip to search Skip to main content

Large-scale bundle adjustment by parameter vector partition

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We propose an efficient parallel bundle adjustment (BA) algorithm to refine 3D reconstruction of the large-scale structure from motion (SfM) problem, which uses image collections from Internet. Different from the latest BA techniques that improve efficiency by optimizing the reprojection error function with Conjugate Gradient (CG) methods, we employ the parameter vector partition strategy. More specifically, we partition the whole BA parameter vector into a set of individual sub-vectors via normalized cut (Ncut). Correspondingly, the solution of the BA problem can be obtained by minimizing subproblems on these sub-vector spaces. Our approach is approximately parallel, and there is no need to solve the large-scale linear equation of the BA problem. Experiments carried out on a low-end computer with 4GB RAM demonstrate the efficiency and accuracy of the proposed algorithm.

Original languageEnglish
Title of host publicationComputer Vision, ACCV 2012 - 11th Asian Conference on Computer Vision, Revised Selected Papers
Pages26-39
Number of pages14
EditionPART 4
DOIs
StatePublished - 2012
Event11th Asian Conference on Computer Vision, ACCV 2012 - Daejeon, Korea, Republic of
Duration: 5 Nov 20129 Nov 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 4
Volume7727 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Asian Conference on Computer Vision, ACCV 2012
Country/TerritoryKorea, Republic of
CityDaejeon
Period5/11/129/11/12

Fingerprint

Dive into the research topics of 'Large-scale bundle adjustment by parameter vector partition'. Together they form a unique fingerprint.

Cite this