Uncertainty principles and ideal atomic decomposition
From MaRDI portal
Publication:4544728
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
convex optimizationcombinatorial optimizationwavelet analysisuncertainty principleharmonic analysismatching pursuitbasis pursuitdiscrete-time signalovercomplete representationridgelet analysisLogan's phenomenonerror-correcting encryptionhighly sparse representationmultiple-basis signal representation
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 (only showing first 100 items - show all)
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
This page was built for publication: Uncertainty principles and ideal atomic decomposition
