Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration

Abstract

A fruitful approach for solving signal deconvolution problems consists of resorting to a frame-based convex variational formulation. In this context, parallel proximal algorithms and related alternating direction methods of multipliers have become popular optimization techniques to approximate iteratively the desired solution. Until now, in most of these methods, either Lipschitz differentiability properties or tight frame representations were assumed. In this paper, it is shown that it is possible to relax these assumptions by considering a class of non necessarily tight frame representations, thus offering the possibility of addressing a broader class of signal restoration problems. In particular, it is possible to use non necessarily maximally decimated filter banks with perfect reconstruction, which are common tools in digital signal processing. The proposed approach allows us to solve both frame analysis and frame synthesis problems for various noise distributions. In our simulations, it is applied to the deconvolution of data corrupted with Poisson noise or Laplacian noise by using (non-tight) discrete dual-tree wavelet representations and filter bank structures.

References in corpus (3)

• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• Restoration of Poissonian Images Using Alternating Direction Optimization
• Image Analysis Using a Dual-Tree $M$-Band Wavelet Transform

Cited by in corpus (5)

• Deconvolving Images with Unknown Boundaries Using the Alternating Direction Method of Multipliers
• A Non-Local Structure Tensor Based Approach for Multicomponent Image Recovery Problems
• Compressive Deconvolution in Medical Ultrasound Imaging
• Joint reconstruction strategy for structured illumination microscopy with unknown illuminations
• Epigraphical splitting for solving constrained convex formulations of inverse problems with proximal tools