Wang Gang
IEEE Trans Neural Netw Learn Syst. 2024 Jul;35(7):9213-9225. doi: 10.1109/TNNLS.2022.3231652. Epub 2024 Jul 8.
The main problems in point registration involve recovering correspondences and estimating transformations, especially in a fully unsupervised way without any feature descriptors. In this work, we propose a robust point matching method using discrete optimal transport (OT), which is a natural and useful approach for assignment tasks, to recover the underlying correspondences and improve the nonrigid registration in the presence of unknown global transformations. Specifically, we cast the registration problem as a joint estimation over local transport couplings and global transformations, observing that the local neighborhood topology structures should be preserved strongly and stably for nonrigid transformations. By solving the Gromov-Wasserstein discrepancy, a smooth assignment matrix from one point set to another can be recovered in a fully unsupervised way. Registration performance can be improved by applying an unsupervised map to guide the transformation estimate under the alternating optimization. Experimental results on several datasets reveal how the presented method is superior to the state-of-the-art methods when facing large data degradations.
点配准中的主要问题包括恢复对应关系和估计变换,特别是在完全无监督的方式下且没有任何特征描述符的情况下。在这项工作中,我们提出了一种使用离散最优传输(OT)的鲁棒点匹配方法,这是一种用于分配任务的自然且有用的方法,用于在存在未知全局变换的情况下恢复潜在的对应关系并改进非刚性配准。具体而言,我们将配准问题视为对局部传输耦合和全局变换的联合估计,观察到对于非刚性变换,局部邻域拓扑结构应得到强烈且稳定的保留。通过求解格罗莫夫 - 瓦瑟斯坦差异,可以以完全无监督的方式从一个点集恢复到另一个点集的平滑分配矩阵。通过应用无监督映射来指导交替优化下的变换估计,可以提高配准性能。在几个数据集上的实验结果揭示了所提出的方法在面对大数据退化时如何优于现有方法。