{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:20:56Z","timestamp":1778592056977,"version":"3.51.4"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:00:00Z","timestamp":1185667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2007,7,29]]},"abstract":"<jats:p>\n            We describe a hierarchical approach to improving the efficiency of\n            <jats:italic>gradient-domain compositing<\/jats:italic>\n            , a technique that constructs seamless composites by combining the gradients of images into a vector field that is then integrated to form a composite. While gradient-domain compositing is powerful and widely used, it suffers from poor scalability. Computing an\n            <jats:italic>n<\/jats:italic>\n            pixel composite requires solving a linear system with\n            <jats:italic>n<\/jats:italic>\n            variables; solving such a large system quickly overwhelms the main memory of a standard computer when performed for multi-megapixel composites, which are common in practice. In this paper we show how to perform gradient-domain compositing approximately by solving an\n            <jats:italic>O(p)<\/jats:italic>\n            linear system, where\n            <jats:italic>p<\/jats:italic>\n            is the total length of the seams between image regions in the composite; for typical cases,\n            <jats:italic>p<\/jats:italic>\n            is\n            <jats:italic>O<\/jats:italic>\n            (\u221a\n            <jats:italic>n<\/jats:italic>\n            ). We achieve this reduction by transforming the problem into a space where much of the solution is smooth, and then utilize the pattern of this smoothness to adaptively subdivide the problem domain using quadtrees. We demonstrate the merits of our approach by performing panoramic stitching and image region copy-and-paste in significantly reduced time and memory while achieving visually identical results.\n          <\/jats:p>","DOI":"10.1145\/1276377.1276495","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":108,"title":["Efficient gradient-domain compositing using quadtrees"],"prefix":"10.1145","volume":"26","author":[{"given":"Aseem","family":"Agarwala","sequence":"first","affiliation":[{"name":"Adobe Systems, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"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\/1073204.1073269"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141935"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882364"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(82)90020-X"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566573"},{"key":"e_1_2_2_9_1","volume-title":"European Conference on Computer Vision (ECCV 02)","author":"Finlayson G.","unstructured":"Finlayson , G. , and Drew , S. H. M. 2002. Removing shadows from images . In European Conference on Computer Vision (ECCV 02) , 823--831. Finlayson, G., and Drew, S. H. M. 2002. Removing shadows from images. In European Conference on Computer Vision (ECCV 02), 823--831."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.9118"},{"key":"e_1_2_2_11_1","volume-title":"Workshop on Applications of Computer Vision (ECCV","author":"Georgiev T.","year":"2004","unstructured":"Georgiev , T. 2004 . Photoshop healing brush: a tool for seamless cloning . In Workshop on Applications of Computer Vision (ECCV 2004), 1--8. Georgiev, T. 2004. Photoshop healing brush: a tool for seamless cloning. In Workshop on Applications of Computer Vision (ECCV 2004), 1--8."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.249"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276382"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141934"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882264"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1277-108"},{"key":"e_1_2_2_17_1","volume-title":"European Conference on Computer Vision (ECCV 04)","author":"Levin A.","unstructured":"Levin , A. , Zomet , A. , Peleg , S. , and Weiss , Y . 2004. Seamless image stitching in the gradient domain . In European Conference on Computer Vision (ECCV 04) , 377--389. Levin, A., Zomet, A., Peleg, S., and Weiss, Y. 2004. Seamless image stitching in the gradient domain. In European Conference on Computer Vision (ECCV 04), 377--389."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015745"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/218013.218078"},{"key":"e_1_2_2_20_1","volume-title":"Vision Science: Photons to Phenomenology","author":"Palmer S. E.","year":"1999","unstructured":"Palmer , S. E. 1999 . Vision Science: Photons to Phenomenology . The MIT Press . Palmer, S. E. 1999. Vision Science: Photons to Phenomenology. The MIT Press."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882269"},{"key":"e_1_2_2_22_1","volume-title":"Iterative methods for sparse linear systems","author":"Saad Y.","unstructured":"Saad , Y. 2003. Iterative methods for sparse linear systems , 2 nd ed. Society for Industrial and Applied Mathematics (SIAM) . Saad, Y. 2003. Iterative methods for sparse linear systems, 2nd ed. Society for Industrial and Applied Mathematics (SIAM).","edition":"2"},{"key":"e_1_2_2_23_1","volume-title":"Applications for spatial data structures: computer graphics, image processing, and GIS","author":"Samet H.","unstructured":"Samet , H. 1990. Applications for spatial data structures: computer graphics, image processing, and GIS . Addison-Wesley . Samet, H. 1990. Applications for spatial data structures: computer graphics, image processing, and GIS. Addison-Wesley."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.55103"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015721"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.546257"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.56188"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1142005"},{"key":"e_1_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Toledo S. 1999. A survey of out-of-core algorithms in numerical linear algebra. In External Memory Algorithms DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 161--180.   Toledo S. 1999. A survey of out-of-core algorithms in numerical linear algebra. In External Memory Algorithms DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 161--180.","DOI":"10.1090\/dimacs\/050\/09"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018429.1021105"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937606"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.863958"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276377.1276495","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276377.1276495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:04Z","timestamp":1750258684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276377.1276495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":32,"aliases":["10.1145\/1239451.1239545"],"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7,29]]}},"alternative-id":["10.1145\/1276377.1276495"],"URL":"https:\/\/doi.org\/10.1145\/1276377.1276495","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}