{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:14:48Z","timestamp":1766578488531,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["FODAVA 808515CCF 1011228"],"award-info":[{"award-number":["FODAVA 808515CCF 1011228"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["MURI N0001470710747"],"award-info":[{"award-number":["MURI N0001470710747"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2011CB30220","2012AA011802"],"award-info":[{"award-number":["2011CB30220","2012AA011802"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61120106007"],"award-info":[{"award-number":["61120106007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["FODAVA 808515CCF 1011228"],"award-info":[{"award-number":["FODAVA 808515CCF 1011228"]}],"id":[{"id":"10.13039\/100000143","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,11]]},"abstract":"<jats:p>We introduce a novel approach for computing high quality point-to-point maps among a collection of related shapes. The proposed approach takes as input a sparse set of imperfect initial maps between pairs of shapes and builds a compact data structure which implicitly encodes an improved set of maps between all pairs of shapes. These maps align well with point correspondences selected from initial maps; they map neighboring points to neighboring points; and they provide cycle-consistency, so that map compositions along cycles approximate the identity map.<\/jats:p>\n          <jats:p>The proposed approach is motivated by the fact that a complete set of maps between all pairs of shapes that admits nearly perfect cycle-consistency are highly redundant and can be represented by compositions of maps through a single base shape. In general, multiple base shapes are needed to adequately cover a diverse collection. Our algorithm sequentially extracts such a small collection of base shapes and creates correspondences from each of these base shapes to all other shapes. These correspondences are found by global optimization on candidate correspondences obtained by diffusing initial maps. These are then used to create a compact graphical data structure from which globally optimal cycle-consistent maps can be extracted using simple graph algorithms.<\/jats:p>\n          <jats:p>Experimental results on benchmark datasets show that the proposed approach yields significantly better results than state-of-the-art data-driven shape matching methods.<\/jats:p>","DOI":"10.1145\/2366145.2366186","type":"journal-article","created":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T20:36:17Z","timestamp":1352925377000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["An optimization approach for extracting and encoding consistent maps in a shape collection"],"prefix":"10.1145","volume":"31","author":[{"given":"Qi-Xing","family":"Huang","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Guo-Xin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Lin","family":"Gao","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Shi-Min","family":"Hu","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Adrian","family":"Butscher","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Leonidas","family":"Guibas","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2012,11]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"33","article-title":"The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces","volume":"17","author":"Anguelov D.","year":"2004","unstructured":"Anguelov , D. , Srinivasan , P. , Pang , H.-C. , Koller , D. , Thrun , S. , and Davis , J. 2004 . The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces . NIPS 17 , 33 -- 40 . Anguelov, D., Srinivasan, P., Pang, H.-C., Koller, D., Thrun, S., and Davis, J. 2004. The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces. NIPS 17, 33--40.","journal-title":"NIPS"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964930"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Cho T. S. Avidan S. and Freeman W. T. 2010. A probabilistic image jigsaw puzzle solver. In CVPR 183--190.  Cho T. S. Avidan S. and Freeman W. T. 2010. A probabilistic image jigsaw puzzle solver. In CVPR 183--190.","DOI":"10.1109\/CVPR.2010.5540212"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1077-3142(03)00009-2"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964929"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015775"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Giorgi D. Biasotti S. and Paraboschi L. 2007. Shape retrieval contest 2007: Watertight models track.  Giorgi D. Biasotti S. and Paraboschi L. 2007. Shape retrieval contest 2007: Watertight models track.","DOI":"10.1109\/SMI.2008.4547975"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.007"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2009.03.010"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141925"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024159"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073206"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778839"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964974"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185550"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577072"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143913"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531378"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1148033"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0145-y"},{"volume-title":"SGP '11","author":"Nguyen A.","key":"e_1_2_1_22_1","unstructured":"Nguyen , A. , Ben-Chen , M. , Welnicka , K. , Ye , Y. , and Guibas , L . 2011. An optimization approach to improving collections of shape maps . SGP '11 , 1481--1491. Nguyen, A., Ben-Chen, M., Welnicka, K., Ye, Y., and Guibas, L. 2011. An optimization approach to improving collections of shape maps. SGP '11, 1481--1491."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185526"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995549"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024160"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03167.x"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015736"},{"volume-title":"Symposium on Geometry Processing '09","author":"Sun J.","key":"e_1_2_1_29_1","unstructured":"Sun , J. , Ovsjanikov , M. , and Guibas , L . 2009. A concise and provably informative multi-scale signature based on heat diffusion . Symposium on Geometry Processing '09 , 1383--1392. Sun, J., Ovsjanikov, M., and Guibas, L. 2009. A concise and provably informative multi-scale signature based on heat diffusion. Symposium on Geometry Processing '09, 1383--1392."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01893.x"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Zach C. Klopschitz M. and Pollefeys M. 2010. Disambiguating visual relations using loop constraints. In CVPR 1426--1433.  Zach C. Klopschitz M. and Pollefeys M. 2010. Disambiguating visual relations using loop constraints. In CVPR 1426--1433.","DOI":"10.1109\/CVPR.2010.5539801"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2366145.2366186","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2366145.2366186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:44Z","timestamp":1750239284000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2366145.2366186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1145\/2366145.2366186"],"URL":"https:\/\/doi.org\/10.1145\/2366145.2366186","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2012,11]]},"assertion":[{"value":"2012-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}