Sparse representations in unions of bases

DOI10.1109/TIT.2003.820031zbMath1286.94032OpenAlexW2136235822MaRDI QIDQ3546942

Morten Nielsen, Rémi Gribonval

Publication date: 21 December 2008

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

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

zbMATH Keywords

linear programmingnonlinear approximationdictionariesGrassmannian framessparse representationsmutually incoherent bases

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 (only showing first 100 items - show all)

An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ A general theory for subspace-sparse recovery ⋮ WEIGHTED AND CONTROLLED FRAMES: MUTUAL RELATIONSHIP AND FIRST NUMERICAL PROPERTIES ⋮ 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 ⋮ Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases ⋮ The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing ⋮ Sampling rates for \(\ell^1\)-synthesis ⋮ Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples ⋮ Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ Imaging with highly incomplete and corrupted data ⋮ An improved bound of cumulative coherence for signal recovery ⋮ Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases ⋮ Characterization of ℓ1 minimizer in one-bit compressed sensing ⋮ A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations ⋮ Detecting and Repairing Arbitrage in Traded Option Prices ⋮ Multi-Layer Sparse Coding: The Holistic Way ⋮ Computing and analyzing recoverable supports for sparse reconstruction ⋮ The gap between the null space property and the restricted isometry property ⋮ Secure estimation based Kalman filter for cyber-physical systems against sensor attacks ⋮ Entropic Regularization of the ℓ 0 Function ⋮ A novel coherence reduction method in compressed sensing for DOA estimation ⋮ Sparsity Based Methods for Overparameterized Variational Problems ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ DC approximation approaches for sparse optimization ⋮ Discriminative Sparse Representations ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ A theoretical result of sparse signal recovery via alternating projection method ⋮ A new bound on the block restricted isometry constant in compressed sensing ⋮ Sparsest representations and approximations of an underdetermined linear system ⋮ The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\) ⋮ Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization ⋮ On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery ⋮ Smoothing strategy along with conjugate gradient algorithm for signal reconstruction ⋮ Complex best \(r\)-term approximations almost always exist in finite dimensions ⋮ Highly sparse representations from dictionaries are unique and independent of the sparseness measure ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Convex optimization in sums of Banach spaces ⋮ The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) ⋮ Multicompartment magnetic resonance fingerprinting ⋮ Strengthening hash families and compressive sensing ⋮ Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm ⋮ Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization ⋮ A smoothing method for sparse optimization over convex sets ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Block-sparse recovery of semidefinite systems and generalized null space conditions ⋮ Sparse representations and approximation theory ⋮ Analysis \(\ell_1\)-recovery with frames and Gaussian measurements ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ A null-space-based weightedl₁minimization approach to compressed sensing ⋮ A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery ⋮ Improved stability conditions of BOGA for noisy block-sparse signals ⋮ A two-level method for sparse time-frequency representation of multiscale data ⋮ Compressive Sensing ⋮ On sparse recovery algorithms in unions of orthonormal bases ⋮ Greedy-like algorithms for the cosparse analysis model ⋮ Perturbations of measurement matrices and dictionaries in compressed sensing ⋮ Existence of the best \(n\)-term approximants for structured dictionaries ⋮ On the sparsity of Lasso minimizers in sparse data recovery ⋮ On the statistics of matching pursuit angles ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Stability of 1-bit compressed sensing in sparse data reconstruction ⋮ Optimized projections for compressed sensing via rank-constrained nearest correlation matrix ⋮ On the conditioning of random subdictionaries ⋮ Sparse time-frequency representation of nonlinear and nonstationary data ⋮ Sparse Recovery and Dictionary Learning to Identify the Nonlinear Dynamical Systems: One Step Toward Finding Bifurcation Points in Real Systems ⋮ Musical audio analysis using sparse representations ⋮ 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 ⋮ 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 ⋮ Fast L1-L2 minimization via a proximal operator ⋮ Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) ⋮ Beyond coherence: Recovering structured time-frequency representations ⋮ DCA based algorithms for feature selection in multi-class support vector machine ⋮ A modified greedy analysis pursuit algorithm for the cosparse analysis model ⋮ An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices ⋮ Data-driven time-frequency analysis ⋮ Geometric separation by single-pass alternating thresholding ⋮ Stable restoration and separation of approximately sparse signals ⋮ Fast thresholding algorithms with feedbacks for sparse signal recovery ⋮ The null space property for sparse recovery from multiple measurement vectors ⋮ Restricted \(p\)-isometry property and its application for nonconvex compressive sensing ⋮ On uncertainty principles in the finite dimensional setting ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ On the existence of optimal unions of subspaces for data modeling and clustering ⋮ Ways to sparse representation: An overview ⋮ A numerical exploration of compressed sampling recovery ⋮ A hybrid scheme for encoding audio signal using hidden Markov models of waveforms

This page was built for publication: Sparse representations in unions of bases