An Alternative Thresholding Rule for Compressed Sensing

10/14/2020
by   Jonathan Ashbrock, et al.
0

Compressed Sensing algorithms often make use of the hard thresholding operator to pass from dense vectors to their best s-sparse approximations. However, the output of the hard thresholding operator does not depend on any information from a particular problem instance. We propose an alternative thresholding rule, Look Ahead Thresholding, that does. In this paper we offer both theoretical and experimental justification for the use of this new thresholding rule throughout compressed sensing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2019

Analysis of Optimal Thresholding Algorithms for Compressed Sensing

The optimal thresholding is a new technique that has recently been devel...
research
06/23/2023

The Proximal Operator of the Piece-wise Exponential Function and Its Application in Compressed Sensing

This paper characterizes the proximal operator of the piece-wise exponen...
research
01/14/2018

Compressed Neighbour Discovery using Sparse Kerdock Matrices

We study the network-wide neighbour discovery problem in wireless networ...
research
03/08/2011

All Roads Lead To Rome

This short article presents a class of projection-based solution algorit...
research
04/20/2023

Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints

The Kaczmarz method (KZ) and its variants, which are types of stochastic...
research
03/23/2018

Deep Convolutional Compressed Sensing for LiDAR Depth Completion

In this paper we consider the problem of estimating a dense depth map fr...
research
02/21/2022

A wonderful triangle in compressed sensing

In order to determine the sparse approximation function which has a dire...

Please sign up or login with your details

Forgot password? Click here to reset