Our model for tree crown extraction 2/2
Proposition kernel
As explained before, we use a Reversible Jump MCMC algorithm in order to sample the process. The global proposition kernel contains a uniform birth and death kernel (
), a translation kernel (
), a dilation kernel (
), a rotation kernel (
), a split and merge kernel (
), and a birth and death in a neighbourhood kernel (
). Figure (4) shows some of these moves.
Figure 4:
Lefthandside : non jumping kernels, i.e. moves that do not affect the number of objects of the configuration. Righthandside : split and merge kernel, the grey shapes can be seen as the trees we want to extract.
|