Accelerated graph-based nonlinear denoising filters
arXiv:1512.00389 · doi:10.1016/j.procs.2016.05.348
Abstract
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.
arXiv comment10 pages, 6 figures, to appear in Procedia Computer Science, vol.80, 2016, International Conference on Computational Science, San Diego, CA, USA, June 6-8, 2016
References in corpus (5)
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Acceleration of the shiftable O(1) algorithm for bilateral filtering and non-local means
- Chebyshev and Conjugate Gradient Filters for Graph Image Denoising
- Accelerated graph-based spectral polynomial filters
- Conjugate Gradient Acceleration of Non-Linear Smoothing Filters