Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Resample-smoothing of Voronoi intensity estimators

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • بيانات النشر:
      Umeå universitet, Institutionen för matematik och matematisk statistik
      Institute of New Imaging Technologies (INIT), University Jaume I, Castellon, Spain
      Department of Mathematical Sciences, Aalborg University, Aalborg, Denmark
      Université Paris Descartes, Sorbonne Paris Cité, Paris, France
      Department of Mathematics, University Jaume I, Castellon, Spain
      Department of Mathematics and Statistics, Curtin University, Perth, Australia
    • الموضوع:
      2019
    • Collection:
      Umeå University: Publications (DiVA)
    • نبذة مختصرة :
      Voronoi estimators are non-parametric and adaptive estimators of the intensity of a point process. The intensity estimate at a given location is equal to the reciprocal of the size of the Voronoi/Dirichlet cell containing that location. Their major drawback is that they tend to paradoxically under-smooth the data in regions where the point density of the observed point pattern is high, and over-smooth where the point density is low. To remedy this behaviour, we propose to apply an additional smoothing operation to the Voronoi estimator, based on resampling the point pattern by independent random thinning. Through a simulation study we show that our resample-smoothing technique improves the estimation substantially. In addition, we study statistical properties such as unbiasedness and variance, and propose a rule-of-thumb and a data-driven cross-validation approach to choose the amount of smoothing to apply. Finally we apply our proposed intensity estimation scheme to two datasets: locations of pine saplings (planar point pattern) and motor vehicle traffic accidents (linear network point pattern).
    • File Description:
      application/pdf
    • Relation:
      Statistics and computing, 0960-3174, 2019, 29:5, s. 995-1010; orcid:0000-0003-3905-4498; orcid:0000-0002-6721-8608; orcid:0000-0002-6675-533X; orcid:0000-0002-2868-7604; orcid:0000-0001-9499-8382; http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-152073; ISI:000482225200009; Scopus 2-s2.0-85060327193
    • الرقم المعرف:
      10.1007/s11222-018-09850-0
    • Rights:
      info:eu-repo/semantics/openAccess
    • الرقم المعرف:
      edsbas.8A80A49D