Uncertainty principles and ideal atomic decomposition

DOI10.1109/18.959265zbMath1019.94503OpenAlexW2099641086MaRDI QIDQ4544728

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/19af5d27fecb65b2365ae32a663025eccc688c48

zbMATH Keywords

convex optimization combinatorial optimization wavelet analysis uncertainty principle harmonic analysis matching pursuit basis pursuit discrete-time signal overcomplete representation ridgelet analysis Logan's phenomenon error-correcting encryption highly sparse representation multiple-basis signal representation

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Data encryption (aspects in computer science) (68P25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Computing and analyzing recoverable supports for sparse reconstruction, On a combinatorial framework for fault characterization, Unconstrained $\ell_1$-$\ell_2$ minimization for sparse recovery via mutual coherence, Regularity properties for sparse regression, Best subset selection via a modern optimization lens, Signal recovery under cumulative coherence, Fast $\ell _{1}$ minimization by iterative thresholding for multidimensional NMR spectroscopy, Deterministic convolutional compressed sensing matrices, Iteratively reweighted least squares and slime mold dynamics: connection and convergence, Phase retrieval of complex and vector-valued functions, Bayesian factor-adjusted sparse regression, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, New classes of matrix decompositions, Recovery of high-dimensional sparse signals via $\ell_1$-minimization, Symmetric tensor decomposition, Adaptive multi-penalty regularization based on a generalized Lasso path, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays, Feature selection when there are many influential features, The entries of Haar-invariant matrices from the Classical compact groups, Strengthening hash families and compressive sensing, A primal dual active set with continuation algorithm for the $\ell^0$-regularized optimization problem, Robust estimation for an inverse problem arising in multiview geometry, Sharp recovery bounds for convex demixing, with applications, A smoothing method for sparse optimization over convex sets, Stability of the elastic net estimator, A hierarchical framework for recovery in compressive sensing, Phase transition in limiting distributions of coherence of high-dimensional random matrices, Sparse representations and approximation theory, Testing the nullspace property using semidefinite programming, On verifiable sufficient conditions for sparse signal recovery via $\ell_{1}$ minimization, Verifiable conditions of $\ell_{1}$-recovery for sparse signals with sign restrictions, Null space conditions and thresholds for rank minimization, Improved stability conditions of BOGA for noisy block-sparse signals, Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices, Recovery of signals under the condition on RIC and ROC via prior support information, On the conditioning of random subdictionaries, A sharp nonasymptotic bound and phase diagram of $L_{1/2}$ regularization, Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism, Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing, Signal recovery under mutual incoherence property and oracle inequalities, Covariate assisted screening and estimation, A new perspective on least squares under convex constraint, Sparse dual frames and dual Gabor functions of minimal time and frequency supports, Greedy subspace pursuit for joint sparse recovery, Discrete uncertainty principles and sparse signal processing, Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models, Sign function based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian noise environments, An overview on the applications of matrix theory in wireless communications and signal processing, Analysis of convergence for the alternating direction method applied to joint sparse recovery, On the null space property of $l_q$-minimization for $0 < q \leq 1$ in compressed sensing, Analysis of the ratio of $\ell_1$ and $\ell_2$ norms in compressed sensing, Learning semidefinite regularizers, Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging, Existence, uniqueness, and approximation solutions to linearized Chandrasekhar equation with sharp bounds, Bayesian signal detection with compressed measurements, Sparse recovery in probability via $l_q$-minimization with Weibull random matrices for $0 < q\leq 1$, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Dictionary evaluation and optimization for sparse coding based speech processing, Debiasing the Lasso: optimal sample size for Gaussian designs, Compressed sensing from a harmonic analysis point of view, Sparse recovery under weak moment assumptions, IDENT: identifying differential equations with numerical time evolution, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, A performance guarantee for orthogonal matching pursuit using mutual coherence, Sparse approximate reconstruction decomposed by two optimization problems, On uncertainty principles in the finite dimensional setting, Sparse approximate solution of partial differential equations, Approximation of frame based missing data recovery, A sharp RIP condition for orthogonal matching pursuit, Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery, A hybrid scheme for encoding audio signal using hidden Markov models of waveforms, SZ and CMB reconstruction using generalized morphological component analysis, Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources, Sparse recovery by non-convex optimization - instance optimality, When do stepwise algorithms meet subset selection criteria?, Estimating the dimension of a model, Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation, Analysis of basis pursuit via capacity sets, Enhancing sparsity by reweighted $\ell _{1}$ minimization, Rates of contraction of posterior distributions based on $p$-exponential priors, Sparse recovery via differential inclusions, Phase retrieval for sparse signals, Matrix-free interior point method for compressed sensing problems, A survey of uncertainty principles and some signal processing applications, An extended DEIM algorithm for subset selection and class identification, Evaluating visual properties via robust HodgeRank, Nonuniqueness of solutions of a class of $\ell_0$-minimization problems, Optimal delocalization for generalized Wigner matrices, Smoothing Newton method for $\ell^0$-$\ell^2$ regularized linear inverse problem, Sparse solutions to underdetermined Kronecker product systems, Measurement matrix design for CS-MIMO radar using multi-objective optimization, On the grouping effect of the $l_{1-2}$ models, Sparse recovery of sound fields using measurements from moving microphones, Local recovery bounds for prior support constrained compressed sensing, Orthogonal one step greedy procedure for heteroscedastic linear models, Locally sparse reconstruction using the $\ell^{1,\infty}$-norm, Model selection with distributed SCAD penalty, LEARNING AN ADAPTIVE DICTIONARY USING A PROJECTED GRADIENT METHOD AND ITS APPLICATION ON IMAGE DE-NOISING, A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems, A general theory for subspace-sparse recovery, The asymptotic distribution and Berry-Esseen bound of a new test for independence in high dimension with an application to stochastic optimization, The Kadison–Singer Problem in mathematics and engineering, Book Review: A mathematical introduction to compressive sensing, GMRES-Accelerated ADMM for Quadratic Objectives, Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles, Unnamed Item, Regularized sparse representation for image deconvolution, A Compressed Sensing Framework for Monte Carlo Transport Simulations Using Random Disjoint Tallies, Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee, Robust Identification of Differential Equations by Numerical Techniques from a Single Set of Noisy Observation, Analysis of simultaneous inpainting and geometric separation based on sparse decomposition, A new bound on the block restricted isometry constant in compressed sensing, Compressed sensing for finite-valued signals, A novel regularization based on the error function for sparse recovery, Asymptotic Theory of $\boldsymbol \ell _1$ -Regularized PDE Identification from a Single Noisy Trajectory, TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX, A gradient enhanced $\ell_{1}$-minimization for sparse approximation of polynomial chaos expansions, Block-sparse recovery of semidefinite systems and generalized null space conditions, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, Support union recovery in high-dimensional multivariate regression, Model selection with low complexity priors, Compressive Sensing, Randomized first order algorithms with applications to $\ell _{1}$-minimization, On sparse recovery algorithms in unions of orthonormal bases, BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING, Posterior information-based image measurement matrix optimization, Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit, On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures, Paved with good intentions: analysis of a randomized block Kaczmarz method, Sparse linear regression from perturbed data, On Linguistic Variables and Sparse Representations, On the sparsity of Lasso minimizers in sparse data recovery, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices, Generalized Regression Estimators with High-Dimensional Covariates, Stability analysis of a class of sparse optimization problems, Signal separation under coherent dictionaries and $\ell_p$-bounded noise, Sparse regression: scalable algorithms and empirical performance, Typicall₁-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices, Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems, Random Matrices Generating Large Growth in LU Factorization with Pivoting, Microlocal Analysis of the Geometric Separation Problem, Beyond sparsity: recovering structured representations by ${\ell}^1$ minimization and greedy algorithms, A Practical Randomized CP Tensor Decomposition, On the uncertainty inequality as applied to discrete signals, Beyond coherence: Recovering structured time-frequency representations, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder)., Iteratively Reweighted Group Lasso Based on Log-Composite Regularization, Frames as Codes, Analysis of inpainting via clustered sparsity and microlocal analysis, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Sharp RIP bound for sparse signal and low-rank matrix recovery, Geometric separation by single-pass alternating thresholding, Stable restoration and separation of approximately sparse signals, Fast thresholding algorithms with feedbacks for sparse signal recovery, Sparse signals recovery from noisy measurements by orthogonal matching pursuit, Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, Ways to sparse representation: An overview, A numerical exploration of compressed sampling recovery, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Unnamed Item, Basis pursuit for frequency-domain identification, A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging, Chaotic Binary Sensing Matrices, Fast Sparse Representation Based on Smoothed ℓ0 Norm, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Low Complexity Regularization of Linear Inverse Problems, A Scale-Invariant Approach for Sparse Signal Recovery, On the differences between $L_2$ boosting and the Lasso, Robust multi-image processing with optimal sparse regularization, A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, A New Nonlinear Sparse Component Analysis for a Biologically Plausible Model of Neurons, The Fast Cauchy Transform and Faster Robust Linear Regression, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, Greedy approximate projection for magnetic resonance fingerprinting with partial volumes, An improved bound of cumulative coherence for signal recovery, On the X-rank with respect to linear projections of projective varieties, Binary sparse signal recovery with binary matching pursuit ^*, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, Novel harmonic regularization approach for variable selection in Cox's proportional hazards model, Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, Sure Independence Screening for Ultrahigh Dimensional Feature Space, The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization, Alternating direction method of multipliers for solving dictionary learning models, Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA), Theory and applications of compressed sensing, On sparse representation of analytic signal in Hardy space, PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ₁ LINEAR PROGRAMMING, An asymptotic existence result on compressed sensing matrices, Stable recovery of analysis based approaches, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, Compressed data separation via unconstrained l1-split analysis, Heuristics for Finding Sparse Solutions of Linear Inequalities, Research trends in combinatorial optimization, Extremal statistics of quadratic forms of GOE/GUE eigenvectors, Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing, Binary generalized orthogonal matching pursuit, Sampling rates for $\ell^1$-synthesis, Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals, Unnamed Item, Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery, Wavelet Scattering Regression of Quantum Chemical Energies, Unsupervised learning of compositional sparse code for natural image representation, Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization, A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding, Uniqueness Conditions for A Class of ℓ₀-Minimization Problems, Minimization of $\ell_{1-2}$ for Compressed Sensing, The uncertainty principle: Variations on a theme, Uncertainty Principle corresponding to an orthonormal wavelet system, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Sparse Solutions of a Class of Constrained Optimization Problems, Nonuniform recovery of fusion frame structured sparse signals, Signal Decomposition Using Masked Proximal Operators, Solving Basis Pursuit