Pages that link to "Item:Q5281300"
From MaRDI portal
The following pages link to Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property (Q5281300):
Displaying 46 items.
- Off-grid DOA estimation via real-valued sparse Bayesian method in compressed sensing (Q318224) (← links)
- Design of wideband fractional-order differentiator using interlaced sampling method (Q318551) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
- The restricted isometry property for random block diagonal matrices (Q466970) (← links)
- Compressed classification learning with Markov chain samples (Q470183) (← links)
- Robustness of orthogonal matching pursuit under restricted isometry property (Q476748) (← links)
- Analysis of orthogonal multi-matching pursuit under restricted isometry property (Q477291) (← links)
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Error estimates for orthogonal matching pursuit and random dictionaries (Q628676) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Noise folding in completely perturbed compressed sensing (Q670261) (← links)
- Automatic modulation recognition using compressive cyclic features (Q1657053) (← links)
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP (Q1673807) (← links)
- A remark on joint sparse recovery with OMP algorithm under restricted isometry property (Q1740232) (← links)
- Dictionary evaluation and optimization for sparse coding based speech processing (Q1749610) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- A sharp RIP condition for orthogonal matching pursuit (Q2015581) (← links)
- A rolling bearing fault detection method based on compressed sensing and a neural network (Q2047853) (← links)
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling (Q2060149) (← links)
- Robust sparse recovery via a novel convex model (Q2079105) (← links)
- Search for sparse solutions of super-large systems with a tensor structure (Q2101411) (← links)
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity (Q2198101) (← links)
- Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
- Spectral compressive sensing (Q2252132) (← links)
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit (Q2254767) (← links)
- On rank awareness, thresholding, and MUSIC for joint sparse recovery (Q2278470) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems (Q2335937) (← links)
- Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
- New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- Stability and Robustness of Weak Orthogonal Matching Pursuits (Q2840665) (← links)
- Cosparsity in Compressed Sensing (Q3460838) (← links)
- On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm (Q4689776) (← links)
- Binary sparse signal recovery with binary matching pursuit <sup>*</sup> (Q4993901) (← links)
- Sparsity-Based MIMO Radars (Q5020143) (← links)
- (Q5096504) (← links)
- Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit (Q5121287) (← links)
- (Q5149239) (← links)
- Quasi-linear Compressed Sensing (Q5250350) (← links)
- A new result on recovery sparse signals using orthogonal matching pursuit (Q5880131) (← links)
- Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
- Sparse signal reconstruction via collaborative neurodynamic optimization (Q6076704) (← links)
- Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification (Q6125488) (← links)
- Some results on OMP algorithm for MMV problem (Q6181820) (← links)