By Topic

Robust and efficient recovery of a signal passed through a filter and then contaminated by non-Gaussian noise

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Efromovich, S. ; Dept. of Math. & Stat., New Mexico Univ., Albuquerque, NM, USA

Consider a channel where a continuous periodic input signal is passed through a linear filter and then is contaminated by an additive noise. The problem is to recover this signal when we observe n repeated realizations of the output signal. Adaptive efficient procedures, that are asymptotically minimax over all possible procedures, are known for channels with Gaussian noise and no filter (the case of direct observation). Efficient procedures, based on the smoothness of a recovered signal, are known for the case of Gaussian noise. Robust rate-optimal procedures are known as well. However, there are no results on robust and efficient data-driven procedures; moreover, the known results for the case of direct observation indicate that even a small deviation from Gaussian noise may lead to a drastic change. We show that for the considered case of indirect data and a particular class of so-called supersmooth filters there exists a procedure of recovery of an input signal that possesses the desired properties; namely, it is: adaptive to the smoothness of the input signal; robust to the distribution of the noise; globally and pointwise-efficient, that is, its minimax global and pointwise risks converge with the best constant and rate over all possible estimators as n→∞; and universal in the sense that for a wide class of linear (not necessarily bounded) operators the efficient estimator is a plug-in one. Furthermore, we explain how to employ the obtained asymptotic results for the practically important case of small n (large noise)

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 4 )