Image Estimators Based On Marked Bins
The 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.
|Date of creation:||Nov 2004|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://portal.uc3m.es/portal/page/portal/dpto_estadistica
More information through EDIRC
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.:
- Klemelä, Jussi, 2004. "Complexity penalized support estimation," Journal of Multivariate Analysis, Elsevier, vol. 88(2), pages 274-297, February.
- 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.
When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws045114. See general information about how to correct material in RePEc.
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.