{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:32:23Z","timestamp":1772742743438,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["109-2221-E-009-119-MY3"],"award-info":[{"award-number":["109-2221-E-009-119-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["109-2221-E-009-120-MY3"],"award-info":[{"award-number":["109-2221-E-009-120-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/lra.2021.3140130","type":"journal-article","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T15:28:40Z","timestamp":1641310120000},"page":"1471-1477","source":"Crossref","is-referenced-by-count":13,"title":["K-Closest Points and Maximum Clique Pruning for Efficient and Effective 3-D Laser Scan Matching"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9839-2174","authenticated-orcid":false,"given":"Yu-Kai","family":"Lin","sequence":"first","affiliation":[{"name":"Institute of Multimedia Engineering, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9704-5373","authenticated-orcid":false,"given":"Wen-Chieh","family":"Lin","sequence":"additional","affiliation":[{"name":"Institute of Multimedia Engineering, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9385-0044","authenticated-orcid":false,"given":"Chieh-Chih","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"A comprehensive survey on point cloud registration","author":"Huang","year":"2021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3052418"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2513405"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20204"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2009.V.021"},{"key":"ref7","article-title":"A practical maximum clique algorithm for matching with pairwise constraints","author":"Parra","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.3033695"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2019.xv.003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00569"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152473"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01164"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1364\/JOSAA.5.001127"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2700727"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01267-0_37"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00905"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3065224"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00639"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2965893"},{"key":"ref22","first-page":"197","article-title":"Robust global registration","volume-title":"Proc. Symp. Geometry Process.","author":"Gelfand","year":"2005"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793990"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09771-7_4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459319"},{"issue":"4","key":"ref26","first-page":"381","article-title":"Softmax to Softassign: Neural network algorithms for combinatorial optimization","volume":"2","author":"Gold","year":"1996","journal-title":"J. Artif. Neural Netw."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAIS46528.2019.9074665"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_47"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9647862\/09669021.pdf?arnumber=9669021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:03:57Z","timestamp":1769493837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9669021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3140130","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}