{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T09:17:14Z","timestamp":1783156634279,"version":"3.54.6"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013794","name":"Shanxi Provincial Education Department","doi-asserted-by":"publisher","award":["2024L351"],"award-info":[{"award-number":["2024L351"]}],"id":[{"id":"10.13039\/501100013794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Shanxi Province Natural Science Foundation","doi-asserted-by":"publisher","award":["202303021222271"],"award-info":[{"award-number":["202303021222271"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Shanxi Province Natural Science Foundation","doi-asserted-by":"publisher","award":["202403021221231"],"award-info":[{"award-number":["202403021221231"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Image and Vision Computing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.imavis.2026.105996","type":"journal-article","created":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T16:02:01Z","timestamp":1776787321000},"page":"105996","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Decomposed global optimization for robust point matching with low-dimensional branching"],"prefix":"10.1016","volume":"171","author":[{"given":"Wei","family":"Lian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhesen","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wangmeng","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.imavis.2026.105996_b1","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s10479-010-0760-8","article-title":"Discrete and geometric branch and bound algorithms for medical image registration","volume":"196","author":"Pfeuffer","year":"2012","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"10.1016\/j.imavis.2026.105996_b2","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1109\/TPAMI.2016.2603988","article-title":"An efficient globally optimal algorithm for asymmetric point matching","volume":"39","author":"Lian","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.imavis.2026.105996_b3","doi-asserted-by":"crossref","unstructured":"W. Lian, L. Zhang, Point matching in the presence of outliers in both point sets: A concave optimization approach, in: IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 352\u2013359.","DOI":"10.1109\/CVPR.2014.52"},{"key":"10.1016\/j.imavis.2026.105996_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107322","article-title":"A concave optimization algorithm for matching partially overlapping point sets","volume":"103","author":"Lian","year":"2020","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.imavis.2026.105996_b5","doi-asserted-by":"crossref","first-page":"166750","DOI":"10.1109\/ACCESS.2021.3135863","article-title":"A polyhedral annexation algorithm for aligning partially overlapping point sets","volume":"9","author":"Lian","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.imavis.2026.105996_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126482","article-title":"Hybrid trilinear and bilinear programming for aligning partially overlapping point sets","volume":"551","author":"Lian","year":"2023","journal-title":"Neurocomputing"},{"key":"10.1016\/j.imavis.2026.105996_b7","unstructured":"X. Huang, G. Mei, J. Zhang, R. Abbas, A comprehensive survey on point cloud registration. arXiv preprint arXiv:2103.02690."},{"issue":"2","key":"10.1016\/j.imavis.2026.105996_b8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/34.121791","article-title":"A method for registration of 3D shapes","volume":"14","author":"Besl","year":"1992","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.imavis.2026.105996_b9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/140971518","article-title":"On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision","volume":"8","author":"Ochs","year":"2015","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"10.1016\/j.imavis.2026.105996_b10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TRO.2020.3033695","article-title":"TEASER: Fast and certifiable point cloud registration","volume":"37","author":"Yang","year":"2021","journal-title":"IEEE Trans. Robot."},{"key":"10.1016\/j.imavis.2026.105996_b11","series-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"8287","article-title":"Global optimality for point set registration using semidefinite programming","author":"Iglesias","year":"2020"},{"key":"10.1016\/j.imavis.2026.105996_b12","doi-asserted-by":"crossref","unstructured":"Z. Qin, H. Yu, C. Wang, Y. Guo, Y. Peng, K. Xu, Geometric transformer for fast and robust point cloud registration, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 2022, pp. 11143\u201311152.","DOI":"10.1109\/CVPR52688.2022.01086"},{"key":"10.1016\/j.imavis.2026.105996_b13","doi-asserted-by":"crossref","unstructured":"Y. Wang, J.M. Solomon, Deep closest point: Learning representations for point cloud registration, in: Proceedings of the IEEE\/CVF International Conference on Computer Vision, ICCV, 2019, pp. 3523\u20133532.","DOI":"10.1109\/ICCV.2019.00362"},{"key":"10.1016\/j.imavis.2026.105996_b14","doi-asserted-by":"crossref","unstructured":"S. Rusinkiewicz, M. Levoy, Efficient variants of the ICP algorithm, in: Proceedings of the International Conference on 3-D Digital Imaging and Modeling, 2001, pp. 145\u2013152.","DOI":"10.1109\/IM.2001.924423"},{"issue":"3","key":"10.1016\/j.imavis.2026.105996_b15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/355900.355905","article-title":"A system of subroutines for iteratively reweighted least squares computations","volume":"6","author":"Coleman","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/j.imavis.2026.105996_b16","doi-asserted-by":"crossref","unstructured":"Q.-Y. Zhou, J. Park, V. Koltun, Fast global registration, in: Proceedings of the European Conference on Computer Vision, ECCV, 2016, pp. 766\u2013782.","DOI":"10.1007\/978-3-319-46475-6_47"},{"issue":"2","key":"10.1016\/j.imavis.2026.105996_b17","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/LRA.2020.2965893","article-title":"Graduated non-convexity for robust spatial perception: From non-minimal solvers to global outlier rejection","volume":"5","author":"Yang","year":"2020","journal-title":"IEEE Robot. Autom. Lett."},{"key":"10.1016\/j.imavis.2026.105996_b18","unstructured":"L. Peng, R. Vidal, Block coordinate descent on smooth manifolds. arXiv preprint arXiv:2305.14744."},{"key":"10.1016\/j.imavis.2026.105996_b19","doi-asserted-by":"crossref","unstructured":"L. Peng, R. Vidal C. K\u00fcmmerle, On the convergence of IRLS and its variants in outlier-robust estimation, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, CVPR, 2023, pp. 17647\u201317657.","DOI":"10.1109\/CVPR52729.2023.01708"},{"key":"10.1016\/j.imavis.2026.105996_b20","series-title":"Deterministic Global Optimization: Geometric Branch-and-Bound Methods and their Applications","author":"Scholz","year":"2011"},{"issue":"11","key":"10.1016\/j.imavis.2026.105996_b21","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1109\/TPAMI.2015.2513405","article-title":"Go-ICP: A globally optimal solution to 3D ICP point-set registration","volume":"38","author":"Yang","year":"2016","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.imavis.2026.105996_b22","doi-asserted-by":"crossref","unstructured":"H. Li, Consensus set maximization with guaranteed global optimality for robust geometry estimation, in: Proceedings of the IEEE International Conference on Computer Vision, 2009, pp. 1074\u20131081.","DOI":"10.1109\/ICCV.2009.5459398"},{"key":"10.1016\/j.imavis.2026.105996_b23","unstructured":"X. Zhang, L. Peng, W. Xu, L. Kneid, Accelerating globally optimal consensus maximization in geometric vision. arXiv preprint arXiv:2304.05156."},{"key":"10.1016\/j.imavis.2026.105996_b24","doi-asserted-by":"crossref","unstructured":"W. Chen, H. Li, Q. Nie, Y.-H. Liu, Deterministic point cloud registration via novel transformation decomposition, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 2022, pp. 17343\u201317351.","DOI":"10.1109\/CVPR52688.2022.00624"},{"issue":"7","key":"10.1016\/j.imavis.2026.105996_b25","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1109\/TPAMI.2016.2603988","article-title":"An efficient globally optimal algorithm for asymmetric point matching","volume":"39","author":"Lian","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"10.1016\/j.imavis.2026.105996_b26","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2016.2517636","article-title":"Fast rotation search with stereographic projections for 3D registration","volume":"38","author":"Bustos","year":"2016","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.imavis.2026.105996_b27","doi-asserted-by":"crossref","unstructured":"J. Briales, J. Gonzalez-Jimenez, Convex global 3D registration with Lagrangian duality, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR, 2017, pp. 4960\u20134969.","DOI":"10.1109\/CVPR.2017.595"},{"key":"10.1016\/j.imavis.2026.105996_b28","doi-asserted-by":"crossref","unstructured":"H. Yang, L. Carlone, A quaternion-based certifiably optimal solution to the Wahba problem with outliers, in: Proceedings of the IEEE\/CVF International Conference on Computer Vision, ICCV, 2019, pp. 3105\u20133114.","DOI":"10.1109\/ICCV.2019.00175"},{"key":"10.1016\/j.imavis.2026.105996_b29","series-title":"European Conference on Computer Vision","first-page":"135","article-title":"Semidefinite relaxations of truncated least-squares in robust rotation search: Tight or not","author":"Peng","year":"2022"},{"issue":"1\u20132","key":"10.1016\/j.imavis.2026.105996_b30","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-022-01912-6","article-title":"An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization","volume":"201","author":"Yang","year":"2023","journal-title":"Math. Program."},{"key":"10.1016\/j.imavis.2026.105996_b31","doi-asserted-by":"crossref","unstructured":"\u00c1. Parra Bustos, T.-J. Chin, Guaranteed outlier removal for rotation search, in: Proceedings of the IEEE International Conference on Computer Vision, ICCV, 2015, pp. 2165\u20132173.","DOI":"10.1109\/ICCV.2015.250"},{"issue":"12","key":"10.1016\/j.imavis.2026.105996_b32","doi-asserted-by":"crossref","first-page":"2868","DOI":"10.1109\/TPAMI.2017.2773482","article-title":"Guaranteed outlier removal for point cloud registration with correspondences","volume":"40","author":"Bustos","year":"2018","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.imavis.2026.105996_b33","doi-asserted-by":"crossref","unstructured":"P.C. Lusk, K. Fathian, J.P. How, CLIPPER: A graph-theoretic framework for robust data association, in: Proceedings of the IEEE International Conference on Robotics and Automation, ICRA, 2021, pp. 13828\u201313834.","DOI":"10.1109\/ICRA48506.2021.9561069"},{"key":"10.1016\/j.imavis.2026.105996_b34","doi-asserted-by":"crossref","unstructured":"X. Zhang, J. Yang, S. Zhang, Y. Zhang, 3D registration with maximal cliques, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, CVPR, 2023, pp. 17745\u201317754.","DOI":"10.1109\/CVPR52729.2023.01702"},{"key":"10.1016\/j.imavis.2026.105996_b35","unstructured":"Z. Chen, K. Sun, F. Yang, L. Guo, W. Tao, SC2-PCR++: Rethinking the generation and selection for efficient and robust point cloud registration, IEEE Trans. Pattern Anal. Mach. Intell.."},{"issue":"2","key":"10.1016\/j.imavis.2026.105996_b36","doi-asserted-by":"crossref","first-page":"4654","DOI":"10.1109\/LRA.2022.3152837","article-title":"TriVoC: Efficient voting-based consensus maximization for robust point cloud registration with extreme outlier ratios","volume":"7","author":"Sun","year":"2022","journal-title":"IEEE Robot. Autom. Lett."},{"key":"10.1016\/j.imavis.2026.105996_b37","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","article-title":"Computability of global solutions to factorable nonconvex programs: Part i\u2014convex underestimating problems","volume":"10","author":"McCormick","year":"1976","journal-title":"Math. Program."},{"key":"10.1016\/j.imavis.2026.105996_b38","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest augmenting path algorithm for dense and sparse linear assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"issue":"11","key":"10.1016\/j.imavis.2026.105996_b39","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1109\/TPAMI.2015.2513405","article-title":"Go-icp: A globally optimal solution to 3d icp point-set registration","volume":"38","author":"Yang","year":"2016","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"10.1016\/j.imavis.2026.105996_b40","doi-asserted-by":"crossref","first-page":"2868","DOI":"10.1109\/TPAMI.2017.2773482","article-title":"Guaranteed outlier removal for point cloud registration with correspondences","volume":"40","author":"Parra","year":"2018","journal-title":"TPAMI"},{"key":"10.1016\/j.imavis.2026.105996_b41","first-page":"1","article-title":"Teaser: Fast and certifiable point cloud registration","author":"H. Yang","year":"2020","journal-title":"IEEE Trans. Robot."},{"key":"10.1016\/j.imavis.2026.105996_b42","series-title":"2009 IEEE International Conference on Robotics and Automation","first-page":"3212","article-title":"Fast point feature histograms (fpfh) for 3d registration","author":"Rusu","year":"2009"},{"key":"10.1016\/j.imavis.2026.105996_b43","doi-asserted-by":"crossref","unstructured":"A. Zeng, S. Song, M. Fisher M. Nie\u00dfner, J. Xiao, T. Funkhouser, 3dmatch: Learning local geometric descriptors from rgb-d reconstructions, in: CVPR, 2017.","DOI":"10.1109\/CVPR.2017.29"},{"key":"10.1016\/j.imavis.2026.105996_b44","unstructured":"X. Bai, Z. Luo, L. Zhou, H. Fu, L. Quan, C.-L. Tai, D3feat: Joint learning of dense detection and description of 3d local features. arXiv:2003.03164[cs. CV]."}],"container-title":["Image and Vision Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885626001034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885626001034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:36:53Z","timestamp":1783154213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0262885626001034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":44,"alternative-id":["S0262885626001034"],"URL":"https:\/\/doi.org\/10.1016\/j.imavis.2026.105996","relation":{},"ISSN":["0262-8856"],"issn-type":[{"value":"0262-8856","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decomposed global optimization for robust point matching with low-dimensional branching","name":"articletitle","label":"Article Title"},{"value":"Image and Vision Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.imavis.2026.105996","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105996"}}