4.6 Article

PARAMETRIC MAXIMUM FLOW ALGORITHMS FOR FAST TOTAL VARIATION MINIMIZATION

期刊

SIAM JOURNAL ON SCIENTIFIC COMPUTING
卷 31, 期 5, 页码 3712-3743

出版社

SIAM PUBLICATIONS
DOI: 10.1137/070706318

关键词

maximum flow; minimum cut; graph cut; parametric maximum flow; total variation; image denoising; MRI

资金

  1. NSF [DMS 06-06712]
  2. ONR [N00014-03-0514, N00014-08-1-1118]
  3. DOE [DE-FG01-92ER-25126, DE-FG02-08ER25856]

向作者/读者索取更多资源

This report studies the global minimization of anisotropically discretized total variation (TV) energies with an L-p (in particular, L-1 and L-2) fidelity term using parametric maximum flow algorithms to minimize s-t cut representations of these energies. The TV/L-2 model, also known as the Rudin-Osher-Fatemi (ROF) model, is suitable for restoring images contaminated by Gaussian noise, while the TV/L-1 model is able to remove impulsive noise from grayscale images and perform multiscale decompositions of them. Preliminary numerical results on large-scale two-dimensional CT and three-dimensional brain MR images are presented to illustrate the effectiveness of these approaches.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据