The original hierarchy can be reweighted following a measure of the importance of the catching bassins. Select a measure to reweight the hierarchy or "Disabled" to work on the original hierarchy (default: Volume).
Adjacency describes the neighbooring relation between pixels (default: 8).
This work is an implementation of a marked segmentation approach with Hierarchies of minimum spanning forests.
Hierarchies of minimum spanning forests and algorithms to construct them are described in the following articles:
J. Cousty, L. Najman, B. Perret.Constructive links between some morphological hierarchies on edge-weighted graphs. 11th International Symposium on Mathematical Morphology, ISMM 2013. doi:10.1007/978-3-642-38294-9_8
L. Najman, J. Cousty, B. Perret.Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs. 11th International Symposium on Mathematical Morphology, ISMM 2013. doi:10.1007/978-3-642-38294-9_12
J. Cousty, L. Najman.Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts. 10th International Symposium on Mathematical Morphology, ISMM 2011. doi:10.1007/978-3-642-21569-8_24
The marker based segmentation method is described in:
P. Salembier and L. Garrido. Binary Partition Tree as an Efﬁcient Representation for Image Processing, Segmentation, and Information Retrieval, IEEE Transaction on Image Processing, 2000, 9(4):561-576. doi:10.1109/83.841934.
B. Perret, J. Cousty, O. Tankyevych, H. Talbot and N. Passat. Directed connected operators: asymmetric hierarchies for image filtering and segmentation, Technical Report, 2014.