Euclid in a Taxicab: Sparse Blind Deconvolution with Smoothed l1/l2 Regularization

Abstract

The l1/l2 ratio regularization function has shown good performance for retrieving sparse signals in a number of recent works, in the context of blind deconvolution. Indeed, it benefits from a scale invariance property much desirable in the blind context. However, the l1/l2 function raises some difficulties when solving the nonconvex and nonsmooth minimization problems resulting from the use of such a penalty term in current restoration methods. In this paper, we propose a new penalty based on a smooth approximation to the l1/l2 function. In addition, we develop a proximal-based algorithm to solve variational problems involving this function and we derive theoretical convergence results. We demonstrate the effectiveness of our method through a comparison with a recent alternating optimization strategy dealing with the exact l1/l2 term, on an application to seismic data blind deconvolution.

arXiv comment5 pages

References in corpus (3)

• A SURE Approach for Digital Signal/Image Deconvolution Problems
• A Primal-Dual Proximal Algorithm for Sparse Template-Based Adaptive Filtering: Application to Seismic Multiple Removal
• Sparse K-Means with ${\ell }_{\infty }/{\ell }_0$ Penalty for High-Dimensional Data Clustering

Cited by in corpus (17)

• Accelerated Schemes for the $L_1/L_2$ Minimization
• Unknown sparsity in compressed sensing: Denoising and inference
• Enhanced Sparsity by Non-Separable Regularization
• A Penalty Function Promoting Sparsity Within and Across Groups
• SPOQ ${\ell }_p$-Over-${\ell }_q$ Regularization for Sparse Signal Recovery applied to Mass Spectrometry
• CHOPtrey: contextual online polynomial extrapolation for enhanced multi-core co-simulation of complex systems
• Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm -- Extended Version
• DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures
• Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints
• A Scale Invariant Approach for Sparse Signal Recovery
• Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently
• Fast L1-L2 minimization via a proximal operator
• A regularized tri-linear approach for optical interferometric imaging
• Block Distributed Majorize-Minimize Memory Gradient Algorithm and its application to 3D image restoration
• A Non-Convex Optimization Technique for Sparse Blind Deconvolution -- Initialization Aspects and Error Reduction Properties
• A Noise-Robust Method with Smoothed \ell_1/\ell_2 Regularization for Sparse Moving-Source Mapping
• Sparsity Emerges Naturally in Neural Language Models