{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:02:22Z","timestamp":1760238142924,"version":"build-2065373602"},"reference-count":49,"publisher":"MDPI AG","issue":"15","license":[{"start":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T00:00:00Z","timestamp":1595462400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["81701795"],"award-info":[{"award-number":["81701795"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Point set registration is one of the basic problems in computer vision. When the overlap ratio between point sets is small or the relative transformation is large, local methods cannot guarantee the accuracy. However, the time complexity of the branch and bound (BnB) optimization used in most existing global methods is exponential in the dimensionality of parameter space. Therefore, seven-Degrees of Freedom (7-DoF) similarity transformation is a big challenge for BnB. In this paper, a novel rotation and scale invariant feature is introduced to decouple the optimization of translation, rotation, and scale in similarity point set registration, so that BnB optimization can be done in two lower dimensional spaces. With the transformation decomposition, the translation is first estimated and then the rotation is optimized by maximizing a robust objective function defined on consensus set. Finally, the scale is estimated according to the potential correspondences in the obtained consensus set. Experiments on synthetic data and clinical data show that our method is approximately two orders of magnitude faster than the state-of-the-art global method and more accurate than a typical local method. When the outlier ratio with respect to the inliers is up to 1.0, our method still achieves accurate registration.<\/jats:p>","DOI":"10.3390\/s20154103","type":"journal-article","created":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T11:26:01Z","timestamp":1595503561000},"page":"4103","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Similarity Point Set Registration by Transformation Decomposition"],"prefix":"10.3390","volume":"20","author":[{"given":"Chen","family":"Wang","sequence":"first","affiliation":[{"name":"Digital Medical Research Center, School of Basic Medical Sciences, Fudan University, Shanghai 200032, China"},{"name":"Shanghai Key Laboratory of Medical Imaging Computing and Computer Assisted Intervention, Shanghai 200032, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinrong","family":"Chen","sequence":"additional","affiliation":[{"name":"Academy for Engineering and Technology, Fudan University, Shanghai 200433, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manning","family":"Wang","sequence":"additional","affiliation":[{"name":"Digital Medical Research Center, School of Basic Medical Sciences, Fudan University, Shanghai 200032, China"},{"name":"Shanghai Key Laboratory of Medical Imaging Computing and Computer Assisted Intervention, Shanghai 200032, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,7,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Weiss, A., Hirshberg, D., and Black, M.J. (2011, January 6\u201313). Home 3D Body Scans from Noisy Image and Range Data. Proceedings of the 13th IEEE International Conference on Computer Vision, Barcelona, Spain.","DOI":"10.1109\/ICCV.2011.6126465"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"43021","DOI":"10.1117\/1.JEI.25.4.043021","article-title":"Scaling registration of multiview range scans via motion averaging","volume":"25","author":"Zhu","year":"2016","journal-title":"J. Electron. Imaging"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1109\/TMI.2012.2202913","article-title":"Group-Wise Registration of Point Sets for Statistical Shape Models","volume":"31","author":"Rasoulian","year":"2012","journal-title":"IEEE Trans. Med. Imaging"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1109\/TMI.2002.803111","article-title":"HAMMER: Hierarchical Attribute Matching Mechanism for Elastic Registration","volume":"21","author":"Shen","year":"2002","journal-title":"IEEE Trans. Med. Imaging"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1002\/hbm.22233","article-title":"S-HAMMER: Hierarchical Attribute-Guided, Symmetric Diffeomorphic Registration for MR Brain Images","volume":"35","author":"Wu","year":"2014","journal-title":"Hum. Brian Mapp."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2300000035","article-title":"A Review of Point Cloud Registration Algorithms for Mobile Robotics","volume":"4","author":"Pomerleau","year":"2015","journal-title":"Found. Trends Robot."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2516","DOI":"10.1017\/S0263574715000168","article-title":"Merging grid maps of different resolutions by scaling registration","volume":"34","author":"Ma","year":"2016","journal-title":"Robotica"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wang, R., Xu, Y., Sotelo, M.A., Ma, Y., Sarkodie-Gyan, T., Li, Z., and Li, W. (2019). A Robust Registration Method for Autonomous Driving Pose Estimation in Urban Dynamic Environment Using LiDAR. Electronics, 8.","DOI":"10.3390\/electronics8010043"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jvcir.2017.03.012","article-title":"Recent developments and trends in point set registration methods","volume":"46","author":"Maiseli","year":"2017","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/TVCG.2012.310","article-title":"Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid","volume":"19","author":"Tam","year":"2013","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/34.121791","article-title":"A Method For Registration of 3-D Shapes","volume":"14","author":"Besl","year":"1992","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/JAS.2019.1911579","article-title":"A Correntropy-based Affine Iterative Closest Point Algorithm for Robust Point Set Registration","volume":"6","author":"Chen","year":"2019","journal-title":"IEEE-CAA J. Autom. Sin."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.patcog.2019.03.013","article-title":"Correntropy Based Scale ICP Algorithm for Robust Point Set Registration","volume":"93","author":"Wu","year":"2019","journal-title":"Pattern Recogn."},{"key":"ref_14","unstructured":"Yang, Y., Fan, D., Du, S., Wang, M., Chen, B., and Gao, Y. (2019). Point Set Registration With Similarity and Affine Transformations Based on Bidirectional KMPE Loss. IEEE Trans. Cybern., 1\u201312."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00530-017-0573-6","article-title":"Precise Iterative Closest Point Algorithm with Corner Point Constraint for Isotropic Scaling Registration","volume":"25","author":"Du","year":"2019","journal-title":"Multi-Media Syst."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Li, C., Xue, J., Zheng, N., Du, S., Zhu, J., and Tian, Z. (2011, January 11\u201314). Fast and Robust Isotropic Scaling Iterative Closest Point Algorithm. Proceedings of the IEEE International Conference on Image Processing, Brussels, Belgium.","DOI":"10.1109\/ICIP.2011.6115724"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/TASE.2009.2021337","article-title":"A Scale Stretch Method Based on ICP for 3D Data Registration","volume":"3","author":"Ying","year":"2009","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_18","unstructured":"Zha, H.B., Ikuta, M., and Hasegawa, T. (2000, January 8\u201311). Registration of range images with different scanning resolutions. Proceedings of the IEEE International Conference on Systems Man and Cybernetics Conference, Nashville, TN, USA."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Li, H., and Hartley, R. (2007, January 18\u201323). The 3D-3D Registration Problem Revisited. Proceedings of the IEEE International Conference on Computer Vision, Minneapolis, MN, USA.","DOI":"10.1109\/ICCV.2007.4409077"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Tsin, Y., and Kanade, T. (2004, January 11\u201314). A Correlation-Based Approach to Robust Point Set Registration. Proceedings of the European Conference on Computer Vision, Prague, Czech Republic.","DOI":"10.1007\/978-3-540-24672-5_44"},{"key":"ref_21","unstructured":"Chui, H.L., and Rangarajan, A. (2000, January 11\u201312). A Feature Registration Framework using Mixture Models. Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis, Hilton Head Island, SC, USA."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1633","DOI":"10.1109\/TPAMI.2010.223","article-title":"Robust Point Set Registration Using Gaussian Mixture Models","volume":"33","author":"Jian","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2262","DOI":"10.1109\/TPAMI.2010.46","article-title":"Point Set Registration: Coherent Point Drift","volume":"32","author":"Myronenko","year":"2010","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_24","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":"ref_25","doi-asserted-by":"crossref","unstructured":"Campbell, D., and Petersson, L. (2016, January 27\u201330). GOGMA: Globally-Optimal Gaussian Mixture Alignment. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA.","DOI":"10.1109\/CVPR.2016.613"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TPAMI.2008.131","article-title":"Branch-and-Bound Methods for Euclidean Registration Problems","volume":"31","author":"Olsson","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Straub, J., Campbell, T., How, J.P., and Fisher, J.W.I. (2017, January 21\u201326). Efficient Global Point Cloud Alignment using Bayesian Nonparametric Mixtures. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA.","DOI":"10.1109\/CVPR.2017.258"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, C., Song, Z., and Wang, M. (2018, January 8\u201314). Efficient Global Point Cloud Registration by Matching Rotation Invariant Features Through Translation Search. Proceedings of the European Conference on Computer Vision, Munich, Germany.","DOI":"10.1007\/978-3-030-01258-8_28"},{"key":"ref_29","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":"ref_30","first-page":"1281","article-title":"An Efficient Globally Optimal Algorithm for Asymmetric Point Matching","volume":"7","author":"Lian","year":"2016","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1049\/el.2011.1071","article-title":"Isotropic Scaling Iterative Closest Point Algorithm for Partial Registration","volume":"47","author":"Du","year":"2011","journal-title":"Electron. Lett."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"5286","DOI":"10.1109\/TSP.2007.896065","article-title":"Correntropy: Properties and Applications in Non-Gaussian Signal Processing","volume":"55","author":"Liu","year":"2007","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2101","DOI":"10.1109\/TCYB.2017.2727278","article-title":"Robust Learning with Kernel Mean p-Power Error Loss","volume":"48","author":"Chen","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"ref_34","unstructured":"Consolini, L., Laurini, M., Locatelli, M., and Rizzini, D.L. (2019). Globally Optimal Registration based on Fast Branch and Bound. arXiv."},{"key":"ref_35","unstructured":"Dym, N., and Kovalsky, S.Z. (November, January 27). Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration. Proceedings of the IEEE International Conference on Computer Vision, Seoul, Korea."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Yu, C., and Da, J. (2018). A Maximum Feasible Subsystem for Globally Optimal 3D Point Cloud Registration. Sensors, 18.","DOI":"10.3390\/s18020544"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"137232","DOI":"10.1109\/ACCESS.2019.2942380","article-title":"GO-APSR: A Globally Optimal Affine Point Set Registration Method","volume":"7","author":"Li","year":"2019","journal-title":"IEEE Access"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Hartley, R.I.A.Z. (2003). Multi-View Geometry in Computer Vision, Cambridge University Press.","DOI":"10.1017\/CBO9780511811685"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Yang, H., and Carlone, L. (2019, January 22\u201326). A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates. Proceedings of the Robotics: Science and Systems, Breisgau, Germany.","DOI":"10.15607\/RSS.2019.XV.003"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Yang, H., Shi, J., and Carlone, L. (2020). TEASER: Fast and Certifiable Point Cloud Registration. arXiv.","DOI":"10.1109\/TRO.2020.3033695"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., and Cloud, M.J. (2009). Introduction to Interval Analysis, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898717716"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Moore, R.E. (1979). Methods and Applications of Interval Analysis, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611970906"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Brown, M., Windridge, D., and Guillemaut, J. (2015, January 8\u201312). Globally Optimal 2D-3D Registration from Points or Lines Without Correspondences. Proceedings of the IEEE International Conference on Computer Vision, Boston, MA, USA.","DOI":"10.1109\/ICCV.2015.244"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TPAMI.2018.2848650","article-title":"Globally-Optimal Inlier Set Maximisation for Camera Pose and Correspondence Estimation","volume":"42","author":"Campbell","year":"2020","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s11263-008-0186-9","article-title":"Global Optimization through Rotation Space Search","volume":"82","author":"Hartley","year":"2009","journal-title":"Int. J. Comput. Vision"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s11263-005-3221-0","article-title":"A Novel Representation and Feature Matching Algorithm for Automatic Pairwise Registration of Range Images","volume":"66","author":"Mian","year":"2006","journal-title":"Int. J. Comput. Vision"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1584","DOI":"10.1109\/TPAMI.2006.213","article-title":"Three-Dimensional Model-Based Object Recognition and Segmentation in Cluttered Scenes","volume":"28","author":"Mian","year":"2006","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_48","unstructured":"(2020, June 01). Available online: http:\/\/graphics.stanford.edu\/data\/3Dscanrep\/."},{"key":"ref_49","unstructured":"(2020, June 01). Available online: https:\/\/lgg.epfl.ch\/statues_dataset.php."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/20\/15\/4103\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:51:07Z","timestamp":1760176267000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/20\/15\/4103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,23]]},"references-count":49,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2020,8]]}},"alternative-id":["s20154103"],"URL":"https:\/\/doi.org\/10.3390\/s20154103","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2020,7,23]]}}}