AI Chat AI Image Generator AI Video Text to Speech

Thresholding Greedy Pursuit for Sparse Recovery Problems

03/17/2021

∙

by Hai Le, et al.

∙

∙

We study here sparse recovery problems in the presence of additive noise. We analyze a thresholding version of the CoSaMP algorithm, named Thresholding Greedy Pursuit (TGP). We demonstrate that an appropriate choice of thresholding parameter, even without the knowledge of sparsity level of the signal and strength of the noise, can result in exact recovery with no false discoveries as the dimension of the data increases to infinity.

Hai Le
1 publication
Alexei Novikov
7 publications

research

∙ 10/14/2022

Multiple Choice Hard Thresholding Pursuit (MCHTP) for Simultaneous Sparse Recovery and Sparsity Order Estimation

We address the problem of sparse recovery using greedy compressed sensin...

0 Samrat Mukhopadhyay, et al. ∙

research

∙ 12/18/2019

Generalized Residual Ratio Thresholding

Simultaneous orthogonal matching pursuit (SOMP) and block OMP (BOMP) are...

0 Sreejith Kallummil, et al. ∙

research

∙ 08/05/2019

The Noise Collector for sparse recovery in high dimensions

The ability to detect sparse signals from noisy high-dimensional data is...

4 Miguel Moscoso, et al. ∙

research

∙ 10/14/2020

Learned Greedy Method (LGM): A Novel Neural Architecture for Sparse Coding and Beyond

The fields of signal and image processing have been deeply influenced by...

0 Rajaei Khatib, et al. ∙

research

∙ 11/13/2018

Fundamental Limits of Exact Support Recovery in High Dimensions

We study the support recovery problem for a high-dimensional signal obse...

0 Zheng Gao, et al. ∙

research

∙ 06/21/2018

Are good local minima wide in sparse recovery?

The idea of compressed sensing is to exploit representations in suitable...

0 Michael Moeller, et al. ∙

research

∙ 06/07/2023

Stochastic Natural Thresholding Algorithms

Sparse signal recovery is one of the most fundamental problems in variou...

0 Rachel Grotheer, et al. ∙