English
Related papers

Related papers: Generalized Residual Ratio Thresholding

200 papers

Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the sparsity of…

Machine Learning · Statistics 2018-06-05 Sreejith Kallummil , Sheetal Kalyani

As an extension of orthogonal matching pursuit (OMP) improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm…

Information Theory · Computer Science 2015-06-15 Jian Wang , Suhyuk Kwon , Ping Li , Byonghyo Shim

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…

Information Theory · Computer Science 2014-04-01 Jian Wang , Seokbeop Kwon , Byonghyo Shim

Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension…

Computer Vision and Pattern Recognition · Computer Science 2025-04-28 Huiyuan Yu , Jia He , Maggie Cheng

Recovery of an unknown sparse signal from a few of its projections is the key objective of compressed sensing. Often one comes across signals that are not ordinarily sparse but are sparse blockwise. Existing block sparse recovery algorithms…

Information Theory · Computer Science 2021-11-24 Samrat Mukhopadhyay , Mrityunjoy Chakraborty

In this paper, the joint support recovery of several sparse signals whose supports present similarities is examined. Each sparse signal is acquired using the same noisy linear measurement process, which returns fewer observations than the…

Information Theory · Computer Science 2017-02-20 Jean-François Determe , Jérôme Louveaux , Laurent Jacques , François Horlin

The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. However, compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent,…

Information Theory · Computer Science 2023-12-01 Wei Zhang , Taejoon Kim

This paper studies the joint support recovery of similar sparse vectors on the basis of a limited number of noisy linear measurements, i.e., in a multiple measurement vector (MMV) model. The additive noise signals on each measurement vector…

Information Theory · Computer Science 2015-06-18 J. F. Determe , J. Louveaux , L. Jacques , F. Horlin

Generalized orthogonal matching pursuit (gOMP) algorithm has received much attention in recent years as a natural extension of orthogonal matching pursuit. It is used to recover sparse signals in compressive sensing. In this paper, a new…

Information Theory · Computer Science 2019-08-15 Wengu Chen , Huanmin Ge

Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under…

Information Theory · Computer Science 2020-12-14 Hengkuan Lu , Jian Wang

Compressed Sensing (CS) is a signal processing technique which can accurately recover sparse signals from linear measurements with far fewer number of measurements than those required by the classical Shannon-Nyquist theorem. Block sparse…

Information Theory · Computer Science 2019-01-30 Haifeng Li , Jinming Wen

In this paper, we use the block orthogonal matching pursuit (BOMP) algorithm to recover block sparse signals $\x$ from measurements $\y=\A\x+\v$, where $\v$ is an $\ell_2$-bounded noise vector (i.e., $\|\v\|_2\leq \epsilon$ for some…

Information Theory · Computer Science 2018-05-16 Jinming Wen , Zhengchun Zhou , Zilong Liu , Ming-Jun Lai , Xiaohu Tang

Support recovery of sparse signals from compressed linear measurements is a fundamental problem in compressed sensing (CS). In this paper, we study the orthogonal matching pursuit (OMP) algorithm for the recovery of support under noise. We…

Information Theory · Computer Science 2015-10-28 Jian Wang

In this paper, we introduce a novel algorithm named JS-gOMP, which enhances the generalized Orthogonal Matching Pursuit (gOMP) algorithm for improved noise robustness in sparse signal processing. The JS-gOMP algorithm uniquely incorporates…

Signal Processing · Electrical Eng. & Systems 2025-09-03 Debraj Banerjee , Amitava Chatterjee

We consider the block orthogonal multi-matching pursuit (BOMMP) algorithm for the recovery of block sparse signals. A sharp bound is obtained for the exact reconstruction of block $K$-sparse signals via the BOMMP algorithm in the noiseless…

Information Theory · Computer Science 2017-08-02 Wengu Chen , Huanmin Ge

This work explores the fundamental problem of the recoverability of a sparse tensor being reconstructed from its compressed embodiment. We present a generalized model of block-sparse tensor recovery as a theoretical foundation, where…

Signal Processing · Electrical Eng. & Systems 2024-12-19 Liyang Lu , Zhaocheng Wang , Zhen Gao , Sheng Chen , H. Vincent Poor

Orthogonal Matching pursuit (OMP) is a popular algorithm to estimate an unknown sparse vector from multiple linear measurements of it. Assuming exact sparsity and that the measurements are corrupted by additive Gaussian noise, the success…

Statistics Theory · Mathematics 2020-08-07 Chen Amiraz , Robert Krauthgamer , Boaz Nadler

The simultaneous orthogonal matching pursuit (SOMP) algorithm aims to find the joint support of a set of sparse signals acquired under a multiple measurement vector model. Critically, the analysis of SOMP depends on the maximal inner…

Information Theory · Computer Science 2016-10-14 Jean-François Determe , Jérôme Louveaux , Laurent Jacques , François Horlin

Several exact recovery criteria (ERC) ensuring that orthogonal matching pursuit (OMP) identifies the correct support of sparse signals have been developed in the last few years. These ERC rely on the restricted isometry property (RIP), the…

Information Theory · Computer Science 2015-12-16 Jean-François Determe , Jérôme Louveaux , Laurent Jacques , François Horlin

We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered…

Information Theory · Computer Science 2011-09-27 Jun Fang , Hongbin Li
‹ Prev 1 2 3 10 Next ›