Skip to main navigation Skip to search Skip to main content

On a Sparse Approximation of Compressible Signals

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

Many physical phenomena can be modeled by compressible signals, i.e., the signals with rapidly declining sample amplitudes. Although all the samples are usually nonzero, due to practical reasons such signals are attempted to be approximated as sparse ones. Because sparsity of compressible signals cannot be unambiguously determined, a decision about a particular sparse representation is often a result of comparison between a residual error energy of a reconstruction algorithm and some quality measure. The paper explores a relation between mean square error (MSE) of the recovered signal and the residual error. A novel, practical solution that controls the sparse approximation quality using a target MSE value is the result of these considerations. The solution was tested in numerical experiments using orthogonal matching pursuit (OMP) algorithm as the signal reconstruction procedure. The obtained results show that the proposed quality metric provides fine control over the approximation process of the compressible signals in the mean sense even though it has not been directly designed for use in compressed sensing methods such as OMP.

Original languageEnglish
Pages (from-to)2232-2243
Number of pages12
JournalCircuits, Systems, and Signal Processing
Volume39
Issue number4
DOIs
Publication statusPublished - 1 Apr 2020

Keywords

  • Compressible signals
  • Compressive sensing
  • Least squares estimation
  • Orthogonal greedy algorithm
  • Orthogonal matching pursuit
  • Signal identification
  • Sparse signals

ASJC Scopus subject areas

  • Signal Processing
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On a Sparse Approximation of Compressible Signals'. Together they form a unique fingerprint.

Cite this