{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T22:50:04Z","timestamp":1767826204436,"version":"3.49.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"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":[[2006,7]]},"abstract":"<jats:p>The paper defines an automatic procedure for constructing a visually appealing collage from a collection of input images. The aim is that the resulting collage should be representative of the collection, summarising its main themes. It is also assembled largely seamlessly, using graph-cut, Poisson blending of alpha-masks, to hide the joins between input images. This paper makes several new contributions. Firstly, we show how energy terms can be included that: encourage the selection of a representative set of images; that are sensitive to particular object classes; that encourage a spatially efficient and seamless layout. Secondly the resulting optimization poses a search problem that, on the face of it, is computationally in-feasible. Rather than attempt an expensive, integrated optimization procedure, we have developed a sequence of optimization steps, from static ranking of images, through region of interest optimization, optimal packing by constraint satisfaction, and lastly graph-cut alpha-expansion. To illustrate the power of AutoCollage, we have used it to create collages of many home photo sets; we also conducted a user study in which AutoCollage outperformed competitive methods.<\/jats:p>","DOI":"10.1145\/1141911.1141965","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:14:26Z","timestamp":1153836866000},"page":"847-852","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":134,"title":["AutoCollage"],"prefix":"10.1145","volume":"25","author":[{"given":"Carsten","family":"Rother","sequence":"first","affiliation":[{"name":"Microsoft Research Cambridge, UK"}]},{"given":"Lucas","family":"Bordeaux","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, UK"}]},{"given":"Youssef","family":"Hamadi","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, UK"}]},{"given":"Andrew","family":"Blake","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, UK"}]}],"member":"320","published-online":{"date-parts":[[2006,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.1016\/0895-7177(93)90068-A"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800031.808600"},{"key":"e_1_2_2_5_1","unstructured":"Dechter R. 2003. Constraint Processing. Morgan Kaufmann.   Dechter R. 2003. Constraint Processing. Morgan Kaufmann."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095034.1095065"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383296"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.730558"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/566570.566633"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882264"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Marriott K. and Stuckey P. 1998. Programming with Constraints. The MIT Press.  Marriott K. and Stuckey P. 1998. Programming with Constraints. The MIT Press.","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882269"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015720"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.130"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11744023_1"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/964696.964707"},{"key":"e_1_2_2_17_1","volume-title":"Proc. Conf. Comp. Vision and Pat. Recog.","author":"Viola P.","unstructured":"Viola , P. , and Jones , M . 2001. Rapid object detection using a boosted cascade of simple features . In Proc. Conf. Comp. Vision and Pat. Recog. Viola, P., and Jones, M. 2001. Rapid object detection using a boosted cascade of simple features. In Proc. Conf. Comp. Vision and Pat. Recog."},{"key":"e_1_2_2_18_1","volume-title":"The Psychology of Vision","author":"Waltz D.","unstructured":"Waltz , D. 1975. Understanding line drawings of scenes with shadows . In The Psychology of Vision , W. P. H., Ed. McGraw-Hill, New York . Waltz, D. 1975. Understanding line drawings of scenes with shadows. In The Psychology of Vision, W. P. H., Ed. McGraw-Hill, New York."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141965","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141911.1141965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:24Z","timestamp":1750259664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1141911.1141965"],"URL":"https:\/\/doi.org\/10.1145\/1141911.1141965","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}