On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
From MaRDI portal
Publication:4569805
DOI10.1109/TSP.2009.2020754zbMath1391.94402arXiv0804.0041MaRDI QIDQ4569805
Mihailo Stojnic, Farzad Parvaresh, Babak Hassibi
Publication date: 9 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.0041
Multivariate analysis (62H99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Duality of nonconvex optimization with positively homogeneous functions, A geometrical stability condition for compressed sensing, Estimation of block sparsity in compressive sensing, Sparsity Based Methods for Overparameterized Variational Problems, A Survey of Compressed Sensing, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, Structured Sparsity: Discrete and Convex Approaches, Sharp MSE bounds for proximal denoising, Robust classifier using distance-based representation with square weights, An improved set-membership proportionate adaptive algorithm for a block-sparse system, A new bound on the block restricted isometry constant in compressed sensing, Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging, Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems, PROMP: a sparse recovery approach to lattice-valued signals, Globally sparse and locally dense signal recovery for compressed sensing, Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals, Robust recovery of a kind of weighted l1-minimization without noise level, Grouped variable selection with discrete optimization: computational and statistical perspectives, Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates, Robust visual tracking with structured sparse representation appearance model, Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares, Sampling in the analysis transform domain, Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization, Block-sparse recovery of semidefinite systems and generalized null space conditions, A perturbation analysis of nonconvex block-sparse compressed sensing, Maximum turn‐off control for discrete‐time linear systems, A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit, From compression to compressed sensing, Improved stability conditions of BOGA for noisy block-sparse signals, Compressed sensing of color images, Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, The benefit of group sparsity, Structured sparsity through convex optimization, A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers, Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals, A simple Gaussian measurement bound for exact recovery of block-sparse signals, Optimization problems involving group sparsity terms, Near oracle performance and block analysis of signal space greedy methods, Recovery under side constraints, Hierarchical isometry properties of hierarchical measurements
