Filtered Iterative Denoising for Linear Inverse Problems

Danica Fliss, Willem Marais, Robert D. NowakarXiv 2023 · DOI · arXiv

In the world of signal and image processing, we often face "linear inverse problems." Whether it's deblurring a photo, reconstructing an MRI, or cleaning up satellite imagery, the goal is the same: recover a clean signal $x$ from noisy, distorted observations $y = Ax + \epsilon$.

Modern "Plug-and-Play" (PnP) methods have become the gold standard for this. They allow researchers to take a powerful, pre-trained black-box denoiser (like BM3D or a Deep Neural Network) and "plug" it into an iterative algorithm. However, there’s a catch: these denoisers are usually "blind" to the specific physics of the distortion (the operator $A$).

A new paper, "Filtered Iterative Denoising for Linear Inverse Problems," by Fliss, Marias, and Nowak, proposes a clever workaround. Instead of trying to retrain the denoiser for every specific problem, they suggest we should be fixing the gradient update step instead.

TL;DR

The authors introduce Filtered Iterative Denoising (FIDA), an algorithm that adapts "plug-and-play" denoising to specific inverse problems by applying a linear filter to the gradient update. This simple modification allows off-the-shelf denoisers to account for the distortion operator $A$, leading to significantly better image restoration without the need for custom-trained models.

What Problem Does This Paper Address?

Standard Iterative Denoising Algorithms (IDAs) work by alternating between two steps:

  1. Gradient Descent: Move the current estimate closer to the data.
  2. Denoising: Clean up the estimate using a regularizer (the "plug-and-play" denoiser).

The problem is that the denoiser doesn't know about $A$. If $A$ is a blur operator, it attenuates high frequencies. A standard denoiser might treat the remaining high-frequency noise the same way it treats noise in a sharp image, leading to over-smoothing or artifacts.

To get the best results, you'd traditionally need to "re-learn" or tune a denoiser specifically for that blur operator—a process that is computationally expensive and defeats the "plug-and-play" convenience.

Methods

The authors propose FIDA, which modifies the gradient update step using insights from Wavelet-Vaguelette Decomposition (WVD).

Instead of the standard gradient update: $$\tilde{x}^{k+1} \leftarrow x^k + \gamma A^T(y - Ax^k)$$

FIDA uses a filtered gradient: $$\tilde{x}^{k+1} \leftarrow x^k + \gamma \Psi \Delta^\dagger \Psi^T A^T(y - Ax^k)$$

What’s happening here? * $\Psi$: A sparsifying basis (like wavelets). * $\Delta^\dagger$: A diagonal "filtering" matrix. It acts as a scaling factor that accounts for how much the operator $A$ attenuated specific components of the signal.

Essentially, FIDA "boosts" the parts of the gradient that the operator $A$ weakened. This ensures that when the iterate reaches the denoiser, the noise levels across different frequencies are balanced in a way the denoiser can handle effectively.

Datasets

The researchers evaluated FIDA using 10 standard grayscale images (256x256), including classics like "peppers," "camera," and "house." They tested two main forward models:

  1. Gaussian Blur: Simulating standard image deblurring.
  2. Variable Sensor Gain: A specific problem in satellite imaging (VIIRS Day-Night Band) where sensors have different gain factors, creating "striping" artifacts.

They compared FIDA against standard IDA using the BM3D denoiser as the black-box component.

Key Insights and Ideas

  • Adapt the Step, Not the Tool: The "aha moment" is realizing that we don't need to change the denoiser if we change the input to the denoiser. By filtering the gradient, we make the optimization landscape more "denoiser-friendly."
  • Frequency-Aware Regularization: FIDA effectively implements a frequency-dependent threshold. It recognizes that in inverse problems, the "effective" noise level isn't uniform; it depends on how the operator $A$ interacts with the signal.
  • Theoretical Bridge: The paper elegantly bridges classical signal processing theory (WVD and $\ell_1$ regularization) with modern iterative PnP frameworks.

Key Results

  • Deblurring Excellence: In low-noise deblurring scenarios ($\sigma = 0.2$), FIDA (specifically the wavelet-based version, W-FIDA) outperformed standard IDA by significant margins—often 2 to 3 dB in PSNR.
  • Satellite Imaging: For the variable sensor gain problem, FIDA produced much cleaner images with fewer striping artifacts compared to standard methods (see Figure 1 in the paper).
  • Robustness: While standard IDA sometimes had a slightly higher PSNR in very high-noise deblurring cases, visual inspection showed that FIDA did a much better job of preserving fine structures and removing structured noise.

Limitations and Future Work

  • Basis Dependency: The performance of FIDA depends on choosing a good sparsifying basis $\Psi$. While wavelets work well for images, other types of data might require different bases.
  • Early Stopping: The authors noted that FIDA's performance can sometimes dip if run for too many iterations, suggesting that "early stopping" or additional regularization might be needed for maximum stability.
  • Future Directions: The authors suggest exploring FIDA for more complex problems like tomographic reconstruction and super-resolution, and even learning the optimal filtering matrix $\Delta^\dagger$ directly from data.

Summary updated

Abstract

Iterative denoising algorithms (IDAs) have been tremendously successful in a range of linear inverse problems arising in signal and image processing. The classic instance of this is the famous Iterative Soft-Thresholding Algorithm (ISTA), based on soft-thresholding of wavelet coefficients. More modern approaches to IDAs replace soft-thresholding with a black-box denoiser, such as BM3D or a learned deep neural network denoiser. These are often referred to as ``plug-and-play" (PnP) methods because, in principle, an off-the-shelf denoiser can be used for a variety of different inverse problems. The problem with PnP methods is that they may not provide the best solutions to a specific linear inverse problem; better solutions can often be obtained by a denoiser that is customized to the problem domain. A problem-specific denoiser, however, requires expensive re-engineering or re-learning which eliminates the simplicity and ease that makes PnP methods attractive in the first place. This paper proposes a new IDA that allows one to use a general, black-box denoiser more effectively via a simple linear filtering modification to the usual gradient update steps that accounts for the specific linear inverse problem. The proposed Filtered IDA (FIDA) is mathematically derived from the classical ISTA and wavelet denoising viewpoint. We show experimentally that FIDA can produce superior results compared to existing IDA methods with BM3D.
BibTeX
@misc{fliss2023filtered,
  author = {Danica Fliss and Willem Marais and Robert D. Nowak},
  title = {{Filtered Iterative Denoising for Linear Inverse Problems}},
  year = {2023},
  eprint = {2302.07972},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2302.07972},
}

Loading related content...

Figure