Distance based plots

Forest Inventory lecturenotes

Category Forest Inventory lecturenotes not found

General observations

Figure 1 Some variations of k-tree sampling (Kleinn 2007).

Figure 2 Illustration why the simple expansion factor approach does produce a systematic overestimation for k-tree sampling (Kleinn 2007).

Figure 3 Illustration why the simple expansion factor approach does produce a systematic overestimation for k-tree sampling (Kleinn 2007).

Figure 4Left: Inclusion zone for the central tree for k=6 for a regular square lattice of trees; right: inclusion zone for one tree for k=3; here, also the trees are marked that need to be mapped in order to be able to construct the 3rd order Voronoi diagram (Kleinn and Vilcko 2006).

Point-to-tree distance techniques are also applied in ecological studies in which the k nearest objects (trees or plants) to a sample point are included and constitute the set of sample objects for that particular location. The idea of point-to-tree distance sampling is striking, because it greatly facilitates field work (if the values of k are not too big) under many conditions.

All sample plots contain the same number of k trees, so that both empty plots and very high frequency plots are avoided. Because of the fixed number of trees (objects), this class of response designs is also referred to as fixed-count distance methods while in the context of ecological methodology it is also referred to as plotless methods because there is no need to lay out a fixed plot area.

Here we use the term k-tree sampling to indicate that it is a generalized fixed number of objects that are to be counted. While applications of k-tree sampling can be found in many fields (Engeman et al. 1994, for example, mention density estimation of colonial-nesting seabirds and density of rat damage in sugar cane), we focus here on the forestry context where - in addition to density - many more tree attributes are to be estimated.

Some variations of k-tree distance sampling are depicted in Figure 1. The 6-tree technique was proposed by Prodan (1968) and is still being used for forest management inventories in South Western Germany. Prodan (1968) and Schöpfer (1969a,b) found that a k-value of 6 had optimal properties in terms of practical applicability and statistical performance.

T‑square sampling and the point centered quarter (PCQ) method (Figure 1 B and C) are mainly used in ecological sampling studies and in particular for density estimation; they may be seen as “restricted point-to-tree distance techniques” because they introduce further conditions for the selection of the sample trees, mainly in order to reduce the possibility that among the k selected trees there are pairs of trees very close together: in the T square technique (k=2), the tree closest to the sample point is selected; but then the second tree to be selected is the one closest to the first closest tree on the side opposite to the sample point. It therefore is a combination of point-to-tree and tree-to-tree distance sampling. While T-square sampling is usually presented for k=2, one could extend it to the selection of more trees along the rule defined for the selection of the second tree.

In the PCQ method, four quadrants are established around the sample point and in each quadrant the tree closest to the sample point is selected so that k=4. Variations of this technique include subdividing the space around the sample points into numbers other than j=4 equal sections. Another variation would be to select m > 1 trees in each of the j sectors, forming a k=mj sample.

k-tree sampling may also be implemented as a transect of fixed width and variable length (see Figure 1 C) where the transect is being extended until the k-tree is reached.

We focus here on case A in Figure 1, the unrestricted k-tree distance sampling. A common approach to estimation from fixed area plots is to calculate an expansion factor which converts the per-plot values to their equivalent per hectare; to calculate the expansion factor a plot area needs to be defined which obviously depends in some way on the distances between the sample point and the k trees. By using a seemingly straightforward approach and defining the plot area as a circle with radius equal to the distance to the k tree, however, we produce a systematic overestimation, i.e. a positive estimator bias.

Taking the area defined by the distance to the k tree we are establishing the smallest possible circular plot and this in turn yields the largest possible expansion factor. If we extended the radius up to but not including the k+1 tree, there would still be k trees within the plot but the expansion factor would be smaller! This is illustrated in Figure 2.

If we follow the expansion factor approach, it is obvious that the correct plot radius must be somewhere between the distance to the k tree and the distance to the k-1 tree. In a simulation study, Kleinn and Vilcko (2006a) showed that the circle plot through the k tree produces a systematic overestimation and the circle plot through the k+1 tree produces a systematic underestimation; where, of course, for increasing values of k the bias becomes smaller and smaller. This is illustrated in Figure 3.

Empirical observations

A number of (biased) empirical estimators have been introduced while a (difficult to apply though) unbiased estimator was only presented by Kleinn and Vilcko in 2006. The approaches to empirical estimation or approximation can be broken down into two categories:

1. empirical approaches in which the appropriate size of a circular plot around the sample point is searched from the distances to the k trees, and
2. model-based approaches which are based on assumptions about the point pattern of the trees in the stand.

An early estimator for the 6-tree method uses the idea that the k tree is only half contained in the sample plot, if the radius of the circle plot is measured from the sample point to the centre of the k tree (Stoffels 1955 for k=3 and density estimation, Prodan 1968 for k=6 and estimations of any tree attribute). Then, for k=6, the per-plot approximation formulae for basal area and number of trees per hectare are

\[\frac{G}{ha}=\frac{10000}{{\pi}r_6^2}\frac{\pi}{4}\left(\sum_{i=1}^{5}d_i^2+\frac{1}{2}d_6^2\right)\,\]

and

\[\frac{N}{ha}=\frac{10000}{{\pi}r_6^2}*5.5,\,\]

respectively, where \(r_6\) is the distance from the sample point to the centre of the \(6^th\)-nearest tree, and \(d_6\) is its diameter at breast height. Then

\[EF=\frac{10000}{{\pi}r_6^2}\,\]

is the per-plot expansion factor.

For density estimation, Eberhardt (1967) found that the factor (k-1)/k accounted for the positive estimator bias in a random forest and for a particular type of clustering, when the distance to the k tree is used as radius of the sample plot for expansion.

Kleinn and Vilcko (2006) presented another empirical estimator in which the radius of the circular plot is simply calculated from the mean of the distances to the k and to the k+1 tree, either as the arithmetic

\[r_{md}=\frac{1}{2}(d_k+d_{k+1})\,\]

or as the mean quadratic mean, which corresponds to the radius of the circle that has average area

\[r_{ma}=\sqrt{\frac{1}{2}\left(d_k^2+d_{k+1}^2\right)}.\,\]

In a comprehensive simulation study carried out by Magnussen et al. (2008) it showed that this approach performed consistently best in terms of bias and error variance when compared to other empirical estimators.

Unbiased estimator

A design-unbiased estimator for k-tree sampling had been developed by finding the inclusion zones (Kleinn and Vilcko 2006) for each one of the k trees selected in a k-tree sample. These inclusion zones must be such that for any point within that zone the particular tree is either the next or the \(2^nd\) next or the \(3^rd\) next or … the \(k^th\) next tree; they are build as the so-called higher order Voronoi diagrams which require the mapping of a series of trees around the sample trees. While this approach allows developing the first ever unbiased estimator, it is not really practical to map many trees around the sample trees (See also jigsaw puzzles for k-tree sampling).