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 40 items.
- A simple Gaussian measurement bound for exact recovery of block-sparse signals (Q2320652) (← links)
- Optimization problems involving group sparsity terms (Q2330642) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Near oracle performance and block analysis of signal space greedy methods (Q2344305) (← links)
- A new direction-of-arrival estimation method exploiting signal structure information (Q2361290) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector (Q2411715) (← links)
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate (Q2450938) (← links)
- Phase retrieval: stability and recovery guarantees (Q2450942) (← links)
- Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN (Q2658582) (← links)
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals (Q2670979) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models (Q2792266) (← links)
- A perturbation analysis of block-sparse compressed sensing via mixed ℓ2/ℓ1 minimization (Q2818328) (← links)
- On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames (Q3385358) (← links)
- Sparsity Based Methods for Overparameterized Variational Problems (Q3454487) (← links)
- A Survey of Compressed Sensing (Q3460827) (← links)
- The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing (Q3460832) (← links)
- Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
- Representation and coding of signal geometry (Q4603712) (← links)
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements (Q4603729) (← links)
- Joint Sparse Recovery Based on Variances (Q4646459) (← links)
- A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging (Q4686935) (← links)
- Sparsity-Based MIMO Radars (Q5020143) (← links)
- Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing (Q5020144) (← links)
- Estimation of block sparsity in compressive sensing (Q5052929) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Composition-aware spectroscopic tomography (Q5132269) (← links)
- TV-based reconstruction of periodic functions (Q5132274) (← links)
- (Q5148995) (← links)
- Nonuniform recovery of fusion frame structured sparse signals (Q5267946) (← links)
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm (Q5300386) (← links)
- Sparse learning of partial differential equations with structured dictionary matrix (Q5377550) (← links)
- Weighted lp − l1 minimization methods for block sparse recovery and rank minimization (Q5856318) (← links)
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates (Q6051201) (← links)
- Block sparse signal recovery via minimizing the block \(q\)-ratio sparsity (Q6056243) (← links)
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model (Q6062413) (← links)
- Sequential edge detection using joint hierarchical Bayesian learning (Q6111678) (← links)
- Maximum turn‐off control for discrete‐time linear systems (Q6177331) (← links)
- Block sparse design of distributed controllers for dynamical network systems (Q6177335) (← links)