Robust Recovery of Signals From a Structured Union of Subspaces
From MaRDI portal
Publication:4974079
DOI10.1109/TIT.2009.2030471zbMath1367.94087arXiv0807.4581OpenAlexW2147276092MaRDI QIDQ4974079
Yonina C. Eldar, Moshe Mishali
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.4581
Related Items (90)
A new direction-of-arrival estimation method exploiting signal structure information ⋮ Duality of nonconvex optimization with positively homogeneous functions ⋮ Sparse Bayesian learning for network structure reconstruction based on evolutionary game data ⋮ Estimation of block sparsity in compressive sensing ⋮ Sparsity Based Methods for Overparameterized Variational Problems ⋮ Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm ⋮ A Survey of Compressed Sensing ⋮ The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ The restricted isometry property of block diagonal matrices for group-sparse signal recovery ⋮ An improved set-membership proportionate adaptive algorithm for a block-sparse system ⋮ Block sparse recovery via mixed \(l_2/l_1\) minimization ⋮ 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 ⋮ Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN ⋮ Generalizing CoSaMP to signals from a union of low dimensional linear subspaces ⋮ Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP ⋮ 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 ⋮ Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates ⋮ Block sparse signal recovery via minimizing the block \(q\)-ratio sparsity ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ Robust visual tracking with structured sparse representation appearance model ⋮ Sequential edge detection using joint hierarchical Bayesian learning ⋮ 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 ⋮ Group sparse recovery in impulsive noise via alternating direction method of multipliers ⋮ Sparse support recovery using correlation information in the presence of additive noise ⋮ A perturbation analysis of nonconvex block-sparse compressed sensing ⋮ Maximum turn‐off control for discrete‐time linear systems ⋮ Block sparse design of distributed controllers for dynamical network systems ⋮ A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit ⋮ Representation and coding of signal geometry ⋮ Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ Improved stability conditions of BOGA for noisy block-sparse signals ⋮ Compressive sensing of analog signals using discrete prolate spheroidal sequences ⋮ Compressed sensing of color images ⋮ Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations ⋮ Compressed sensing with structured sparsity and structured acquisition ⋮ Sparse learning of partial differential equations with structured dictionary matrix ⋮ An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion ⋮ Composition-aware spectroscopic tomography ⋮ TV-based reconstruction of periodic functions ⋮ On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate ⋮ Phase retrieval: stability and recovery guarantees ⋮ A perturbation analysis based on group sparse representation with orthogonal matching pursuit ⋮ Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\) ⋮ Greedy subspace pursuit for joint sparse recovery ⋮ Reducing effects of bad data using variance based joint sparsity recovery ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery ⋮ Joint Sparse Recovery Based on Variances ⋮ Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all ⋮ Nonlinear frames and sparse reconstructions in Banach spaces ⋮ Dimensionality reduction with subgaussian matrices: a unified theory ⋮ Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays ⋮ Image reconstruction using analysis model prior ⋮ A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation ⋮ Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering ⋮ Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms ⋮ On recovery guarantees for one-bit compressed sensing on manifolds ⋮ Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness ⋮ Similarity matrix framework for data from union of subspaces ⋮ A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models ⋮ A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging ⋮ Robust group lasso: model and recoverability ⋮ An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems ⋮ \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm ⋮ Uniform recovery of fusion frame structured sparse signals ⋮ Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals ⋮ On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames ⋮ A perturbation analysis of block-sparse compressed sensing via mixed ℓ2/ℓ1 minimization ⋮ A note on block-sparse signal recovery with coherent tight frames ⋮ A simple Gaussian measurement bound for exact recovery of block-sparse signals ⋮ The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms ⋮ Theoretical guarantees for graph sparse coding ⋮ Unnamed Item ⋮ Optimization problems involving group sparsity terms ⋮ Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit ⋮ Weighted lp − l1 minimization methods for block sparse recovery and rank minimization ⋮ Near oracle performance and block analysis of signal space greedy methods ⋮ Hierarchical compressed sensing ⋮ Sparsity-Based MIMO Radars ⋮ Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing ⋮ Nonuniform recovery of fusion frame structured sparse signals ⋮ Hierarchical isometry properties of hierarchical measurements
This page was built for publication: Robust Recovery of Signals From a Structured Union of Subspaces
