Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
From MaRDI portal
Publication:5281300
DOI10.1109/TIT.2010.2054653zbMath1366.94093arXiv0909.0083MaRDI QIDQ5281300
Michael B. Wakin, Mark A. Davenport
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.0083
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
A new result on recovery sparse signals using orthogonal matching pursuit, Off-grid DOA estimation via real-valued sparse Bayesian method in compressed sensing, Design of wideband fractional-order differentiator using interlaced sampling method, Cosparsity in Compressed Sensing, Sparse approximation is provably hard under coherent dictionaries, Automatic modulation recognition using compressive cyclic features, Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP, Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields, Heuristics for Finding Sparse Solutions of Linear Inequalities, Sparse signal reconstruction via collaborative neurodynamic optimization, Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification, Error estimates for orthogonal matching pursuit and random dictionaries, Phase transitions for greedy sparse approximation algorithms, Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity, Fast overcomplete dictionary construction with probabilistic guarantees, Some results on OMP algorithm for MMV problem, Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit, Compressive sensing of analog signals using discrete prolate spheroidal sequences, The restricted isometry property for random block diagonal matrices, Compressed classification learning with Markov chain samples, Robustness of orthogonal matching pursuit under restricted isometry property, Analysis of orthogonal multi-matching pursuit under restricted isometry property, Noise folding in completely perturbed compressed sensing, A remark on joint sparse recovery with OMP algorithm under restricted isometry property, Sparse polynomial chaos expansions via compressed sensing and D-optimal design, Dictionary evaluation and optimization for sparse coding based speech processing, Spectral compressive sensing, Sparse signals recovery from noisy measurements by orthogonal matching pursuit, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), A sharp RIP condition for orthogonal matching pursuit, On rank awareness, thresholding, and MUSIC for joint sparse recovery, Unnamed Item, On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm, A rolling bearing fault detection method based on compressed sensing and a neural network, Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling, Stability and Robustness of Weak Orthogonal Matching Pursuits, Binary sparse signal recovery with binary matching pursuit *, Robust sparse recovery via a novel convex model, Unnamed Item, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, Quasi-linear Compressed Sensing, Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems, Alternating direction method of multipliers for solving dictionary learning models, Search for sparse solutions of super-large systems with a tensor structure, Sparsity-Based MIMO Radars, New analysis of manifold embeddings and signal recovery from compressive measurements