Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit

DOI10.1109/TSP.2011.2160058MaRDI QIDQ4573235zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chaitanya Ekanadham, Daniel Tranchina, Eero P. Simoncelli

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2011.2160058

Mathematics Subject Classification ID

Approximation by other special function classes (41A30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(16)

• Sparsest piecewise-linear regression of one-dimensional data
• Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity
• A reweighted symmetric smoothed function approximating L₀-norm regularized sparse reconstruction method
• Sparse non-negative super-resolution -- simplified and stabilised
• When does OMP achieve exact recovery with continuous dictionaries?
• Compressive sensing in acoustic imaging
• Super-resolution of point sources via convex programming
• Multichannel blind deconvolution via maximum likelihood estimator: application in neural recordings
• Sparsity-Based MIMO Radars
• Geometry and symmetry in short-and-sparse deconvolution
• Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
• A fast homotopy algorithm for gridless sparse recovery
• Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
• The alternating descent conditional gradient method for sparse inverse problems
• ``FISTA in Banach spaces with adaptive discretisations
• Super-resolved Lasso

This page was built for publication: Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573235)