A Non-Bayesian Model for Tree Crown Extraction using Marked Point Processes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2006

A Non-Bayesian Model for Tree Crown Extraction using Marked Point Processes

Guillaume Perrin
  • Fonction : Auteur
  • PersonId : 756485
  • IdRef : 178652474
Xavier Descombes
Josiane Zerubia
  • Fonction : Auteur
  • PersonId : 833424

Résumé

High resolution aerial and satellite images of forests have a key role to play in natural resource management. As they enable forestry managers to study forests at the scale of trees, it is now possible to get a more accurate evaluation of the resources. Automatic algorithms are needed in that prospect to assist human operators in the exploitation of these data. In this paper, we present a stochastic geometry approach to extract 2D and 3D parameters of the trees, by modelling the stands as some realizations of a marked point process of ellipses or ellipsoids, whose points are the locations of the trees and marks their geometric features. As a result we obtain the number of stems, their position, and their size. This approach yields an energy minimization problem, where the energy embeds a regularization term (prior density), which introduces some interactions between the objects, and a data term, which links the objects to the features to be extracted, in 2D and 3D. Results are shown on Colour Infrared aerial images provided by the French National Forest Inventory (IFN)
Fichier principal
Vignette du fichier
RR-5846.pdf (5.8 Mo) Télécharger le fichier
Loading...

Dates et versions

inria-00070180 , version 1 (19-05-2006)

Identifiants

  • HAL Id : inria-00070180 , version 1

Citer

Guillaume Perrin, Xavier Descombes, Josiane Zerubia. A Non-Bayesian Model for Tree Crown Extraction using Marked Point Processes. [Research Report] RR-5846, INRIA. 2006, pp.34. ⟨inria-00070180⟩
270 Consultations
260 Téléchargements

Partager

Gmail Facebook X LinkedIn More