{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T23:03:18Z","timestamp":1792710198028,"version":"4.5.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T00:00:00Z","timestamp":1562889600000},"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":["1421435,1617236,1815070"],"award-info":[{"award-number":["1421435,1617236,1815070"]}],"id":[{"id":"10.13039\/100000001","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":[[2019,8,31]]},"abstract":"<jats:p>The Iterative Closest Point (ICP) algorithm, commonly used for alignment of 3D models, has previously been defined using either a point-to-point or point-to-plane objective. Alternatively, researchers have proposed computationally-expensive methods that directly minimize the distance function between surfaces. We introduce a new symmetrized objective function that achieves the simplicity and computational efficiency of point-to-plane optimization, while yielding improved convergence speed and a wider convergence basin. In addition, we present a linearization of the objective that is exact in the case of exact correspondences. We experimentally demonstrate the improved speed and convergence basin of the symmetric objective, on both smooth models and challenging cases involving noise and partial overlap.<\/jats:p>","DOI":"10.1145\/3306346.3323037","type":"journal-article","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T19:04:08Z","timestamp":1562958248000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":177,"title":["A symmetric objective function for ICP"],"prefix":"10.1145","volume":"38","author":[{"given":"Szymon","family":"Rusinkiewicz","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360684"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12178"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276404"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(92)90066-C"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2004.05.007"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237269"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2692160"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.655652"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001380050048"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.15.43"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IM.2003.1240258"},{"key":"e_1_2_2_13_1","volume-title":"Proc. SGP.","author":"Gelfand Natasha","year":"2005","unstructured":"Natasha Gelfand , Niloy J. Mitra , Leonidas Guibas , and Helmut Pottmann . 2005 . Robust Global Registration . In Proc. SGP. Natasha Gelfand, Niloy J. Mitra, Leonidas Guibas, and Helmut Pottmann. 2005. Robust Global Registration. In Proc. SGP."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.705"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0262-8856(03)00060-X"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2047196.2047270"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Peter Kovesi. 2015. Good Colour Maps: How to Design Them. arXiv:1509.03700.  Peter Kovesi. 2015. Good Colour Maps: How to Design Them. arXiv:1509.03700.","DOI":"10.1071\/ASEG2015ab107"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCE.2016.7562647"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/844381.845150"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057435"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/839277.840065"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/2300000035"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-5167-2"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1889712.1889738"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IM.2001.924423"},{"key":"e_1_2_2_27_1","volume-title":"Generalized-ICP. In Proc. RSS.","author":"Segal Aleksandr V.","year":"2009","unstructured":"Aleksandr V. Segal , Dirk Haehnel , and Sebastian Thrun . 2009 . Generalized-ICP. In Proc. RSS. Aleksandr V. Segal, Dirk Haehnel, and Sebastian Thrun. 2009. Generalized-ICP. In Proc. RSS."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385773"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12700"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2980226"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/192161.192241"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2513405"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3306346.3323037","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3306346.3323037","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3306346.3323037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:52Z","timestamp":1750206352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3306346.3323037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,12]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8,31]]}},"alternative-id":["10.1145\/3306346.3323037"],"URL":"https:\/\/doi.org\/10.1145\/3306346.3323037","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,12]]},"assertion":[{"value":"2019-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}