Accelerated graph-based nonlinear denoising filters

12/01/2015
by   Andrew Knyazev, et al.
0

Denoising filters, such as bilateral, guided, and total variation filters, applied to images on general graphs may require repeated application if noise is not small enough. We formulate two acceleration techniques of the resulted iterations: conjugate gradient method and Nesterov's acceleration. We numerically show efficiency of the accelerated nonlinear filters for image denoising and demonstrate 2-12 times speed-up, i.e., the acceleration techniques reduce the number of iterations required to reach a given peak signal-to-noise ratio (PSNR) by the above indicated factor of 2-12.

READ FULL TEXT

page 6

page 7

page 8

research
09/14/2019

Performance Analysis of Spatial and Transform Filters for Efficient Image Noise Reduction

During the acquisition of an image from its source, noise always becomes...
research
09/08/2015

Accelerated graph-based spectral polynomial filters

Graph-based spectral denoising is a low-pass filtering using the eigende...
research
09/10/2014

Image Denoising using New Adaptive Based Median Filters

Noise is a major issue while transferring images through all kinds of el...
research
09/04/2015

Chebyshev and Conjugate Gradient Filters for Graph Image Denoising

In 3D image/video acquisition, different views are often captured with v...
research
10/21/2020

Unrolling of Deep Graph Total Variation for Image Denoising

While deep learning (DL) architectures like convolutional neural network...
research
07/06/2010

Bilateral filters: what they can and cannot do

Nonlinear bilateral filters (BF) deliver a fine blend of computational s...
research
05/16/2023

Selective Guidance: Are All the Denoising Steps of Guided Diffusion Important?

This study examines the impact of optimizing the Stable Diffusion (SD) g...

Please sign up or login with your details

Forgot password? Click here to reset