Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
From MaRDI portal
Publication:3548002
DOI10.1109/TIT.2006.885507zbMath1309.94033arXivmath/0410542OpenAlexW2129638195WikidataQ56813489 ScholiaQ56813489MaRDI QIDQ3548002
Emmanuel J. Candès, Terence C. Tao
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0410542
Related Items
Solution of the problem on image reconstruction in computed tomography, Best subset selection via a modern optimization lens, Gaussian approximations in high dimensional estimation, Derandomizing restricted isometries via the Legendre symbol, A model of regularization parameter determination in low-dose X-ray CT reconstruction based on dictionary learning, Compressed sensing image restoration based on data-driven multi-scale tight frame, Conjugate gradient acceleration of iteratively re-weighted least squares methods, Compressed sensing and dynamic mode decomposition, Off-grid DOA estimation via real-valued sparse Bayesian method in compressed sensing, Deterministic convolutional compressed sensing matrices, Ensemble extreme learning machine and sparse representation classification, Low rank matrix recovery from rank one measurements, Robust sparse phase retrieval made easy, A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions, The essential ability of sparse reconstruction of different compressive sensing strategies, Waveform design and high-resolution imaging of cognitive radar based on compressive sensing, Influence factors of sparse microwave imaging radar system performance: approaches to waveform design and platform motion analysis, Sparse microwave imaging: principles and applications, Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging, Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain, A novel cognitive ISAR imaging method with random stepped frequency chirp signal, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, The restricted isometry property for time-frequency structured random matrices, Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization, Empirical processes with a bounded \(\psi_1\) diameter, Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions, The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\), Effective band-limited extrapolation relying on Slepian series and \(\ell^1\) regularization, A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations. II: Adaptivity and generalizations, Restricted normal cones and sparsity optimization with affine constraints, Remote sensing via \(\ell_1\)-minimization, Analog random coding, Nonconvex compressed sampling of natural images and applications to compressed MR imaging, Restricted isometries for partial random circulant matrices, Sparse Legendre expansions via \(\ell_1\)-minimization, Multiscale stochastic preconditioners in non-intrusive spectral projection, Dense fast random projections and Lean Walsh transforms, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, The residual method for regularizing ill-posed problems, Two-dimensional digital filters with sparse coefficients, Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization, Two are better than one: fundamental parameters of frame coherence, Sparsity enforcing edge detection method for blurred and noisy Fourier data, Testing the nullspace property using semidefinite programming, On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization, An implementable proximal point algorithmic framework for nuclear norm minimization, Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling, Explicit constructions of RIP matrices and related problems, 2D sparse signal recovery via 2D orthogonal matching pursuit, Sparse regression learning by aggregation and Langevin Monte-Carlo, A note on the complexity of \(L _{p }\) minimization, Improving the \( k\)-\textit{compressibility} of hyper reduced order models with moving sources: applications to welding and phase change problems, Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification, Robust face recognition via block sparse Bayesian learning, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, Sparse time-frequency representation of nonlinear and nonstationary data, A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization, Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism, Compressive optical deflectometric tomography: a constrained total-variation minimization approach, Log-concavity and strong log-concavity: a review, Steiner equiangular tight frames, Discrete uncertainty principles and sparse signal processing, High-dimensional inference in misspecified linear models, On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing, A Barzilai-Borwein type method for minimizing composite functions, Toward a unified theory of sparse dimensionality reduction in Euclidean space, Signature codes for noisy multiple access adder channel, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Decomposable norm minimization with proximal-gradient homotopy algorithm, Yang-Baxter equations and quantum entanglements, Generalized sampling and infinite-dimensional compressed sensing, Dimensionality reduction with subgaussian matrices: a unified theory, Sparse decomposition by iterating Lipschitzian-type mappings, Finding a low-rank basis in a matrix subspace, Compressed sensing from a harmonic analysis point of view, Sparse recovery under weak moment assumptions, Spectral dynamics and regularization of incompletely and irregularly measured data, The null space property for sparse recovery from multiple measurement vectors, A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization, Restricted \(p\)-isometry property and its application for nonconvex compressive sensing, On uncertainty principles in the finite dimensional setting, A non-adapted sparse approximation of PDEs with stochastic inputs, Compressed sensing with coherent and redundant dictionaries, Compressive wave computation, Regularized vector field learning with sparse approximation for mismatch removal, Approximation of frame based missing data recovery, A box constrained gradient projection algorithm for compressed sensing, On support sizes of restricted isometry constants, A convergent overlapping domain decomposition method for total variation minimization, Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization, Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness, A unified approach to model selection and sparse recovery using regularized least squares, Reconstruction of systems with impulses and delays from time series data, Randomized interpolative decomposition of separated representations, Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection, Construction of a full row-rank matrix system for multiple scanning directions in discrete tomography, Accelerated projected gradient method for linear inverse problems with sparsity constraints, On error correction with errors in both the channel and syndrome, Strong convergence of a modified proximal algorithm for solving the lasso, A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery, Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing, Signal recovery under cumulative coherence, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, Improved bounds for sparse recovery from subsampled random convolutions, Wavelet denoising via sparse representation, Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems, Total variation wavelet inpainting, Random sampling of sparse trigonometric polynomials, Sparse approximate solution of fitting surface to scattered points by MLASSO model, Landmark recognition with sparse representation classification and extreme learning machine, Prediction of protein-protein interaction by metasample-based sparse representation, Expander \(\ell_0\)-decoding, Generalized Kalman smoothing: modeling and algorithms, Self-adaptive image reconstruction inspired by insect compound eye mechanism, Strengthening hash families and compressive sensing, The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector, Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization, Comparison of parametric sparse recovery methods for ISAR image formation, Sparse identification of posynomial models, Stability of the elastic net estimator, A hierarchical framework for recovery in compressive sensing, Noisy 1-bit compressive sensing: models and algorithms, Sampling in the analysis transform domain, Local variable selection of nonlinear nonparametric systems by first order expansion, Deterministic construction of compressed sensing matrices based on semilattices, Introducing the counter mode of operation to compressed sensing based encryption, Sparse probit linear mixed model, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration, Proximity algorithms for the L1/TV image denoising model, Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing, Interpolation via weighted \(\ell_{1}\) minimization, From compression to compressed sensing, Robustness properties of dimensionality reduction with Gaussian random matrices, Random matrices and erasure robust frames, Detecting a vector based on linear measurements, A recursive procedure for density estimation on the binary hypercube, Accelerating near-field 3D imaging approach for joint high-resolution imaging and phase error correction, Sparsity and incoherence in orthogonal matching pursuit, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, Compressed sensing of color images, Compressed sensing with structured sparsity and structured acquisition, Sparse signal reconstruction based on multiparameter approximation function with smoothed \(\ell_0\) norm, TV+TV regularization with nonconvex sparseness-inducing penalty for image restoration, Roles of clustering coefficient for the network reconstruction, Median filter based compressed sensing model with application to MR image reconstruction, Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing, On the conditioning of random subdictionaries, Signal recovery under mutual incoherence property and oracle inequalities, Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\), An overview on the applications of matrix theory in wireless communications and 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, An enhanced diagnosis method for weak fault features of bearing acoustic emission signal based on compressed sensing, Parallel magnetic resonance imaging acceleration with a hybrid sensing approach, Learning semidefinite regularizers, Phase retrieval from Fourier measurements with masks, Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals, A simple and flexible model order reduction method for FFT-based homogenization problems using a sparse sampling technique, Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\), Spark-level sparsity and the \(\ell_1\) tail minimization, Slope meets Lasso: improved oracle bounds and optimality, Multiscale blind source separation, Approximation error in regularized SVD-based Fourier continuations, Coorbit theory, multi-\(\alpha \)-modulation frames, and the concept of joint sparsity for medical multichannel data analysis, Sparsity in time-frequency representations, Sparse approximate solution of partial differential equations, Sparse recovery by non-convex optimization - instance optimality, Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval, Adaptive compressive learning for prediction of protein-protein interactions from primary sequence, High-dimensional inference: confidence intervals, \(p\)-values and R-software \texttt{hdi}, Robust group lasso: model and recoverability, Combined similarity to reference image with joint sparsifying transform for longitudinal compressive sensing MRI, Majorizing measures and proportional subsets of bounded orthonormal systems, Optimal non-linear models for sparsity and sampling, On the linear independence of spikes and sines, Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms, Efficient extreme learning machine via very sparse random projection, Enhancing sparsity by reweighted \(\ell _{1}\) minimization, Augmented sparse reconstruction of protein signaling networks, Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference, A fast recovery method of 2D geometric compressed sensing signal, DFT spectrum-sparsity-based quasi-periodic signal identification and application, Uniform recovery of fusion frame structured sparse signals, R3P-Loc: a compact multi-label predictor using ridge regression and random projection for protein subcellular localization, Analysis of sparse MIMO radar, A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing, Properties and iterative methods for the lasso and its variants, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), Compressive sensing for multi-static scattering analysis, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit, Random projections of smooth manifolds, Nonlinear least squares in \(\mathbb R^{N}\), Uniform uncertainty principle for Bernoulli and subgaussian ensembles, Preserving injectivity under subgaussian mappings and its application to compressed sensing, Deterministic construction of sparse binary matrices via incremental integer optimization, The weighted majority algorithm, Volumes of unit balls of mixed sequence spaces, Effect of sensing matrices on quality index parameters for block sparse bayesian learning-based EEG compressive sensing, Sparse Sensing and DMD-Based Identification of Flow Regimes and Bifurcations in Complex Flows, Model selection with distributed SCAD penalty, Sparse recovery properties of discrete random matrices, Online quantum state tomography of N-qubit via continuous weak measurement and compressed sensing, Modern compressive tomography for quantum information science, The numerics of phase retrieval, Estimation of block sparsity in compressive sensing, Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction, On the universality of noiseless linear estimation with respect to the measurement matrix, Polynomial Data Structure Lower Bounds in the Group Model, The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems, Information theoretic limits of learning a sparse rule, A dual split Bregman method for fast $\ell ^1$ minimization, Stable Image Reconstruction Using Transformed Total Variation Minimization, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, Robust recovery of a kind of weighted l1-minimization without noise level, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Recovery of low-rank matrices based on the rank null space properties, Recovering network topologies via Taylor expansion and compressive sensing, Dynamic reconstruction and data reconstruction for subsampled or irregularly sampled data, Sparse Time-Frequency Decomposition for Multiple Signals with Same Frequencies, $N$-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry, Unnamed Item, Importance sampling in signal processing applications, Leveraging reduced-order models for state estimation using deep learning, 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, Super-resolution of point sources via convex programming, YANG–BAXTER EQUATIONS IN QUANTUM INFORMATION, One-bit sensing, discrepancy and Stolarsky's principle, On the structure of time-delay embedding in linear models of non-linear dynamical systems, Compressive time-of-flight 3D imaging using block-structured sensing matrices, Compressive sensing-based topology identification of multilayer networks, Short-Term Memory Capacity in Networks via the Restricted Isometry Property, Rank-based model selection for multiple ions quantum tomography, Leveraging Sparsity and Compressive Sensing for Reduced Order Modeling, Inverse scale space decomposition, Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control, On Construction of Sparse Probabilistic Boolean Networks, On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution, CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, An adaptive inverse scale space method for compressed sensing, $\ell _0$ Minimization for wavelet frame based image restoration, Iteratively Reweighted Group Lasso Based on Log-Composite Regularization, Frames as Codes, A Bipolar-Bisection Piecewise Encoding Scheme for Multi-Source Reverse Time Migration, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, An algebra for periodic rhythms and scales, Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks, Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization, Unnamed Item, Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis, A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging, Chaotic Binary Sensing Matrices, Ensemble Kalman inversion: a derivative-free technique for machine learning tasks, Lattice-Based Patterned Fabric Inspection by Using Total Variation with Sparsity and Low-Rank Representations, Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning, Unnamed Item, A hybrid splitting method for smoothing Tikhonov regularization problem, Reconstruction from convolution random sampling in local shift invariant spaces, Modular proximal optimization for multidimensional total-variation regularization, Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction, Imaging with highly incomplete and corrupted data, An improved bound of cumulative coherence for signal recovery, Deterministic Construction of Compressed Sensing Matrices from Codes, Sparse recovery from extreme eigenvalues deviation inequalities, Structured random measurements in signal processing, Modern regularization methods for inverse problems, Stochastic Collocation Methods via Minimisation of the Transformed L<sub>1</sub>-Penalty, An ℓ<sub>q</sub>- Seminorm Variational Model for Impulse Noise Reduction, An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction, Relaxation algorithms for matrix completion, with applications to seismic travel-time data interpolation, Characterization of ℓ1 minimizer in one-bit compressed sensing, Perturbation Analysis of Orthogonal Least Squares, Sparse recovery with general frame via general-dual-based analysis Dantzig selector, One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method, Unnamed Item, On the Role of Total Variation in Compressed Sensing, Quasi-linear Compressed Sensing, Extraction of Intrawave Signals Using the Sparse Time-Frequency Representation Method, Exploring the toolkit of Jean Bourgain, Algorithmic versatility of SPF-regularization methods, Stochastic Collocation Algorithms Using $l_1$-Minimization for Bayesian Solution of Inverse Problems, The Restricted Isometry Property of Subsampled Fourier Matrices, Discussion: ``A significance test for the lasso, Discussion: ``A significance test for the lasso, An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators, On the Uniqueness of Sparse Time-Frequency Representation of Multiscale Data, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels, On the Generation of Sampling Schemes for Magnetic Resonance Imaging, Compressive Sensing-Based Computed Tomography Imaging: An effective approach for COVID-19 Detection, Discrete uncertainty principle in quaternion setting and application in signal reconstruction, Compressed sensing reconstruction using expectation propagation, Reed-Muller Codes, A Variational Inequality Model for the Construction of Signals from Inconsistent Nonlinear Equations, A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions, Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery, On the Fourier transform of a quantitative trait: implications for compressive sensing, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, A new approach to sparse decomposition of nonstationary signals with multiple scale structures using self-consistent nonlinear waves, Sequential image recovery from noisy and under-sampled Fourier data, Compressive sensing of high betweenness centrality nodes in networks, Bias versus non-convexity in compressed sensing, The restricted isometry property of block diagonal matrices for group-sparse signal recovery, Two-level optimization approach with accelerated proximal gradient for objective measures in sparse speech reconstruction, Gradient projection Newton pursuit for sparsity constrained optimization, The springback penalty for robust signal recovery, An alternating minimization method for matrix completion problems, On the volume of unit balls of finite-dimensional Lorentz spaces, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, Iterative hard thresholding for compressed data separation, Adaptive spatial-spectral dictionary learning for hyperspectral image restoration, Detection for multisatellite downlink signal based on generative adversarial neural network, Group sparse recovery in impulsive noise via alternating direction method of multipliers, Phase retrieval: a data-driven wavelet frame based approach, Geological facies recovery based on weighted \(\ell_1\)-regularization, Collaborative block compressed sensing reconstruction with dual-domain sparse representation, Recovering an unknown signal completely submerged in strong noise by a new stochastic resonance method, Stability of 1-bit compressed sensing in sparse data reconstruction, Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise, A two-step iterative algorithm for sparse hyperspectral unmixing via total variation, Efficient sensing of von Kármán vortices using compressive sensing, Reconstructed error and linear representation coefficients restricted by \(\ell_1\)-minimization for face recognition under different illumination and occlusion, Sparse approximation of fitting surface by elastic net, A compressed-sensing approach for closed-loop optimal control of nonlinear systems, A significance test for the lasso, Discussion: ``A significance test for the lasso, Rejoinder: ``A significance test for the lasso, Data-driven time-frequency analysis, Rapid compressed sensing reconstruction: a semi-tensor product approach, Convergence rates of learning algorithms by random projection, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Convergence of a data-driven time-frequency analysis method, Recursion for the smallest eigenvalue density of \(\beta \)-Wishart-Laguerre ensemble, Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?, Randomized large distortion dimension reduction, On causal extrapolation of sequences with applications to forecasting, Sparse approximate reconstruction decomposed by two optimization problems, Sparse system identification for stochastic systems with general observation sequences, Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction, Maximum correntropy adaptation approach for robust compressive sensing reconstruction, A simple and feasible method for a class of large-scale \(l^1\)-problems, 2D compressed learning: support matrix machine with bilinear random projections, Sparse-view ultrasound diffraction tomography using compressed sensing with nonuniform FFT, Cirrhosis classification based on texture classification of random features, An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem, A general self-adaptive relaxed-PPA method for convex programming with linear constraints, Large deviations, dynamics and phase transitions in large stochastic and disordered neural networks, Stability and instance optimality for Gaussian measurements in compressed sensing, Data science, big data and statistics, Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\), Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, Structured sparsity promoting functions, Sparse regularization for semi-supervised classification, Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm, The stochastic geometry of unconstrained one-bit data compression, Approximation with random bases: pro et contra, A survey of randomized algorithms for training neural networks, Low-rank matrix completion in a general non-orthogonal basis, Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs, An effective algorithm for the spark of sparse binary measurement matrices, Finite impulse response models: a non-asymptotic analysis of the least squares estimator, An efficient privacy-preserving compressive data gathering scheme in WSNs, An accelerated version of alternating direction method of multipliers for TV minimization in EIT, Separable collusion-secure multimedia codes, A new sparse recovery method for the inverse acoustic scattering problem, Erasure recovery matrices for encoder protection, Joint image compression-encryption scheme using entropy coding and compressive sensing, Memoryless scalar quantization for random frames, Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions, RWRM: residual Wasserstein regularization model for image restoration, Efficiency of orthogonal super greedy algorithm under the restricted isometry property, On data compression and recovery for sequences using constraints on the spectrum range, Two-stage geometric information guided image reconstruction, A simple recovery framework for signals with time-varying sparse support, Analysis of Termatiko sets in measurement matrices, A simple Gaussian measurement bound for exact recovery of block-sparse signals, Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies, Truncated sparse approximation property and truncated \(q\)-norm minimization, Compressed-sensing-based gradient reconstruction for ghost imaging, Sparse parameter identification of stochastic dynamical systems, Fast and memory-optimal dimension reduction using Kac's walk, A modified primal-dual method with applications to some sparse recovery problems, Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems, Region-based image-fusion framework for compressive imaging, Near oracle performance and block analysis of signal space greedy methods, The proximity operator of the log-sum penalty, Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications, Generalization bounds for sparse random feature expansions, Greedy signal space methods for incoherence and beyond, New analysis of manifold embeddings and signal recovery from compressive measurements, Intrinsic modeling of stochastic dynamical systems using empirical geometry, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, A novel measurement matrix based on regression model for block compressed sensing, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, Combined supervised information with PCA via discriminative component selection, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, \(\mathrm{L_1RIP}\)-based robust compressed sensing, Algebraic compressed sensing, Sparse reconstruction via the mixture optimization model with iterative support estimate, Sparse broadband beamformer design via proximal optimization Techniques, Analysis of sparse recovery for Legendre expansions using envelope bound, Facets of spherical random polytopes, A dual active set method for \(\ell1\)-regularized problem, From irrevocably modulated filtrations to dynamical equations over random networks, Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs, Sequential edge detection using joint hierarchical Bayesian learning, A wonderful triangle in compressed sensing, A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry, Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing, Sparse control for continuous‐time systems, Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding, Sampling rates for \(\ell^1\)-synthesis, Jointly evolving and compressing fuzzy system for feature reduction and classification, Discrete-time scale-shift approach for wavelet construction and analysis, Enhanced total variation minimization for stable image reconstruction, Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory, Facets of high-dimensional Gaussian polytopes, Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions, Unnamed Item, Discussion: ``A significance test for the lasso, Discussion: ``A significance test for the lasso, Discussion: ``A significance test for the lasso, Entropic Regularization of the ℓ 0 Function, The Moreau envelope based efficient first-order methods for sparse recovery, Fast sparse reconstruction: Greedy inverse scale space flows, Fuzzy Adaptive Resonance Theory, Diffusion Maps and their applications to Clustering and Biclustering, Improved sparse Fourier approximation results: Faster implementations and stronger guarantees, A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions, A Novel Compressed Sensing Scheme for Photoacoustic Tomography, Compressed sensing by inverse scale space and curvelet thresholding, Compressive Sensing with Redundant Dictionaries and Structured Measurements, Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT, Fast Phase Retrieval from Local Correlation Measurements, Self-calibration and biconvex compressive sensing, An efficient augmented Lagrangian method with applications to total variation minimization, Asymptotic analysis of the role of spatial sampling for covariance parameter estimation of Gaussian processes, On the Doubly Sparse Compressed Sensing Problem, THE COEFFICIENT REGULARIZED REGRESSION WITH RANDOM PROJECTION, A Survey of Compressed Sensing, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, Compressive Classification: Where Wireless Communications Meets Machine Learning, Sparse signal recovery via non-convex optimization and overcomplete dictionaries, Optimization Methods for Synthetic Aperture Radar Imaging, The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem, An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring, Compressive Imaging and Characterization of Sparse Light Deflection Maps, Compressed sensing based on trust region method, Exact matrix completion via convex optimization, Reconstruction of sparse signals in impulsive disturbance environments, Suprema of Chaos Processes and the Restricted Isometry Property, A theoretical result of sparse signal recovery via alternating projection method, A new bound on the block restricted isometry constant in compressed sensing, A provably convergent scheme for compressive sensing under random generative priors, Improved RIP conditions for compressed sensing with coherent tight frames, Smoothing strategy along with conjugate gradient algorithm for signal reconstruction, Channel estimation for finite scatterers massive multi-user MIMO system, \(\ell_1\)-norm and entanglement in screening out braiding from Yang-Baxter equation associated with \(\mathbb{Z}_3\) parafermion, Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields, The local convexity of solving systems of quadratic equations, Multicompartment magnetic resonance fingerprinting, Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements, TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX, \(\ell_1\)-norm in three-qubit quantum entanglement constrained by Yang-Baxter equation, Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations, Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1, Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games, Bearing fault diagnosis based on wavelet sparse convolutional network and acoustic emission compression signals, Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation, Deterministic sampling of sparse trigonometric polynomials, Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures, The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes, Noncommutative Bennett and Rosenthal inequalities, Anomaly detection in large-scale data stream networks, Elastic-net regularization versus ℓ 1 -regularization for linear inverse problems with quasi-sparse solutions, A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors, A compressed sensing approach to interpolation of fractional Brownian trajectories for a single particle tracking experiment, Greedy-like algorithms for the cosparse analysis model, RIPless compressed sensing from anisotropic measurements, Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials, Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications, Optimized projections for compressed sensing via rank-constrained nearest correlation matrix, Consistency of \(\ell_1\) recovery from noisy deterministic measurements, An Introduction to Compressed Sensing, Cross validation in LASSO and its acceleration, Sparse approximation based on a random overcomplete basis, A statistical mechanics approach to de-biasing and uncertainty estimation in LASSO for random measurements, Gaussian averages of interpolated bodies and applications to approximate reconstruction, The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder)., The Littlewood-Offord problem and invertibility of random matrices, Reconstruction and subgaussian processes, Unnamed Item, Linearized Bregman iterations for compressed sensing, Convergence of the linearized Bregman iteration for ℓ₁-norm minimization, Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling, A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models, Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization, Nesterov's algorithm solving dual formulation for compressed sensing, Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing, Variations on a theorem of Candès, Romberg and Tao, Low Complexity Regularization of Linear Inverse Problems, OperA: Operator-Based Annihilation for Finite-Rate-of-Innovation Signal Sampling, Fast and RIP-optimal transforms, Robust multi-image processing with optimal sparse regularization, Classification of Spatiotemporal Data via Asynchronous Sparse Sampling: Application to Flow around a Cylinder, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Counting faces of randomly projected polytopes when the projection radically lowers dimension, Compressed sensing and best 𝑘-term approximation, A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization, Sparse Sensor Placement Optimization for Classification, ADAPTIVE DATA ANALYSIS VIA SPARSE TIME-FREQUENCY REPRESENTATION, Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization, A Block Compressive Sensing Based Scalable Encryption Framework for Protecting Significant Image Regions, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, One-Bit Compressed Sensing by Linear Programming, On perturbed steepest descent methods with inexact line search for bilevel convex optimization, A COMPRESSED SENSING FRAMEWORK OF FREQUENCY-SPARSE SIGNALS THROUGH CHAOTIC SYSTEM, Multilevel preconditioning and adaptive sparse solution of inverse problems, Sparse Representation of Signals in Hardy Space, An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence, Primal–dual first-order methods for a class of cone programming, On sparse representation of analytic signal in Hardy space, PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ1 LINEAR PROGRAMMING
