Resolving Motion Correspondence for Densely Moving Points
Resolving Motion Correspondence for Densely Moving Points
复制标题
DOI：
10.1109/34.899946
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
C. Veenman;M. Reinders;E. Backer
中科院分区：
文献类型：
--
作者：
C. Veenman;M. Reinders;E. Backer
研究存在多种定性和统计解的运动对应问题。我们专注于定性建模，特别是在分配冲突的情况下，因为多个特征竞争一个检测点或因为多个检测点匹配一个特征点而出现分配冲突。我们省略了点轨迹开始和终止的可能性，因为这主要与允许临时性的点遮挡相冲突。我们引入了单独的、组合的和全局的运动模型，并在这个框架中适合现有的定性解决方案。此外，我们还提出了一种在贪婪匹配意义上满足这些可能受约束的模型的跟踪算法，包括一种处理检测错误和遮挡的有效方法。性能评估表明，该算法的性能优于现有的贪婪匹配算法。最后，我们描述了跟踪器的一个扩展，它允许自动初始化点轨迹。实验表明，该算法是有效的，对较少的参数几乎不敏感，并且在定性上优于其他算法，包括假定的最优统计多假设跟踪器。
Studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist. We concentrate on qualitative modeling, especially in situations where assignment conflicts arise either because multiple features compete for one detected point or because multiple detected points fit a single feature point. We leave out the possibility of point track initiation and termination because that principally conflicts with allowing for temporary point occlusion. We introduce individual, combined, and global motion models and fit existing qualitative solutions in this framework. Additionally, we present a tracking algorithm that satisfies these-possibly constrained-models in a greedy matching sense, including an effective way to handle detection errors and occlusion. The performance evaluation shows that the proposed algorithm outperforms existing greedy matching algorithms. Finally, we describe an extension to the tracker that enables automatic initialization of the point tracks. Several experiments show that the extended algorithm is efficient, hardly sensitive to its few parameters, and qualitatively better than other algorithms, including the presumed optimal statistical multiple hypothesis tracker.