Kutbi Mohammed, Chang Yizhe, Mordohai Philippos
Department of Computer Science, Saudi Electronic University, Jeddah, Saudi Arabia.
Department of Mechanical Engineering, California State Polytechnic University, Pomona, CA 91768, USA.
Pattern Recognit Lett. 2021 Oct;150:101-107. doi: 10.1016/j.patrec.2021.07.007. Epub 2021 Jul 21.
We present an approach for motion clustering based on a novel observation that a signature for putative pixel correspondences can be generated by collecting their residuals with respect to model hypotheses drawn randomly from the data. Inliers of the same motion cluster should have strongly correlated residuals, which are low when a hypothesis is consistent with the data in the cluster and high otherwise. After evaluating a number of hypotheses, members of the same cluster can be identified based on these correlations. Due to this property, we named our approach . An important advantage of ICR is that it does not require an inlier-outlier threshold or parameter tuning. In addition, we propose a supervised recursive formulation of ICR (r-ICR) that, unlike many motion clustering methods, does not require the number of clusters to be known a priori, as long as annotated data are available for training. We validate ICR and r-ICR on several publicly available datasets for robust geometric model fitting.
我们提出了一种基于新颖观察结果的运动聚类方法,即通过收集相对于从数据中随机抽取的模型假设的残差,可以生成假定像素对应关系的签名。同一运动聚类的内点应该具有高度相关的残差,当假设与聚类中的数据一致时残差较低,否则残差较高。在评估了多个假设之后,可以根据这些相关性识别同一聚类的成员。由于这一特性,我们将我们的方法命名为。ICR的一个重要优点是它不需要内点-外点阈值或参数调整。此外,我们提出了一种ICR的监督递归公式(r-ICR),与许多运动聚类方法不同,只要有带注释的数据可用于训练,它不需要事先知道聚类的数量。我们在几个公开可用的数据集上验证了ICR和r-ICR,以进行稳健的几何模型拟合。