Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Comparison of threshold-based algorithms for sparse signal recovery (1802.07180v1)

Published 18 Feb 2018 in eess.SP and cs.MM

Abstract: Intensively growing approach in signal processing and acquisition, the Compressive Sensing approach, allows sparse signals to be recovered from small number of randomly acquired signal coefficients. This paper analyses some of the commonly used threshold-based algorithms for sparse signal reconstruction. Signals satisfy the conditions required by the Compressive Sensing theory. The Orthogonal Matching Pursuit, Iterative Hard Thresholding and Single Iteration Reconstruction algorithms are observed. Comparison in terms of reconstruction error and execution time is performed within the experimental part of the paper.

Summary

We haven't generated a summary for this paper yet.