Finding the minimum rate of innovation in the presence of noise
Christopher Gilliam, Thierry Blu
Abstract
Recently, sampling theory has been broadened to include a class of non-bandlimited signals that possess finite rate of innovation (FRI). In this paper, we consider the problem of determining the minimum rate of innovation (RI) in a noisy setting. First, we adapt a recent model-fitting algorithm for FRI recovery and demonstrate that it achieves the Cramer-Rao bounds. Using this algorithm, we then present a framework to estimate the minimum RI based on fitting the sparsest model to the noisy samples whilst satisfying a mean squared error (MSE) criterion - a signal is recovered if the output MSE is less than the input MSE. Specifically, given a RI, we use the MSE criterion to judge whether our model-fitting has been a success or a failure. Using this output, we present a Dichotomic algorithm that performs a binary search for the minimum RI and demonstrate that it obtains a sparser RI estimate than an existing information criterion approach.
BibTeX
@inproceedings{icassp2016_findingtheminimu,
title = {Finding the minimum rate of innovation in the presence of noise},
author = {Christopher Gilliam and Thierry Blu},
booktitle = {ICASSP 2016},
year = {2016}
}