{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T07:14:12Z","timestamp":1784272452287,"version":"3.55.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0811878"],"award-info":[{"award-number":["IIS-0811878"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>We present a system that can reconstruct 3D geometry from large, unorganized collections of photographs such as those found by searching for a given city (e.g., Rome) on Internet photo-sharing sites. Our system is built on a set of new, distributed computer vision algorithms for image matching and 3D reconstruction, designed to maximize parallelism at each stage of the pipeline and to scale gracefully with both the size of the problem and the amount of available computation. Our experimental results demonstrate that it is now possible to reconstruct city-scale image collections with more than a hundred thousand images in less than a day.<\/jats:p>","DOI":"10.1145\/2001269.2001293","type":"journal-article","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T15:12:48Z","timestamp":1316790768000},"page":"105-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":842,"title":["Building Rome in a day"],"prefix":"10.1145","volume":"54","author":[{"given":"Sameer","family":"Agarwal","sequence":"first","affiliation":[{"name":"Google Inc., Seattle, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yasutaka","family":"Furukawa","sequence":"additional","affiliation":[{"name":"Google Inc., Seattle, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noah","family":"Snavely","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian","family":"Simon","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian","family":"Curless","sequence":"additional","affiliation":[{"name":"University of Washington, Washington, Seattle, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven M.","family":"Seitz","sequence":"additional","affiliation":[{"name":"Google Inc. &amp; University of Washington, Washington, Seattle, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Szeliski","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,10]]},"reference":[{"key":"e_1_2_1_1_1","series-title":"Lecture Notes in Computer Science (2010)","volume-title":"ECCV (2)","author":"Agarwal S.","unstructured":"Agarwal , S. , Snavely , N. , Seitz , S.M. , Szeliski , R. Bundle adjustment in the large . In ECCV (2) , volume 6312 of Lecture Notes in Computer Science (2010) . K. Daniilidis, P. Maragos, and N. Paragios, eds. Springer , Berlin, Germany, 29--42. Agarwal, S., Snavely, N., Seitz, S.M., Szeliski, R. Bundle adjustment in the large. In ECCV (2), volume 6312 of Lecture Notes in Computer Science (2010). K. Daniilidis, P. Maragos, and N. Paragios, eds. Springer, Berlin, Germany, 29--42."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020141505696"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408891"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"e_1_2_1_7_1","series-title":"Lecture Notes in Computer Science (2010)","volume-title":"ECCV (4)","author":"Frahm J.-M.","unstructured":"Frahm , J.-M. , Georgel , P.F. , Gallup , D. , Johnson , T. , Raguram , R. , Wu , C. , Jen , Y.-H. , Dunn , E. , Clipp , B. , Lazebnik , S. Building Rome on a cloudless day . In ECCV (4) , volume 6314 of Lecture Notes in Computer Science (2010) . K. Daniilidis, P. Maragos, and N. Paragios, eds. Springer , Berlin, Germany, 368--381. Frahm, J.-M., Georgel, P.F., Gallup, D., Johnson, T., Raguram, R., Wu, C., Jen, Y.-H., Dunn, E., Clipp, B., Lazebnik, S. Building Rome on a cloudless day. In ECCV (4), volume 6314 of Lecture Notes in Computer Science (2010). K. Daniilidis, P. Maragos, and N. Paragios, eds. Springer, Berlin, Germany, 368--381."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000027787.82851.b6"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539802"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/861369"},{"key":"e_1_2_1_11_1","first-page":"5","article-title":"A statistical interpretation of term specificity and its application in retrieval","volume":"60","author":"Jones K","year":"2004","unstructured":"Jones , K . A statistical interpretation of term specificity and its application in retrieval . J. Doc. 60 , 5 ( 2004 ), 493--502. Jones, K. A statistical interpretation of term specificity and its application in retrieval. J. Doc. 60, 5 (2004), 493--502.","journal-title":"J. Doc."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0086-4"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383150"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946751"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141964"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587678"},{"key":"e_1_2_1_20_1","volume-title":"Vision Algorithms '99","author":"Triggs B.","year":"1999","unstructured":"Triggs , B. , McLauchlan , P. , Hartley , R.I. , Fitzgibbon , A. Bundle adjustment---A modern synthesis . In Vision Algorithms '99 ( 1999 ), 298--372. Triggs, B., McLauchlan, P., Hartley, R.I., Fitzgibbon, A. Bundle adjustment---A modern synthesis. In Vision Algorithms '99 (1999), 298--372."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88693-8_64"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001269.2001293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2001269.2001293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:53Z","timestamp":1750244393000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001269.2001293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":21,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2001269.2001293"],"URL":"https:\/\/doi.org\/10.1145\/2001269.2001293","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2011-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}