Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
From MaRDI portal
Publication:4570294
DOI10.1109/TSP.2010.2044837zbMATH Open1392.94195DBLPjournals/tsp/EldarKB10WikidataQ60308910 ScholiaQ60308910MaRDI QIDQ4570294FDOQ4570294
Authors: Y. C. Eldar, Patrick Kuppinger, Helmut Bölcskei
Publication date: 9 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Cited In (86)
- ``Grouping strategies and thresholding for high dimensional linear models: discussion
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Nonlinear frames and sparse reconstructions in Banach spaces
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- Globally sparse and locally dense signal recovery for compressed sensing
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- An off-grid block-sparse Bayesian method for direction of arrival and polarization estimation
- Grassmannian codes from paired difference sets
- Sparse sensing and DMD-based identification of flow regimes and bifurcations in complex flows
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Sparse network identifiability via compressed sensing
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Block-Based Methods for the Reconstruction of Finite-Length Signals From Nonuniform Samples
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
- Estimation of block sparsity in compressive sensing
- Near oracle performance and block analysis of signal space greedy methods
- Recovering structured signals in noise: least-squares meets compressed sensing
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Constructing subspace packings from other packings
- Exploiting Prior Information in Block-Sparse Signals
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Optimization problems involving group sparsity terms
- On block coherence of frames
- Sharp MSE bounds for proximal denoising
- Robust group lasso: model and recoverability
- Split Bregman algorithms for multiple measurement vector problem
- From compression to compressed sensing
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- Improved stability conditions of BOGA for noisy block-sparse signals
- Sparsity-Based MIMO Radars
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Reducing uncertainty in conceptual prior models of complex geologic systems via integration of flow response data
- A survey on compressive sensing: classical results and recent advancements
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Uniform recovery of fusion frame structured sparse signals
- Robust visual tracking with structured sparse representation appearance model
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
- A simple Gaussian measurement bound for exact recovery of block-sparse signals
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- A perturbation analysis of nonconvex block-sparse compressed sensing
- Hierarchical isometry properties of hierarchical measurements
- Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- A new bound on the block restricted isometry constant in compressed sensing
- Irreducible infeasible subsystems of semidefinite systems
- A convex approach for image restoration with exact Poisson-Gaussian likelihood
- Content-aware compressive sensing recovery using Laplacian scale mixture priors and side information
- Sparsity based methods for overparameterized variational problems
- Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
- High-order block RIP for nonconvex block-sparse compressed sensing
- Cardinality minimization, constraints, and regularization: a survey
- Composition-aware spectroscopic tomography
- Harmonic Grassmannian codes
- The stable reconstruction of strongly-decaying block sparse signals
- Nonuniform recovery of fusion frame structured sparse signals
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- MIMO radar OFDM chirp waveform diversity design with sparse modeling and joint optimization
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Fusion frame homotopy and tightening fusion frames by gradient descent
- Block sparse signal recovery via minimizing the block \(q\)-ratio sparsity
- Piecewise sparse recovery in union of bases
- Constrained mix sparse optimization via hard thresholding pursuit
- fg-ORKA: fast and gridless reconstruction of moving and deforming objects in multidimensional data
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- A common network architecture efficiently implements a variety of sparsity-based inference problems
- Naimark-spatial families of equichordal tight fusion frames
- Group projected subspace pursuit for block sparse signal reconstruction: convergence analysis and applications
- ORKA: Object reconstruction using a K-approximation graph
- Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector
- Moving force identification based on group Lasso and compressed sensing
- A nonparametric method for classification trees using grouped covariates
This page was built for publication: Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570294)