Image Estimators Based On Marked Bins
AbstractThe problem of approximating an “image” S in R^d from a random sample of points is considered. If S is included in a grid of square bins, a plausible estimator of S is defined as the union of the “marked” bins (those containing a sample point). We obtain convergence rates for this estimator and study its performance in the approximation of the border of S. The estimation of “digitalized” images is also addressed by using a Vapnik-Chervonenkis approach. The practical aspects of implementation are discussed in some detail, including some technical improvements on the estimator, whose performance is checked through simulated as well as real data examples.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Universidad Carlos III, Departamento de Estadística y Econometría in its series Statistics and Econometrics Working Papers with number ws045114.
Date of creation: Nov 2004
Date of revision:
Contact details of provider:
Postal: C/ Madrid, 126 - 28903 GETAFE (MADRID)
Web page: http://www.uc3m.es/uc3m/dpto/DEE/departamento.html
More information through EDIRC
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Cuevas, Antonio & Fraiman, Ricardo, 1998. "On visual distances in density estimation: the Hausdorff choice," Statistics & Probability Letters, Elsevier, vol. 40(4), pages 333-341, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.