The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Skeletal graphs for efficient structure from motion
Abstract
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-sharing sites. Our approach computes a small skeletal subset of images, reconstructs the skeletal set, and adds the remaining images using pose estimation. Our technique drastically reduces the number of parameters that are considered, resulting in dramatic speedups, while provably approximating the covariance of the full set of parameters. To compute a skeletal image set, we first estimate the accuracy of two-frame reconstructions between pairs of overlapping images, then use a graph algorithm to select a subset of images that, when reconstructed, approximates the accuracy of the full set. A final bundle adjustment can then optionally be used to restore any loss of accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
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
Photo tourism: exploring photo collections in 3D
Snavely, N., Seitz, S. M., & Szeliski, R. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141964 · Cited by 2,866
Self-citationAn efficient solution to the five-point relative pose problem
Nister, D. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.17 · Cited by 2,009
Closed-form solution of absolute orientation using orthonormal matrices
Horn, B. K. P., Hilden, H. M., & Negahdaripour, S. (1988) · Journal of the Optical Society of America A · doi:10.1364/josaa.5.001127 · Cited by 1,151
Heyden, A., & Pollefeys, M. (2005) · Malmö University Publications (Malmö University) · Cited by 1,137
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval
Chum, O., Philbin, J., Sivic, J., Isard, M., & Zisserman, A. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408891 · Cited by 859
Photo tourism: exploring photo collections in 3D
Snavely, N., Seitz, S. M., & Szeliski, R. (2006) · ACM SIGGRAPH 2006 Papers on - SIGGRAPH '06 · doi:10.1145/1179352.1141964 · Cited by 696
Self-citationMulti-view Matching for Unordered Image Sets, or “How Do I Organize My Holiday Snaps?”
Schaffalitzky, F., & Zisserman, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_28 · Cited by 533
Cited by
ORB: An efficient alternative to SIFT or SURF
Rublee, E., Rabaud, V., Konolige, K., & Bradski, G. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126544 · Cited by 11,037
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
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
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-citationBuilding 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
Bundle 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-citationGlobal Fusion of Relative Motions for Robust, Accurate and Scalable Structure from Motion
Moulon, P., Monasse, P., & Marlet, R. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.403 · Cited by 373
Discrete-continuous optimization for large-scale structure from motion
Crandall, D., Owens, A., Snavely, N., & Huttenlocher, D. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995626 · Cited by 308
Self-citationModeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
Li, X., Wu, C., Zach, C., Lazebnik, S., & Frahm, J.-M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88682-2_33 · Cited by 294
High Accuracy and Visibility-Consistent Dense Multiview Stereo
Vu, H.-H., Labatut, P., Pons, J.-P., & Keriven, R. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.172 · Cited by 284
Furukawa, Y., & Hernández, C. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781601988379 · Cited by 268
Dimitrov, A., & Golparvar-Fard, M. (2014) · Advanced Engineering Informatics · doi:10.1016/j.aei.2013.11.002 · Cited by 261
Efficient information-theoretic graph pruning for graph-based SLAM with laser range finders
Kretzschmar, H., Stachniss, C., & Grisetti, G. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6094414 · Cited by 48
“In the vision community, Snavely et al. [15] aim to find a skeletal subgraph with the minimum number of interior nodes that spans the full graph while achieving a bound on the full covariance.”
Background
Metadata
- Authors
- Snavely, N., Seitz, S. M., & Szeliski, R.
- Venue
- 2008 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2109757902
- Cited by
- 271
- References
- 23
- FWCI
- 15.49
- 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.