Modified omp algorithm for exponentially decaying signals

9Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

A group of signal reconstruction methods, referred to as compressed sensing (CS), has recently found a variety of applications in numerous branches of science and technology. However, the condition of the applicability of standard CS algorithms (e.g., orthogonal matching pursuit, OMP), i.e., the existence of the strictly sparse representation of a signal, is rarely met. Thus, dedicated algorithms for solving particular problems have to be developed. In this paper, we introduce a modification of OMP motivated by nuclear magnetic resonance (NMR) application of CS. The algorithm is based on the fact that the NMR spectrum consists of Lorentzian peaks and matches a single Lorentzian peak in each of its iterations. Thus, we propose the name Lorentzian peak matching pursuit (LPMP). We also consider certain modification of the algorithm by introducing the allowed positions of the Lorentzian peaks’ centers. Our results show that the LPMP algorithm outperforms other CS algorithms when applied to exponentially decaying signals.

Cite

CITATION STYLE

APA

Kazimierczuk, K., & Kasprzak, P. (2015). Modified omp algorithm for exponentially decaying signals. Sensors (Switzerland), 15(1), 234–247. https://doi.org/10.3390/s150100234

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free