Sparse Recovery and Dictionary Learning from Nonlinear Compressive Measurements

Abstract

Sparse coding and dictionary learning are popular techniques for linear inverse problems such as denoising or inpainting. However in many cases, the measurement process is nonlinear, for example for clipped, quantized or 1-bit measurements. These problems have often been addressed by solving constrained sparse coding problems, which can be difficult to solve, and assuming that the sparsifying dictionary is known and fixed. Here we propose a simple and unified framework to deal with nonlinear measurements. We propose a cost function that minimizes the distance to a convex feasibility set, which models our knowledge about the nonlinear measurement. This provides an unconstrained, convex, and differentiable cost function that is simple to optimize, and generalizes the linear least squares cost commonly used in sparse coding. We then propose proximal based sparse coding and dictionary learning algorithms, that are able to learn directly from nonlinearly corrupted signals. We show how the proposed framework and algorithms can be applied to clipped, quantized and 1-bit data.

References in corpus (19)

• Discussion of "Least angle regression" by Efron et al
• Rejoinder to "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
• Simultaneous Codeword Optimization (SimCO) for Dictionary Update and Learning
• Quantized Iterative Hard Thresholding: Bridging 1-bit and High-Resolution Quantized Compressed Sensing
• Consistent Basis Pursuit for Signal and Matrix Estimates in Quantized Compressed Sensing
• Dictionary Learning for Blind One Bit Compressed Sensing
• Dictionary Learning for Deblurring and Digital Zoom
• Robust 1-bit Compressive Sensing via Gradient Support Pursuit
• Revisiting Synthesis Model of Sparse Audio Declipper
• Online Learning for Matrix Factorization and Sparse Coding

Cited by in corpus (9)

• A survey and an extensive evaluation of popular audio declipping methods
• Computing One-bit Compressive Sensing via Double-Sparsity Constrained Optimization
• VoiceFixer: Toward General Speech Restoration with Neural Vocoder
• Recovery Conditions of Sparse Signals Using Orthogonal Least Squares-Type Algorithms
• Learning Nonlinear Mixtures: Identifiability and Algorithm
• Sparse and Cosparse Audio Dequantization Using Convex Optimization
• Flexible framework for audio reconstruction
• Audio Dequantization Using (Co)Sparse (Non)Convex Methods
• Unlimited Sampling Theorem Based on Fractional Fourier Transform