3 - Generate tree cover#
Algorithm ID: hedgetools:generatetreecover
This tool generates a tree cover raster and vector layer using the DHM mask and NDVI mask obtained from Generate DHM and Generate NDVI, respectively. It intersects both masks, retaining only vegetation above the height threshold used to create the DHM mask.
The vector layer is generated from the sieved raster if a sieve operation is performed.
Parameters#
Label |
Name |
Type |
Description |
|---|---|---|---|
Input DHM mask |
|
[raster] |
Binary DHM mask raster. |
DHM band |
|
[raster band] |
Band of the binary DHM raster to use in case of multiband. |
Input NDVI mask |
|
[raster] |
Binary NDVI mask raster. |
NDVI band |
|
[raster band] |
Band of the binary NDVI raster to use in case of multiband. |
Extent of the study area |
|
[extent] |
Input extent from a layer, canvas, or other source to clip the rasters. |
Compute sieved tree cover mask |
|
[boolean] |
If enabled, the tree cover mask is sieved to remove small holes. Recommended to reduce noise in vegetation layers. |
Threshold sieve value (pixel number) |
|
[numeric: integer] |
Minimum number of pixels for a feature to be kept in the sieved mask. |
Handling of extent differences |
|
[enumeration] |
Determines how the tool handles differing DSM and DTM extents:
|
Output resolution (meters) |
|
[numeric: double] |
Change the output raster resolution to the desired value. |
Resampling method |
|
[enumeration] |
Resampling method for output resolution:
|
Output tree cover raster |
|
[raster] |
Output raster. |
Output sieve tree cover raster |
|
[raster] |
Output raster. |
Output vector tree cover |
|
[vector: polygon] |
Polygon vector layer. |
Outputs#
Label |
Name |
Type |
Description |
|---|---|---|---|
Output tree cover raster |
|
[raster] |
Tree cover raster. Intersection of the DHM and NDVI masks. |
Output sieve tree cover raster |
|
[raster] |
Tree cover raster with small holes removed based on the sieve threshold. |
Output vector tree cover |
|
[vector: polygon] |
Vectorized tree cover used in subsequent algorithms. |