Generalized Orthogonal Matching Pursuit

DOI10.1109/TSP.2012.2218810MaRDI QIDQ4574174zbMATH OpenOpenAlexWikidataFDO

Authors Jian Wang, Seokbeop Kwon, Byonghyo Shim

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.6664

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple $N$ indices are identified per iteration. Owing to the selection of multiple correct indices, the gOMP algorithm is finished with much smaller number of iterations when compared to the OMP. We show that the gOMP can perfectly reconstruct any $K$-sparse signals ($K>1$), provided that the sensing matrix satisfies the RIP with $delt{a}_{NK}<fracsqrtNsqrtK+3sqrtN$. We also demonstrate by empirical simulations that the gOMP has excellent recovery performance comparable to $el{l}_1$-minimization technique with fast processing speed and competitive computational complexity.

Recommendations

• Perturbed Orthogonal Matching Pursuit
• Design and Generalization Analysis of Orthogonal Matching Pursuit Algorithms
• Recovery of Sparse Signals via Generalized Orthogonal Matching Pursuit: A New Analysis
• Orthogonal matching pursuit under the restricted isometry property
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
• Perturbation Analysis of Orthogonal Matching Pursuit
• Recovery of sparse signals by orthogonal multi-matching pursuit
• On the efficiency of the orthogonal matching pursuit in compressed sensing
• Orthogonal Matching Pursuit With Thresholding and its Application in Compressive Sensing
• Joint <formula formulatype="inline"><tex Notation="TeX">$k$</tex> </formula>-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares

Cited in

(41)

• Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
• Greedy subspace pursuit for joint sparse recovery
• Large-scale hyperspectral image compression via sparse representations based on online learning
• Efficiency of orthogonal super greedy algorithm under the restricted isometry property
• A compressed sampling receiver based on modulated wideband converter and a parameter estimation algorithm for fractional bandlimited LFM signals
• Distribution agnostic Bayesian compressive sensing with incremental support estimation
• Bayesian approach with extended support estimation for sparse linear regression
• A new smoothed L0 regularization approach for sparse signal recovery
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• A reweighted symmetric smoothed function approximating L₀-norm regularized sparse reconstruction method
• Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
• Compressed sensing construction for underdetermined source separation
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• Orthogonal Matching Pursuit: A Brownian Motion Analysis
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• scientific article; zbMATH DE number 7572477 (Why is no real title available?)
• Perturbation Analysis of Orthogonal Least Squares
• Compressive sampling for energy spectrum estimation of turbulent flows
• Design and Generalization Analysis of Orthogonal Matching Pursuit Algorithms
• Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
• A survey on compressive sensing: classical results and recent advancements
• Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
• Heuristics for Finding Sparse Solutions of Linear Inequalities
• Identification of dual‐rate sampled errors‐in‐variables systems with time delays
• Binary generalized orthogonal matching pursuit
• A new analysis for support performance with block generalized orthogonal matching pursuit
• Theoretical analysis of GOMP based on RIP and ROC
• Cardinality minimization, constraints, and regularization: a survey
• From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
• Dynamic thresholding algorithm with memory for linear inverse problems
• Sparse recovery of decaying signals by the piecewise generalized orthogonal matching pursuit algorithm
• Constructing RBF network based on interference robust projected gradient
• From linear system of equations to artificial intelligence -- the evolution journey of computer tomographic image reconstruction algorithms
• Results on sparsity and estimation accuracy in orthogonal matching pursuit with application to optimal input design
• Recovery conditions for generalized orthogonal matching pursuit based coherence
• Randomized orthogonal matching pursuit algorithm with adaptive partial selection for sparse signal recovery
• Structured measurement matrices based on deterministic Fourier matrices and Gram matrices
• A new framework for compressed sensing by p-concave functions
• General decomposition pursuit algorithm for linear inverse problems
• Reduced analytic dependency modeling: robust fusion for visual recognition

This page was built for publication: Generalized Orthogonal Matching Pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574174)