On sparse reconstruction from Fourier and Gaussian measurements
From MaRDI portal
Publication:3515060
DOI10.1002/cpa.20227zbMath1149.94010arXivmath/0602559OpenAlexW2055064119WikidataQ98839632 ScholiaQ98839632MaRDI QIDQ3515060
M. V. Rudel'son, R. V. Vershinin
Publication date: 24 July 2008
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602559
Related Items
Randomized numerical linear algebra: Foundations and algorithms ⋮ Compressed data separation via unconstrained l1-split analysis ⋮ A Novel Compressed Sensing Scheme for Photoacoustic Tomography ⋮ Compressive Sensing with Redundant Dictionaries and Structured Measurements ⋮ Quantization and Compressive Sensing ⋮ Cosparsity in Compressed Sensing ⋮ Hyperspherical Sparse Approximation Techniques for High-Dimensional Discontinuity Detection ⋮ Extracting Sparse High-Dimensional Dynamics from Limited Data ⋮ Suprema of Chaos Processes and the Restricted Isometry Property ⋮ Stable Image Reconstruction Using Transformed Total Variation Minimization ⋮ Improved bounds for the RIP of Subsampled Circulant matrices ⋮ Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ Sparse multi-reference alignment: phase retrieval, uniform uncertainty principles and the beltway problem ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ POST-SELECTION INFERENCE IN THREE-DIMENSIONAL PANEL DATA ⋮ A unified approach to uniform signal recovery from nonlinear observations ⋮ Nonlinear Iterative Hard Thresholding for Inverse Scattering ⋮ Sampling rates for \(\ell^1\)-synthesis ⋮ Importance sampling in signal processing applications ⋮ Enhanced total variation minimization for stable image reconstruction ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Guarantees of total variation minimization for signal recovery ⋮ Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information ⋮ Time for dithering: fast and quantized random embeddings via the restricted isometry property ⋮ Polynomial approximation via compressed sensing of high-dimensional functions on lower sets ⋮ Stable low-rank matrix recovery via null space properties ⋮ Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification ⋮ Concentration of the Frobenius Norm of Generalized Matrix Inverses ⋮ Short-Term Memory Capacity in Networks via the Restricted Isometry Property ⋮ An Introduction to Compressed Sensing ⋮ Quantized Compressed Sensing: A Survey ⋮ Classification Scheme for Binary Data with Extensions ⋮ CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Persistent homology for low-complexity models ⋮ Mathematics of Analog‐to‐Digital Conversion ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ Unnamed Item ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Unnamed Item ⋮ Sparse recovery from extreme eigenvalues deviation inequalities ⋮ Prony methods for recovery of structured functions ⋮ Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces ⋮ On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel ⋮ Iteratively reweighted least squares minimization for sparse recovery ⋮ On the Role of Total Variation in Compressed Sensing ⋮ Exploring the toolkit of Jean Bourgain ⋮ An Improved Estimate in the Restricted Isometry Problem ⋮ Approximation Methods for the Recovery of Shapes and Images from Gradients ⋮ Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing ⋮ Tensor-Structured Sketching for Constrained Least Squares ⋮ Nonuniform recovery of fusion frame structured sparse signals ⋮ The gap between the null space property and the restricted isometry property ⋮ Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery ⋮ Derandomizing restricted isometries via the Legendre symbol ⋮ Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames ⋮ Improved bounds for sparse recovery from subsampled random convolutions ⋮ On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization ⋮ Sigma delta quantization with harmonic frames and partial Fourier ensembles ⋮ Improved sparse Fourier approximation results: Faster implementations and stronger guarantees ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ A class of deterministic sensing matrices and their application in harmonic detection ⋮ Deterministic convolutional compressed sensing matrices ⋮ Chaining, interpolation and convexity II: the contraction principle ⋮ Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property ⋮ Recovery error analysis of noisy measurement in compressed sensing ⋮ Explicit universal sampling sets in finite vector spaces ⋮ Generalized notions of sparsity and restricted isometry property. II: Applications ⋮ The springback penalty for robust signal recovery ⋮ The restricted isometry property for time-frequency structured random matrices ⋮ Stable super-resolution limit and smallest singular value of restricted Fourier matrices ⋮ \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? ⋮ Performance analysis of the compressed distributed least squares algorithm ⋮ Subspaces and orthogonal decompositions generated by bounded orthogonal systems ⋮ Generic error bounds for the generalized Lasso with sub-exponential data ⋮ Full spark frames ⋮ Remote sensing via \(\ell_1\)-minimization ⋮ Iterative hard thresholding for compressed data separation ⋮ Stability of the elastic net estimator ⋮ Restricted isometries for partial random circulant matrices ⋮ Compressed sensing and matrix completion with constant proportion of corruptions ⋮ A multivariate generalization of Prony's method ⋮ Sparse Legendre expansions via \(\ell_1\)-minimization ⋮ Phase transitions for greedy sparse approximation algorithms ⋮ Analysis \(\ell_1\)-recovery with frames and Gaussian measurements ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ A Rice method proof of the null-space property over the Grassmannian ⋮ Interpolation via weighted \(\ell_{1}\) minimization ⋮ Explicit constructions of RIP matrices and related problems ⋮ Compressive Sensing ⋮ Noncommutative Bennett and Rosenthal inequalities ⋮ Sparse polynomial interpolation in Chebyshev bases ⋮ On deterministic sketching and streaming for sparse recovery and norm estimation ⋮ Least squares after model selection in high-dimensional sparse models ⋮ Numerically erasure-robust frames ⋮ The restricted isometry property for random block diagonal matrices ⋮ On the uniform convergence of empirical norms and inner products, with application to causal inference ⋮ On the conditioning of random subdictionaries ⋮ Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) ⋮ A new perspective on least squares under convex constraint ⋮ The road to deterministic matrices with the restricted isometry property ⋮ Steiner equiangular tight frames ⋮ Discrete uncertainty principles and sparse signal processing ⋮ Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling ⋮ Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ Spark-level sparsity and the \(\ell_1\) tail minimization ⋮ Sparse recovery under weak moment assumptions ⋮ Sparse signal recovery using a new class of random matrices ⋮ Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO ⋮ Row products of random matrices ⋮ Sparsity in time-frequency representations ⋮ On uncertainty principles in the finite dimensional setting ⋮ Compressed sensing with coherent and redundant dictionaries ⋮ Compressive wave computation ⋮ A numerical exploration of compressed sampling recovery ⋮ Compressed data separation via dual frames based split-analysis with Weibull matrices ⋮ Greedy variance estimation for the LASSO ⋮ Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\) ⋮ On the number of harmonic frames ⋮ Sparse space-time models: concentration inequalities and Lasso ⋮ Resolution Analysis of Imaging with $\ell_1$ Optimization ⋮ Estimation in High Dimensions: A Geometric Perspective ⋮ Convex Recovery of a Structured Signal from Independent Random Linear Measurements ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs ⋮ Majorizing measures and proportional subsets of bounded orthonormal systems ⋮ Fast and RIP-optimal transforms ⋮ Iterative hard thresholding for compressed sensing ⋮ On risk bounds in isotonic and other shape restricted regression problems ⋮ Data-driven algorithm selection and tuning in optimization and signal processing ⋮ A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing ⋮ Matrix-free interior point method for compressed sensing problems ⋮ CoSaMP: Iterative signal recovery from incomplete and inaccurate samples ⋮ Erasure recovery matrices for encoder protection ⋮ Sharp oracle inequalities for low-complexity priors ⋮ Optimal fast Johnson-Lindenstrauss embeddings for large data sets ⋮ Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit ⋮ Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit ⋮ On the strong restricted isometry property of Bernoulli random matrices ⋮ Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction ⋮ Sparse reconstruction with multiple Walsh matrices ⋮ Structured iterative hard thresholding with on- and off-grid applications ⋮ Preserving injectivity under subgaussian mappings and its application to compressed sensing ⋮ On the predictive risk in misspecified quantile regression ⋮ Quantized compressed sensing for random circulant matrices ⋮ Fast and memory-optimal dimension reduction using Kac's walk ⋮ A partial derandomization of phaselift using spherical designs ⋮ AdaBoost and robust one-bit compressed sensing ⋮ Lasso and probabilistic inequalities for multivariate point processes ⋮ New analysis of manifold embeddings and signal recovery from compressive measurements ⋮ High-dimensional linear models with many endogenous variables ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Cites Work
