Sampling rates for \(\ell^1\)-synthesis

DOI10.1007/s10208-022-09580-warXiv2004.07175OpenAlexW4293475952MaRDI QIDQ6142336

Claire Boyer, Pierre Weiss, Jonas Kahn, Maximilian März

Publication date: 21 December 2023

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.07175

zbMATH Keywords

inverse problemscompressed sensingsparse representationsredundant dictionariesGaussian mean widthcircumanglenon-uniform recoverysynthesis formulation

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Sampling theory in information and communication theory (94A20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A mathematical introduction to compressive sensing
• Finite frames. Theory and applications.
• On the prediction performance of the Lasso
• Compressed sensing with coherent and redundant dictionaries
• Inradius and circumradius of various convex cones arising in applications
• A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
• Preserving injectivity under subgaussian mappings and its application to compressed sensing
• Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
• On properties of different notions of centers for convex cones
• Some inequalities for Gaussian processes and applications
• On eigenvalues induced by a cone constraint.
• The cosparse analysis model and algorithms
• Linear programming, complexity theory and elementary functional analysis
• The convex geometry of linear inverse problems
• Adaptive risk bounds in univariate total variation denoising and trend filtering
• Greedy-like algorithms for the cosparse analysis model
• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• Normality and modulability indices. I: Convex cones in normed spaces
• Reconstruction and subgaussian operators in asymptotic geometric analysis
• Sparse Modeling for Image and Vision Processing
• Estimation in High Dimensions: A Geometric Perspective
• Convex Recovery of a Structured Signal from Independent Random Linear Measurements
• Condition
• Generalized methods and solvers for noise removal from piecewise constant signals. I. Background theory
• Graph Implementations for Nonsmooth Convex Programs
• A Variational Approach to Copositive Matrices
• Compressed sensing and best 𝑘-term approximation
• Compressive Sensing with Redundant Dictionaries and Structured Measurements
• On sparse reconstruction from Fourier and Gaussian measurements
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Sparse and Redundant Representations
• Compressed Sensing and Redundant Dictionaries
• Some NP-complete problems in quadratic and nonlinear programming
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• Robust analysis ℓ₁-recovery from Gaussian measurements and total variation minimization
• Guarantees of total variation minimization for signal recovery
• High-Dimensional Probability
• A generalized uncertainty principle and sparse representation in pairs of bases
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• A Projection Pursuit Algorithm for Exploratory Data Analysis
• 10.1162/153244303321897690
• Matching pursuits with time-frequency dictionaries
• Effective Condition Number Bounds for Convex Regularization
• Living on the edge: phase transitions in convex programs with random data
• A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets
• Analysis versus synthesis in signal priors
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
• Upper and Lower Bounds for Stochastic Processes
• Towards a Mathematical Theory of Super‐resolution
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Convex Analysis
• Compressed sensing