Back to Search
Start Over
Estimating Signals With Finite Rate of Innovation From Noisy Samples: A Stochastic Algorithm.
- Source :
-
IEEE Transactions on Signal Processing . Oct2008 Part 2 of 2, Vol. 56 Issue 10, p5135-5146. 12p. 2 Black and White Photographs, 1 Diagram, 2 Charts, 10 Graphs. - Publication Year :
- 2008
-
Abstract
- As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear filtering followed by uniform sampling. However, in reality, samples are rarely noiseless. In this paper, we introduce a novel stochastic algorithm to reconstruct a signal with finite rate of innovation from its noisy samples. Even though variants of this problem have been approached previously, satisfactory solutions are only available for certain classes of sampling kernels, for example, kernels that satisfy the Strang-Fix condition. In this paper, we consider the infinite-support Gaussian kernel, which does not satisfy the Strang-Fix condition. Other classes of kernels can be employed. Our algorithm is based on Gibbs sampling, a Markov chain Monte Carlo method. Extensive numerical simulations demonstrate the accuracy and robustness of our algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 1053587X
- Volume :
- 56
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Signal Processing
- Publication Type :
- Academic Journal
- Accession number :
- 34502478
- Full Text :
- https://doi.org/10.1109/TSP.2008.928510