English
Related papers

Related papers: Signal and Noise Statistics Oblivious Sparse Recon…

200 papers

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

Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More…

Information Theory · Computer Science 2012-02-10 Lianlin Li

Greedy approaches in general, and orthogonal matching pursuit in particular, are the most commonly used sparse recovery techniques in a wide range of applications. The complexity of these approaches is highly dependent on the size of the…

Signal Processing · Electrical Eng. & Systems 2022-08-25 Joan Palacios , Nuria González-Prelcic , Cristian Rusu

We study quantum sparse recovery in non-orthogonal, overcomplete dictionaries: given coherent quantum access to a state and a dictionary of vectors, the goal is to reconstruct the state up to $\ell_2$ error using as few vectors as possible.…

Quantum Physics · Physics 2025-10-09 Armando Bellante , Stefano Vanerio , Stefano Zanero

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

We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogonal Matching Pursuit (OMP) and Thresholding. While recovery by…

Classical Analysis and ODEs · Mathematics 2007-05-23 Stefan Kunis , Holger Rauhut

In this paper, we address the sparse multiple measurement vector (MMV) problem where the objective is to recover a set of sparse nonzero row vectors or indices of a signal matrix from incomplete measurements. Ideally, regardless of the…

Information Theory · Computer Science 2016-01-27 Kyung Su Kim , Sae-Young Chung

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

This paper proposes and analyzes a mmWave sparse channel estimation technique for OFDM systems that uses the Orthogonal Matching Pursuit (OMP) algorithm. This greedy algorithm retrieves one additional multipath component (MPC) per iteration…

Information Theory · Computer Science 2018-12-19 Felipe Gomez-Cuba , Andrea J. Goldsmith

Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is…

Information Theory · Computer Science 2015-05-30 Zai Yang , Cishen Zhang , Jun Deng , Wenmiao Lu

Direction of Arrival (DOA) estimation of mixed uncorrelated and coherent sources is a long existing challenge in array signal processing. Application of compressive sensing to array signal processing has opened up an exciting class of…

Signal Processing · Electrical Eng. & Systems 2018-09-10 Abhishek Aich , P. Palanisamy

Direction of Arrival (DOA) estimation of multiple narrow-band coherent or partially coherent sources is a major challenge in array signal processing. Though many subspace- based algorithms are available in literature, none of them tackle…

Information Theory · Computer Science 2018-01-26 Abhishek Aich , P. Palanisamy

We present a theoretical analysis of the average performance of OMP for sparse approximation. For signals that are generated from a dictionary with $K$ atoms and coherence $\mu$ and coefficients corresponding to a geometric sequence with…

Information Theory · Computer Science 2019-07-16 Karin Schnass

Orthogonal Matching Pursuit (OMP) plays an important role in data science and its applications such as sparse subspace clustering and image processing. However, the existing OMP-based approaches lack of data adaptiveness so that the data…

Machine Learning · Computer Science 2019-09-02 Jiaqiyu Zhan , Zhiqiang Bai , Yuesheng Zhu

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

We study the reconstruction of discrete-valued sparse signals from underdetermined systems of linear equations. On the one hand, classical compressed sensing (CS) is designed to deal with real-valued sparse signals. On the other hand,…

Information Theory · Computer Science 2013-10-10 Susanne Sparrer , Robert F. H. Fischer

In this paper we define a new coherence index, named the global 2-coherence, of a given dictionary and study its relationship with the traditional mutual coherence and the restricted isometry constant. By exploring this relationship, we…

Information Theory · Computer Science 2014-05-15 Mingrui Yang , Frank de Hoog

Simultaneous orthogonal matching pursuit (SOMP) and block OMP (BOMP) are two widely used techniques for sparse support recovery in multiple measurement vector (MMV) and block sparse (BS) models respectively. For optimal performance, both…

Machine Learning · Statistics 2020-05-26 Sreejith Kallummil , Sheetal Kalyani

Hyperspectral Imaging (HSI) is used in a wide range of applications such as remote sensing, yet the transmission of the HS images by communication data links becomes challenging due to the large number of spectral bands that the HS images…

Computer Vision and Pattern Recognition · Computer Science 2024-01-29 Jon Alvarez Justo , Milica Orlandic

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
‹ Prev 1 3 4 5 6 7 10 Next ›