{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:20:56Z","timestamp":1774599656962,"version":"3.50.1"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2005,7]]},"abstract":"<jats:p>\n            This paper describes a mostly automatic method for taking the output of a single panning video camera and creating a\n            <jats:italic>panoramic video texture<\/jats:italic>\n            (PVT): a video that has been stitched into a single, wide field of view and that appears to play continuously and indefinitely. The key problem in creating a PVT is that although only a portion of the scene has been imaged at any given time, the output must simultaneously portray motion throughout the scene. Like previous work in video textures, our method employs min-cut optimization to select fragments of video that can be stitched together both spatially and temporally. However, it differs from earlier work in that the optimization must take place over a much larger set of data. Thus, to create PVTs, we introduce a dynamic programming step, followed by a novel hierarchical min-cut optimization algorithm. We also use gradient-domain compositing to further smooth boundaries between video fragments. We demonstrate our results with an interactive viewer in which users can interactively pan and zoom on high-resolution PVTs.\n          <\/jats:p>","DOI":"10.1145\/1073204.1073268","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"821-827","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":99,"title":["Panoramic video textures"],"prefix":"10.1145","volume":"24","author":[{"given":"Aseem","family":"Agarwala","sequence":"first","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke Colin","family":"Zheng","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Pal","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maneesh","family":"Agrawala","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Cohen","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Curless","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Salesin","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Szeliski","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015718"},{"key":"e_1_2_2_2_1","volume-title":"European Conference on Computer Vision, 237--252","author":"Bergen J. R.","unstructured":"Bergen , J. R. , Anandan , P. , Hanna , K. J. , and Hingorani , R . 1992. Hierarchical model-based motion estimation . In European Conference on Computer Vision, 237--252 .]] Bergen, J. R., Anandan, P., Hanna, K. J., and Hingorani, R. 1992. Hierarchical model-based motion estimation. In European Conference on Computer Vision, 237--252.]]"},{"key":"e_1_2_2_3_1","first-page":"1218","article-title":"Recognising panoramas","volume":"03","author":"Brown M.","year":"2003","unstructured":"Brown , M. , and Lowe , D. 2003 . Recognising panoramas . In Proceedings of ICCV 03 , 1218 -- 1225 .]] Brown, M., and Lowe, D. 2003. Recognising panoramas. In Proceedings of ICCV 03, 1218--1225.]]","journal-title":"Proceedings of ICCV"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218395"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237266"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937584"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026501619075"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.664279"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/500141.500192"},{"key":"e_1_2_2_10_1","volume-title":"European Conference on Computer Vision (ECCV), 65--81","author":"Kolmogorov V.","unstructured":"Kolmogorov , V. , and Zabih , R . 2002. What energy functions can be minimized via graph cuts? In European Conference on Computer Vision (ECCV), 65--81 .]] Kolmogorov, V., and Zabih, R. 2002. What energy functions can be minimized via graph cuts? In European Conference on Computer Vision (ECCV), 65--81.]]"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882264"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/794189.794460"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/354384.376408"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882269"},{"key":"e_1_2_2_15_1","unstructured":"Point Grey Research 2005. http:\/\/ptgrey.com.]]  Point Grey Research 2005. http:\/\/ptgrey.com.]]"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.137"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.345012"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258861"},{"key":"e_1_2_2_19_1","volume-title":"ICCV '99: Proceedings of the International Workshop on Vision Algorithms, Springer-Verlag, 298--372","author":"Triggs B.","unstructured":"Triggs , B. , Mclauchlan , P. F. , Hartley , R. I. , and Fitzgibbon , A. W . 2000. Bundle adjustment - a modern synthesis . In ICCV '99: Proceedings of the International Workshop on Vision Algorithms, Springer-Verlag, 298--372 .]] Triggs, B., Mclauchlan, P. F., Hartley, R. I., and Fitzgibbon, A. W. 2000. Bundle adjustment - a modern synthesis. In ICCV '99: Proceedings of the International Workshop on Vision Algorithms, Springer-Verlag, 298--372.]]"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2004.1297011"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018429.1021105"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073204.1073268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T13:55:32Z","timestamp":1693835732000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073204.1073268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["10.1145\/1073204.1073268"],"URL":"https:\/\/doi.org\/10.1145\/1073204.1073268","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]},"assertion":[{"value":"2005-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}