The algorithm is designed to delineate individual trees from LiDAR point clouds.
In current code, there are two different options:
- spectral graph cut (mcnc_example.m)
- Min-cut/Max-flow (min_cut_max_flow_example.m) Although both methods are called graph cut, they are very different methods.
If you find the algorithm interesting, then please cite this paper: A graph cut approach to 3D tree delineation, using integrated airborne LiDAR and hyperspectral imagery