Discrete-transform approach to deconvolution problems
If Fourier series are used as the basis for inference in deconvolution problems, the effects of the errors factorise out in a way that is easily exploited empirically. This property is the consequence of elementary addition formulae for sine and cosine functions, and is not readily available when one is using methods based on other orthogonal series or on continuous Fourier transforms. It allows relatively simple estimators to be constructed, founded on the addition of finite series rather than on integration. The performance of these methods can be particularly effective when edge effects are involved, since cosine series estimators are quite resistant to boundary problems. In this context we point to the advantages of trigonometric-series methods for density deconvolution; they have better mean squared error performance when edge effects are involved, they are particularly easy to code, and they admit a simple approach to empirical choice of smoothing parameter, in which a version of thresholding, familiar in wavelet-based inference, is used in place of conventional smoothing. Applications to other deconvolution problems are briefly discussed. Copyright 2005, Oxford University Press.
Year of publication: |
2005
|
---|---|
Authors: | Hall, Peter ; Qiu, Peihua |
Published in: |
Biometrika. - Biometrika Trust, ISSN 0006-3444. - Vol. 92.2005, 1, p. 135-148
|
Publisher: |
Biometrika Trust |
Saved in:
Saved in favorites
Similar items by person
-
Tracking Edges, Corners and Vertices in an Image
HALL, PETER, (2008)
-
Nonparametric methods for solving the Berkson errors-in-variables problem
Delaigle, Aurore, (2006)
-
Jump surface estimation, edge detection, and image restoration
Qiu, Peihua, (2007)
- More ...