A generalized uncertainty principle and sparse representation in pairs of bases

DOI10.1109/TIT.2002.801410zbMath1062.15001OpenAlexW2167839759MaRDI QIDQ4677575

Alfred Marcel Bruckstein, Michael Elad

Publication date: 11 May 2005

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

Full work available at URL: https://doi.org/10.1109/tit.2002.801410

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (68)

Secure estimation based Kalman filter for cyber-physical systems against sensor attacks ⋮ A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems ⋮ The Kadison–Singer Problem in mathematics and engineering ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles ⋮ 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 ⋮ Highly sparse representations from dictionaries are unique and independent of the sparseness measure ⋮ Convex optimization in sums of Banach spaces ⋮ Data Analytics on Graphs Part II: Signals on Graphs ⋮ Strengthening hash families and compressive sensing ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Sampling rates for \(\ell^1\)-synthesis ⋮ QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images ⋮ Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ Sparse representations and approximation theory ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ Improved stability conditions of BOGA for noisy block-sparse signals ⋮ Compressive Sensing ⋮ On sparse recovery algorithms in unions of orthonormal bases ⋮ Processing of sparse signals and mutual coherence of ``measurable vectors ⋮ Unnamed Item ⋮ On the conditioning of random subdictionaries ⋮ Sparse dual frames and dual Gabor functions of minimal time and frequency supports ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ Typicall₁-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Microlocal Analysis of the Geometric Separation Problem ⋮ Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms ⋮ Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging ⋮ Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) ⋮ Beyond coherence: Recovering structured time-frequency representations ⋮ The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). ⋮ Sparse decomposition by iterating Lipschitzian-type mappings ⋮ Analysis of inpainting via clustered sparsity and microlocal analysis ⋮ Well-posedness of the permutation problem in sparse filter estimation with \(\ell^p\) minimization ⋮ Geometric separation by single-pass alternating thresholding ⋮ Stable restoration and separation of approximately sparse signals ⋮ Fast thresholding algorithms with feedbacks for sparse signal recovery ⋮ An iteratively approximated gradient projection algorithm for sparse signal reconstruction ⋮ On uncertainty principles in the finite dimensional setting ⋮ Necessary and sufficient conditions of solution uniqueness in 1-norm minimization ⋮ Ways to sparse representation: An overview ⋮ A numerical exploration of compressed sampling recovery ⋮ 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 ⋮ On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them ⋮ CMB data analysis and sparsity ⋮ Linearized Bregman iterations for compressed sensing ⋮ Fast Sparse Representation Based on Smoothed ℓ0 Norm ⋮ When do stepwise algorithms meet subset selection criteria? ⋮ Analysis of basis pursuit via capacity sets ⋮ On the linear independence of spikes and sines ⋮ On some deterministic dictionaries supporting sparsity ⋮ Enhancing sparsity by reweighted \(\ell _{1}\) minimization ⋮ Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization ⋮ Phase retrieval for sparse signals ⋮ A survey of uncertainty principles and some signal processing applications ⋮ Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases ⋮ Sparse solutions to underdetermined Kronecker product systems ⋮ The local integro splines with optimized knots ⋮ Uncertainty Principle corresponding to an orthonormal wavelet system ⋮ Unnamed Item ⋮ 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

This page was built for publication: A generalized uncertainty principle and sparse representation in pairs of bases