How Much Can A Gaussian Smoother Denoise?

被引:0
|
作者
Gubbi, Sagar Venkatesh [1 ]
Gupta, Ashutosh [2 ]
Seelamantula, Chandra Sekhar [3 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
[2] Indian Space Res Org, Ahmadabad 380058, Gujarat, India
[3] Indian Inst Sci, Dept Elect Engn, Bangalore 560012, Karnataka, India
来源
TENTH INDIAN CONFERENCE ON COMPUTER VISION, GRAPHICS AND IMAGE PROCESSING (ICVGIP 2016) | 2016年
关键词
Image denoising; Gaussian smoothing; Stein's lemma; generic risk estimation; spatially varying smoothers; graphics processing unit (GPU); LEARNED DICTIONARIES; BIVARIATE SHRINKAGE; WAVELET SHRINKAGE; IMAGE; SURE; ALGORITHMS; TRANSFORM; SPARSE; DOMAIN;
D O I
10.1145/3009977.3010027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, a suite of increasingly sophisticated methods have been developed to suppress additive noise from images. Most of these methods take advantage of sparsity of the underlying signal in a specific transform domain to achieve good visual or quantitative results. These methods apply relatively complex statistical modelling techniques to bifurcate the noise from the signal. In this paper, we demonstrate that a spatially adaptive Gaussian smoother could be a very effective solution to the image denoising problem. To derive the optimal parameter estimates for the Gaussian smoothening kernel, we derive and deploy a surrogate of the mean squared error (MSE) risk similar to the Stein's estimator for Gaussian distributed noise. However, unlike the Stein's estimator or its counterparts for other noise distributions, the proposed generic risk estimator (GenRE) uses only first- and second-order moments of the noise distribution and is agnostic to the exact form of the noise distribution. By locally adapting the parameters of the Gaussian smoother, we obtain a denoising function that has a denoising performance (quantified by the peak signal-to-noise ratio (PSNR)) that is competitive to far more sophisticated methods reported in the literature. To avail the parallelism offered by the proposed method, we also provide a graphics processing unit (GPU) based implementation.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] How much improvement can precipitation data fusion achieve with a Multiscale Kalman Smoother-based framework?
    Wang, Shugong
    Liang, Xu
    Nan, Zhuotong
    WATER RESOURCES RESEARCH, 2011, 47
  • [2] How much does it cost? How much can be saved?
    Rhodes, RS
    SURGERY, 1999, 125 (01) : 102 - 103
  • [3] Non-Gaussian Signal Detection: How much can massive MIMO help?
    Peken, Ture
    Tandon, Ravi
    Bose, Tamal
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [4] How much can it cost?
    McGregor, A
    LANCET, 1999, 353 (9156): : 910 - 910
  • [5] How much more can it be?
    不详
    KGK-KAUTSCHUK GUMMI KUNSTSTOFFE, 2021, 74 (05): : 14 - 14
  • [6] How much Peanut can it be?
    不详
    ALLERGO JOURNAL, 2006, 15 (07) : 456 - 456
  • [7] Structure in talker variability: How much is there and how much can it help?
    Kleinschmidt, Dave F.
    LANGUAGE COGNITION AND NEUROSCIENCE, 2019, 34 (01) : 43 - 68
  • [8] How Much Warming are We Committed to and How Much can be Avoided?
    Bill Hare
    Malte Meinshausen
    Climatic Change, 2006, 75 : 111 - 149
  • [9] How much warming are we committed to and how much can be avoided?
    Hare, Bill
    Meinshausen, Malte
    CLIMATIC CHANGE, 2006, 75 (1-2) : 111 - 149
  • [10] Diffusion Gaussian Mixture Audio Denoise
    Wang, Pu
    Li, Junhui
    Lie, Jialu
    Guo, Liangdong
    Zhang, Youshan
    INTERSPEECH 2024, 2024, : 2200 - 2204