Generalized Orthogonal Matching Pursuit

DOI10.1109/TSP.2012.2218810zbMATH Open1393.94479arXiv1111.6664OpenAlexW2065321782WikidataQ56698227 ScholiaQ56698227MaRDI QIDQ4574174FDOQ4574174

Authors: Jian Wang, Seokbeop Kwon, Byonghyo Shim 

Publication date: 18 July 2018

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

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.

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

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

Mathematics Subject Classification ID

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

Cited In (32)

• Bayesian approach with extended support estimation for sparse linear regression
• Binary generalized orthogonal matching pursuit
• A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method
• Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
• Perturbation Analysis of Orthogonal Least Squares
• Greedy subspace pursuit for joint sparse recovery
• A compressed sampling receiver based on modulated wideband converter and a parameter estimation algorithm for fractional bandlimited LFM signals
• Identification of dual‐rate sampled errors‐in‐variables systems with time delays
• Cardinality minimization, constraints, and regularization: a survey
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• Title not available (Why is that?)
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• Heuristics for Finding Sparse Solutions of Linear Inequalities
• Distribution agnostic Bayesian compressive sensing with incremental support estimation
• Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
• Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• Large-scale hyperspectral image compression via sparse representations based on online learning
• Compressive sampling for energy spectrum estimation of turbulent flows
• Reduced analytic dependency modeling: robust fusion for visual recognition
• From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
• 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
• A new analysis for support performance with block generalized orthogonal matching pursuit
• Orthogonal Matching Pursuit: A Brownian Motion Analysis
• A survey on compressive sensing: classical results and recent advancements
• Efficiency of orthogonal super greedy algorithm under the restricted isometry property
• Theoretical analysis of GOMP based on RIP and ROC
• A new smoothed L0 regularization approach for sparse signal recovery
• Dynamic thresholding algorithm with memory for linear inverse problems
• Compressed sensing construction for underdetermined source separation
• Design and Generalization Analysis of Orthogonal Matching Pursuit Algorithms

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)