Open Access
December 1998 On global performance of approximations to smooth curves using gridded data
Peter Hall, Marc Raimondo
Ann. Statist. 26(6): 2206-2217 (December 1998). DOI: 10.1214/aos/1024691467

Abstract

Approximating boundaries using data recorded on a regular grid induces discrete rounding errors in both vertical and horizontal directions. In cases where grid points exhibit at least some degree of randomness, an extensive theory has been developed for local-polynomial boundary estimators. It is inapplicable to regular grids, however. In this paper we impose strict regularity of the grid and describe the performance of local linear estimators in this context. Unlike the case of classical curve estimation problems, pointwise convergence rates vary erratically along the boundary, depending on number-theoretic properties of the boundary’s slope. However, average convergence rates, expressed in the $L_1$ metric, are much less susceptible to fluctuation. We derive theoretical bounds to performance, coming within no more than a logarithmic factor of the optimal convergence rate.

Citation

Download Citation

Peter Hall. Marc Raimondo. "On global performance of approximations to smooth curves using gridded data." Ann. Statist. 26 (6) 2206 - 2217, December 1998. https://doi.org/10.1214/aos/1024691467

Information

Published: December 1998
First available in Project Euclid: 21 June 2002

zbMATH: 0933.62026
MathSciNet: MR1700228
Digital Object Identifier: 10.1214/aos/1024691467

Subjects:
Primary: 62G20

Keywords: $L_1$ metric , Digital image , image analysis , lattice , local linear smoothing , local polynomial smoothing , metric number theory , numerical analysis , pixel grid

Rights: Copyright © 1998 Institute of Mathematical Statistics

Vol.26 • No. 6 • December 1998
Back to Top