首页|A New Algorithm for Total Variation Based Image Denoising

A New Algorithm for Total Variation Based Image Denoising

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
We propose a new algorithm for the total variation based on image denoising problem.The split Bregman method is used to convert an unconstrained minimization denoising problem to a linear system in the outer iteration.An algebraic multi-grid method is applied to solve the linear system in the inner iteration.Furthermore,Krylov subspace acceleration is adopted to improve convergence in the outer iteration.Numerical experiments demonstrate that this algorithm is efficient even for images with large signal-to-noise ratio.

image denoisingtotal variationsplit Bregman methodalgebraic multi-grid methodKrylov subspace acceleration

Yi-ping XU

展开 >

School of Science, Southwest University of Science and Technology, Mianyang 621010, China

Youth Foundation of Southwest University of Science and Technology

11zx3126

2012

10.1007/s10255-012-0184-0

应用数学学报(英文版)
中国科学院应用数学研究所 中国数学会

应用数学学报(英文版)

CSTPCDCSCDSCI
影响因子：0.149
ISSN：0168-9673
年,卷(期)：2012.28(4)
  • 2
  • 26