Pages that link to "Item:Q4974079"
From MaRDI portal
The following pages link to Robust Recovery of Signals From a Structured Union of Subspaces (Q4974079):
Displayed 50 items.
- Block sparse recovery via mixed \(l_2/l_1\) minimization (Q353620) (← links)
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging (Q362317) (← links)
- Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
- Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion (Q460667) (← links)
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing (Q492558) (← links)
- Dimensionality reduction with subgaussian matrices: a unified theory (Q515989) (← links)
- Image reconstruction using analysis model prior (Q519588) (← links)
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms (Q537241) (← links)
- Improved stability conditions of BOGA for noisy block-sparse signals (Q634875) (← links)
- Nonlinear frames and sparse reconstructions in Banach spaces (Q682869) (← links)
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness (Q722765) (← links)
- Similarity matrix framework for data from union of subspaces (Q723020) (← links)
- Uniform recovery of fusion frame structured sparse signals (Q739459) (← links)
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Duality of nonconvex optimization with positively homogeneous functions (Q1616938) (← links)
- An improved set-membership proportionate adaptive algorithm for a block-sparse system (Q1657020) (← links)
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP (Q1673807) (← links)
- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization (Q1696370) (← links)
- Sparse support recovery using correlation information in the presence of additive noise (Q1697954) (← links)
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit (Q1700711) (← links)
- Compressed sensing with structured sparsity and structured acquisition (Q1713639) (← links)
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\) (Q1736367) (← links)
- Greedy subspace pursuit for joint sparse recovery (Q1736381) (← links)
- Reducing effects of bad data using variance based joint sparsity recovery (Q1736886) (← links)
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all (Q1748256) (← links)
- Robust group lasso: model and recoverability (Q1790464) (← links)
- \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm (Q1799963) (← links)
- Compressed sensing of color images (Q1957911) (← links)
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations (Q1957932) (← links)
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays (Q1992459) (← links)
- On recovery guarantees for one-bit compressed sensing on manifolds (Q2022611) (← links)
- Hierarchical compressed sensing (Q2106467) (← links)
- Hierarchical isometry properties of hierarchical measurements (Q2118397) (← links)
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data (Q2137626) (← links)
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery (Q2155809) (← links)
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces (Q2175016) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Group sparse recovery in impulsive noise via alternating direction method of multipliers (Q2197950) (← links)
- A perturbation analysis of nonconvex block-sparse compressed sensing (Q2198516) (← links)
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit (Q2232085) (← links)
- Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery (Q2238869) (← links)
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation (Q2251191) (← links)
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering (Q2252515) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- A note on block-sparse signal recovery with coherent tight frames (Q2312304) (← links)