MENU: Home Bio Affiliations Research Teaching Publications Videos Collaborators/Students Contact FAQ ©2007-14 RSS

Thesis: Drew Steedly PhD (2004): “Rigid Partitioning Techniques for Efficiently Generating 3D Reconstructions from Images”

December 9th, 2004 Irfan Essa Posted in Computational Photography and Video, Drew Steedly, PhD, Thesis No Comments »

Drew Steedly (2004)“Rigid Partitioning Techniques for Efficiently Generating 3D Reconstructions from Images”PhD Thesis, Georgia Institute of Technology, College of Computing. (Advisor: Irfan Essa) [PDF] [URI]

Abstract

This thesis explores efficient techniques for generating 3D reconstructions from imagery. Non-linear optimization is one of the core techniques used when computing a reconstruction and is a computational bottleneck for large sets of images. Since non-linear optimization requires a good initialization to avoid getting stuck in local minima, robust systems for generating reconstructions from images build up the reconstruction incrementally. A hierarchical approach is to split up the images into small subsets, reconstruct each subset independently and then hierarchically merge the subsets. Rigidly locking together portions of the reconstructions reduces the number of parameters needed to represent them when merging, thereby lowering the computational cost of the optimization. We present two techniques that involve optimizing with parts of the reconstruction rigidly locked together. In the first, we start by rigidly grouping the cameras and scene features from each of the reconstructions being merged into separate groups. Cameras and scene features are then incrementally unlocked and optimized until the reconstruction is close to the minimum energy. This technique is most effective when the influence of the new measurements is restricted to a small set of parameters. Measurements that stitch together weakly coupled portions of the reconstruction, though, tend to cause deformations in the low error modes of the reconstruction and cannot be efficiently incorporated with the previous technique. To address this, we present a spectral technique for clustering the tightly coupled portions of a reconstruction into rigid groups. Reconstructions partitioned in this manner can closely mimic the poorly conditioned, low error modes, and therefore efficiently incorporate measurements that stitch together weakly coupled portions of the reconstruction. We explain how this technique can be used to scalably and efficiently generate reconstructions from large sets of images.

AddThis Social Bookmark Button

Paper: ICCV (2003) “Spectral partitioning for structure from motion”

October 13th, 2003 Irfan Essa Posted in Computational Photography and Video, Drew Steedly, Frank Dellaert, PAMI/ICCV/CVPR/ECCV No Comments »

Steedly, D., Essa, I., Dellaert, F. (2003), “Spectral partitioning for structure from motion”, In Proceedings. Ninth IEEE International Conference on Computer Vision, 2003, 13-16 Oct. 2003, page(s): 996 – 1003 vol.2, Nice, France, ISBN: 0-7695-1950-4, INSPEC Accession Number:7971018, Digital Object Identifier: 10.1109/ICCV.2003.1238457, [IEEEXplore#]

Abstract

We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the problem into smaller and better conditioned subproblems which can be efficiently optimized. Our partitioning method uses only the Hessian of the reprojection error and its eigenvector. We show that partitioned systems that preserve the eigenvectors corresponding to small eigenvalues result in lower residual error when optimized. We create partitions by clustering the entries of the eigenvectors of the Hessian corresponding to small eigenvalues. This is a more general technique than relying on domain knowledge and heuristics such as bottom-up structure from motion approaches. Simultaneously, it takes advantage of more information than generic matrix partitioning algorithms.

AddThis Social Bookmark Button

Paper: ICCV (2001) “Propagation of innovative information in non-linear least-squares structure from motion”

July 8th, 2001 Irfan Essa Posted in Computational Photography and Video, Drew Steedly, PAMI/ICCV/CVPR/ECCV No Comments »

Steedly, D. Essa, I. (2001) “Propagation of innovative information in non-linear least-squares structure from motion” In Proceedings. Eighth IEEE International Conference on Computer Vision, 2001. ICCV 2001. 7-14 July 2001, Volume: 2, page(s): 223 – 229 vol.2, 07/07/2001 – 07/14/2001, Vancouver, BC, ISBN: 0-7695-1143-0, INSPEC Accession Number:7024285, DOI: 10.1109/ICCV.2001.937628, [IEEEXplore#]

Abstract

We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates innovative information from new frames into an existing solution without optimizing every camera pose and scene structure parameter. To do this, we incrementally optimize larger subsets of parameters until the error is minimized. These additional parameters are included in the optimization by tracing connections between points and frames. In many cases, the complexity of adding a frame is much smaller than full bundle adjustment of all the parameters. Our algorithm is best described us incremental bundle adjustment as it allows new information to be added to art existing non-linear least-squares solution

AddThis Social Bookmark Button