.png){kind=icon}
返回
Acceleration methods for total variation-based image denoising
.png){kind=icon}
OA
AI
DOI：10.1137/S106482750241534X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we apply a fixed point method to solve the total variation-based image denoising problem. An algebraic multigrid method is used to solve the corresponding linear equations. Krylov subspace acceleration is adopted to improve convergence in the fixed point iteration. A good initial guess for this outer iteration at finest grid is obtained by combining fixed point iteration and geometric multigrid interpolation successively from the coarsest grid to the. nest grid. Numerical experiments demonstrate that this method is efficient and robust even for images with large noise-to-signal ratios.
Keyword:
image denoising
total variation
fixed point method
algebraic multigrid method
Krylov acceleration
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
Power system reliability and its assessment. Part 2: Composite generation and transmission systems
PREAI
分享收藏分享收藏
查看更多内容