A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://ardeshp2.web.engr.illinois.edu:80/papers/MultistageSfM.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fnmyhnfycff7tiixnks6dqb6sy" style="color: black;">2014 2nd International Conference on 3D Vision</a>
In this paper, we present a new multistage approach for SfM reconstruction of a single component. Our method begins with building a coarse 3D reconstruction using highscale features of given images. This step uses only a fraction of features and is fast. We enrich the model in stages by localizing remaining images to it and matching and triangulating remaining features. Unlike traditional incremental SfM, localization and triangulation steps in our approach are made efficient and embarrassingly<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/3dv.2014.95">doi:10.1109/3dv.2014.95</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/3dim/ShahDN14.html">dblp:conf/3dim/ShahDN14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kbl2szpkv5aqhfhusxo3cu7h4a">fatcat:kbl2szpkv5aqhfhusxo3cu7h4a</a> </span>
more »... parallel using geometry of the coarse model. The coarse model allows us to use 3D-2D correspondences based direct localization techniques to register remaining images. We further utilize the geometry of the coarse model to reduce the pair-wise image matching effort as well as to perform fast guided feature matching for majority of features. Our method produces similar quality models as compared to incremental SfM methods while being notably fast and parallel. Our algorithm can reconstruct a 1000 images dataset in 15 hours using a single core, in about 2 hours using 8 cores and in a few minutes by utilizing full parallelism of about 200 cores.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170505030623/http://ardeshp2.web.engr.illinois.edu:80/papers/MultistageSfM.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/28/ef/28ef2c3d19460d719f0bbe93cf59335ba4dc60cb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/3dv.2014.95"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>