This page is dedicated to theory and algorithms for various tree structures used in image processing and computer vision. Such trees are at the basis of several filtering tools that includes connected filters and morphological shaping. They also allows for obtaining saliency maps.

PAPERS

• Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs - International Symposium on Mathematical Morphology, Uppsala : Sweden (2013)
• Constructive links between some morphological hierarchies on edge-weighted graphs- International Symposium on Mathematical Morphology, Uppsala : Sweden (2013)
• A quasi-linear algorithm to compute the tree of shapes of n-D images - International Symposium on Mathematical Morphology, Uppsala : Suède (2013)
• Discrete set-valued continuity and interpolation - International Symposium on Mathematical Morphology, Uppsala : Suède (2013)
• Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts - 10th International Symposium on Mathematical Morphology (ISMM'11), (2011)

SOURCE CODE

• Source code for incremental algorithms. (C language)