0


PMBP:对应场估计的PatchMatch信念传播

PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation
课程网址: http://videolectures.net/bmvc2012_besse_belief_propagation/  
主讲教师: Frederic Besse
开课单位: 伦敦大学学院
开课时间: 2012-10-09
课程语种: 英语
中文简介:
PatchMatch是一种简单但功能强大的连续标签优化方法。该算法主要由两个部分组成:通过采样更新解空间和利用空间邻域传播样本。我们展示了这些成分是如何在连续空间中以一种特定的信念传播形式,即粒子信念传播(PBP),与步骤相关联的。然而,到目前为止,PBP速度太慢,不允许使用复杂的状态空间。结果表明,将这两种方法结合起来,得到了一种新的算法PMBP,它比PatchMatch更准确,比PBP快了数量级。为了说明我们的PMBP方法的好处,我们建立了一种新的立体匹配算法,它使用一元术语,借用了最近的PatchMatch立体工作和新的现实的两两术语,提供平滑性。实验证明,该方法在亚像素精度水平上优于现有技术。
课程简介: PatchMatch is a simple, yet very powerful and successful method for optimizing continuous labelling problems. The algorithm has two main ingredients: the update of the solution space by sampling and the use of the spatial neighbourhood to propagate samples. We show how these ingredients are related to steps in a specific form of belief propagation in the continuous space, called Particle Belief Propagation (PBP). However, PBP has thus far been too slow to allow complex state spaces. We show that unifying the two approaches yields a new algorithm, PMBP, which is more accurate than PatchMatch and orders of magnitude faster than PBP. To illustrate the benefits of our PMBP method we have built a new stereo matching algorithm with unary terms which are borrowed from the recent PatchMatch Stereo work and novel realistic pairwise terms that provide smoothness. We have experimentally verified that our method is an improvement over state-of-the-art techniques at sub-pixel accuracy level.
关 键 词: 优化连续标记问题; 更新解空间; 空间邻域
课程来源: 视频讲座网
最后编审: 2021-02-04:nkq
阅读次数: 93