Total variation minimization and a class of binary MRF models

Total variation minimization and a class of binary MRF models
复制标题

DOI:
10.1007/11585978_10
复制
发表时间:
2005-01-01
期刊:
ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS
影响因子:
--
通讯作者:
Chambolle, A
Chambolle, A
中科院分区:
其他
文献类型:
--
作者:
Chambolle, A

文献摘要

被引文献

相似文献

我们观察到,一类简单的二进制MRF能量与鲁丁 - X骨 - 佛特米(ROF)的总变异方法之间的整个类别的二元MRF能量之间存在很强的联系。我们更准确地说,可以通过最大程度地减少适当的ROF问题,反之亦然来找到二进制MRF的解决方案。这导致了新的算法。然后,我们比较各种算法的效率。
We observe that there is a strong connection between a whole class of simple binary MRF energies and the Rudin-Osher-Fatemi (ROF) Total Variation minimization approach to image denoising. We show, more precisely, that solutions to binary MRFs can be found by minimizing an appropriate ROF problem, and vice-versa. This leads to new algorithms. We then compare the efficiency of various algorithms.