{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T05:59:55Z","timestamp":1759384795007,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000105","name":"Office of Cyberinfrastructure","doi-asserted-by":"publisher","award":["OCI-0906379OCI-0904631"],"award-info":[{"award-number":["OCI-0906379OCI-0904631"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["NEUP 120341MAPD DESC000192LLNL B597476Codesign P01180734SciDAC DESC0007446"],"award-info":[{"award-number":["NEUP 120341MAPD DESC000192LLNL B597476Codesign P01180734SciDAC DESC0007446"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2012,8,5]]},"abstract":"<jats:p>A fundamental step in stitching several pictures to form a larger mosaic is the computation of boundary seams that minimize the visual artifacts in the transition between images. Current seam computation algorithms use optimization methods that may be slow, sequential, memory intensive, and prone to finding suboptimal solutions related to local minima of the chosen energy function. Moreover, even when these techniques perform well, their solution may not be perceptually ideal (or even good). Such an inflexible approach does not allow the possibility of user-based improvement. This paper introduces the<jats:italic>Panorama Weaving<\/jats:italic>technique for seam creation and editing in an image mosaic. First,<jats:italic>Panorama Weaving<\/jats:italic>provides a procedure to create boundaries for panoramas that is fast, has low memory requirements and is easy to parallelize. This technique often produces seams with lower energy than the competing global technique. Second, it provides the first interactive technique for the exploration of the seam solution space. This powerful editing capability allows the user to automatically extract energy minimizing seams given a sparse set of constraints. With a variety of empirical results, we show how<jats:italic>Panorama Weaving<\/jats:italic>allows the computation and editing of a wide range of digital panoramas including unstructured configurations.<\/jats:p>","DOI":"10.1145\/2185520.2185579","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T18:11:37Z","timestamp":1344276697000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Panorama weaving"],"prefix":"10.1145","volume":"31","author":[{"given":"Brian","family":"Summa","sequence":"first","affiliation":[{"name":"SCI Institute, University of Utah, ViSUS Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Tierny","sequence":"additional","affiliation":[{"name":"CNRS - Telecom ParisTech (LTCI)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerio","family":"Pascucci","sequence":"additional","affiliation":[{"name":"SCI Institute, University of Utah Pacific Northwest National Laboratory ViSUS Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,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","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073268"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141966"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276495"},{"key":"e_1_2_2_5_1","first-page":"105","article-title":"Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images","author":"Boykov Y. Y.","year":"2001","unstructured":"Boykov , Y. Y. , and Jolly , M. P. 2001 . Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images . In ICCV , I : 105 -- 112 . Boykov, Y. Y., and Jolly, M. P. 2001. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In ICCV, I: 105--112.","journal-title":"ICCV"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Chandran S. L. Francis M. and Sivadasan N. 2006. Geometric representations of graphs in low dimension. Chandran S. L. Francis M. and Sivadasan N. 2006. Geometric representations of graphs in low dimension.","DOI":"10.1007\/11809678_42"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882265"},{"key":"e_1_2_2_10_1","unstructured":"Cormen T. H. Leiserson C. E. and Rivest R. L. 1990. Introduction to Algorithms. MIT Press Cambridge. Cormen T. H. Leiserson C. E. and Rivest R. L. 1990. Introduction to Algorithms . MIT Press Cambridge."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778825"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Davis J. E. 1998. Mosaics of scenes with moving objects. In CVPR 354--360. Davis J. E. 1998. Mosaics of scenes with moving objects. In CVPR 354--360.","DOI":"10.1109\/CVPR.1998.698630"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Delong A. and Boykov Y. 2008. A scalable graph-cut algorithm for N-D grids. In CVPR IEEE Computer Society. Delong A. and Boykov Y. 2008. A scalable graph-cut algorithm for N-D grids. In CVPR IEEE Computer Society.","DOI":"10.1109\/CVPR.2008.4587464"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383296"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.191"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.014"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90120-4"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360620"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1731047.1731052"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276494"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882264"},{"key":"e_1_2_2_24_1","first-page":"377","article-title":"Seamless image stitching in the gradient domain","author":"Levin A.","year":"2004","unstructured":"Levin , A. , Zomet , A. , Peleg , S. , and Weiss , Y. 2004 . Seamless image stitching in the gradient domain . In ECCV , Vol IV : 377 -- 389 . Levin, A., Zomet, A., Peleg, S., and Weiss, Y. 2004. Seamless image stitching in the gradient domain. In ECCV, Vol IV: 377--389.","journal-title":"ECCV"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015719"},{"key":"e_1_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Liu J. and Sun J. 2010. Parallel graph-cuts by adaptive bottom-up merging. In CVPR IEEE 2181--2188. Liu J. and Sun J. 2010. Parallel graph-cuts by adaptive bottom-up merging. In CVPR IEEE 2181--2188.","DOI":"10.1109\/CVPR.2010.5539898"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.13"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224142"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674772"},{"key":"e_1_2_2_30_1","first-page":"806","article-title":"Image segmentation using iterated graph cuts based on multi-scale smoothing","author":"Nagahashi T.","year":"2007","unstructured":"Nagahashi , T. , Fujiyoshi , H. , and Kanade , T. 2007 . Image segmentation using iterated graph cuts based on multi-scale smoothing . In ACCV , II : 806 -- 816 . Nagahashi, T., Fujiyoshi, H., and Kanade, T. 2007. Image segmentation using iterated graph cuts based on multi-scale smoothing. In ACCV, II: 806--816.","journal-title":"ACCV"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.879794"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882269"},{"key":"e_1_2_2_33_1","unstructured":"PTgui 2012. http:\/\/www.ptgui.com. PTgui 2012. http:\/\/www.ptgui.com."},{"key":"e_1_2_2_34_1","unstructured":"Roberts F. 1969. On the boxicity and cubicity of a graph. Recent Progress in Combinatorics. Roberts F. 1969. On the boxicity and cubicity of a graph . Recent Progress in Combinatorics."},{"key":"e_1_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Rosgen B. and Stewart L. 2007. Complexity results on graphs with few cliques. Discrete Mathematics &amp; Theoretical Computer Science 9 1. Rosgen B. and Stewart L. 2007. Complexity results on graphs with few cliques. Discrete Mathematics &amp; Theoretical Computer Science 9 1.","DOI":"10.46298\/dmtcs.387"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015720"},{"key":"e_1_2_2_37_1","unstructured":"Shum H. Y. and Szeliski R. S. 1998. Construction and refinement of panoramic mosaics with global and local alignment. In ICCV 953--956. Shum H. Y. and Szeliski R. S. 1998. Construction and refinement of panoramic mosaics with global and local alignment. In ICCV 953--956."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.486677"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000009"},{"key":"e_1_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Uyttendaele M. T. Eden A. and Szeliski R. S. 2001. Eliminating ghosting and exposure artifacts in image mosaics. II:509--516. Uyttendaele M. T. Eden A. and Szeliski R. S. 2001. Eliminating ghosting and exposure artifacts in image mosaics. II:509--516.","DOI":"10.1109\/CVPR.2001.991005"},{"key":"e_1_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Vineet V. and Narayanan P. J. 2008. CUDA cuts: Fast graph cuts on the GPU. In Computer Vision on GPU 1--8. Vineet V. and Narayanan P. J. 2008. CUDA cuts: Fast graph cuts on the GPU. In Computer Vision on GPU 1--8.","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258859"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.863451"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2185520.2185579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2185520.2185579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:47Z","timestamp":1750241207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2185520.2185579"}},"subtitle":["fast and flexible seam processing"],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8,5]]}},"alternative-id":["10.1145\/2185520.2185579"],"URL":"https:\/\/doi.org\/10.1145\/2185520.2185579","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2012,7]]},"assertion":[{"value":"2012-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}