The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Multicore bundle adjustment
Abstract
We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene reconstruction problems. We explore the use of multicore CPU as well as multicore GPUs for this purpose. We show that overcoming the severe memory and bandwidth limitations of current generation GPUs not only leads to more space efficient algorithms, but also to surprising savings in runtime. Our CPU based system is up to ten times and our GPU based system is up to thirty times faster than the current state of the art methods, while maintaining comparable convergence behavior. The code and additional results are available at http://grail.cs.washington.edu/projects/mcba.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
Bundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
(2008) · Choice Reviews Online · doi:10.5860/choice.45-5628 · Cited by 2,725
Agarwal, S., Furukawa, Y., Snavely, N., Simon, I., Curless, B., Seitz, S. M., & Szeliski, R. (2011) · Communications of the ACM · doi:10.1145/2001269.2001293 · Cited by 1,072
Self-citationAgarwal, S., Snavely, N., Simon, I., Seitz, S. M., & Szeliski, R. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459148 · Cited by 1,067
Self-citationImplementing sparse matrix-vector multiplication on throughput-oriented processors
Bell, N., & Garland, M. (2009) · Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis · doi:10.1145/1654059.1654078 · Cited by 900
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Building Rome on a Cloudless Day
Frahm, J.-M., Fite-Georgel, P., Gallup, D., Johnson, T., Raguram, R., Wu, C., Jen, Y.-H., Dunn, E., Clipp, B., Lazebnik, S., et al. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_27 · Cited by 563
Self-citationBundle Adjustment in the Large
Agarwal, S., Snavely, N., Seitz, S. M., & Szeliski, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15552-9_3 · Cited by 462
Self-citationMinimizing development and maintenance costs in supporting persistently optimized BLAS
Whaley, R. C., & Petitet, A. (2005) · Software: Practice and Experience · doi:10.1002/spe.626 · Cited by 254
Pushing the Envelope of Modern Methods for Bundle Adjustment
Jeong, Y., Nistér, D., Steedly, D., Szeliski, R., & Kweon, I.-S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.256 · Cited by 97
Conjugate Gradient Bundle Adjustment
Byröd, M., & Åström, K. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15552-9_9 · Cited by 87
Smith, D. K. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601183 · Cited by 71
Drake, J. B., Worley, P. H., & D'Azevedo, E. F. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1404581 · Cited by 53
Pushing the envelope of modern methods for bundle adjustment
Jeong, Y., Nistér, D., Steedly, D., Szeliski, R., & Kweon, I.-S. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5539795 · Cited by 48
Practical Time Bundle Adjustment for 3D Reconstruction on the GPU
Choudhary, S., Gupta, S., & Narayanan, P. J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35740-4_33 · Cited by 33
Cited by
Structure-from-Motion Revisited
Schonberger, J. L., & Frahm, J.-M. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.445 · Cited by 6,433
Tanks and temples: benchmarking large-scale scene reconstruction
Knapitsch, A., Park, J., Zhou, Q.-Y., & Koltun, V. (2017) · ACM Transactions on Graphics · doi:10.1145/3072959.3073599 · Cited by 1,707
Towards Linear-Time Incremental Structure from Motion
Wu, C. (2013) · 2013 International Conference on 3D Vision · doi:10.1109/3dv.2013.25 · Cited by 1,235
Self-citationImage-Based Localization Using LSTMs for Structured Feature Correlation
Walch, F., Hazirbas, C., Leal-Taixe, L., Sattler, T., Hilsenbeck, S., & Cremers, D. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.75 · Cited by 521
A survey of structure from motion.
Özyeşil, O., Voroninski, V., Basri, R., & Singer, A. (2017) · Acta Numerica · doi:10.1017/s096249291700006x · Cited by 489
Metadata
- Authors
- Wu, C., Agarwal, S., Curless, B., & Seitz, S. M.
- Venue
- CVPR 2011
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 3057-3064
- OpenAlex
- W2001790138
- Cited by
- 807
- References
- 18
- FWCI
- 36.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.