Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs

The goal of this paper is to provide linear or quasi-linear algorithms for producing some of the various trees used in mathemetical morphology, in particular the trees corresponding to hierarchies of watershed cuts and hierarchies of constrained connectivity. A specific binary tree, corresponding to an ordered version of the edges of the minimum spanning tree, is the key structure in this study, and is computed thanks to variations around Kruskal algorithm for minimum spanning tree.

[1]  Gilles Bertrand,et al.  Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  Philippe Salembier,et al.  Antiextensive connected operators for image and sequence processing , 1998, IEEE Trans. Image Process..

[4]  Petros Maragos,et al.  Morphological Scale-Space Representation with Levelings , 1999, Scale-Space.

[5]  Pierre Soille,et al.  Pattern Spectra from Partition Pyramids and Hierarchies , 2011, ISMM.

[6]  Pierre Soille,et al.  Constrained connectivity for hierarchical image partitioning and simplification , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Fernand Meyer,et al.  Minimum Spanning Forests for Morphological Segmentation , 1994, ISMM.

[8]  Laurent Najman,et al.  Segmentation, Minimum Spanning Tree and Hierarchies , 2013 .

[9]  Makoto Nagao,et al.  Region extraction and shape analysis in aerial photographs , 1979 .

[10]  Benjamin Perret,et al.  Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs , 2013, ISMM.

[11]  Myungcheol Lee,et al.  Graph theory for image analysis: an approach based on the shortest spanning tree , 1986 .

[12]  Jean Cousty,et al.  Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts , 2011, ISMM.

[13]  Laurent Najman,et al.  On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds , 2010, Journal of Mathematical Imaging and Vision.

[14]  Philippe Salembier,et al.  Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval , 2000, IEEE Trans. Image Process..

[15]  Laurent Najman,et al.  Geodesic Saliency of Watershed Contours and Hierarchical Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Joachim Weickert,et al.  Scale-Space Theories in Computer Vision , 1999, Lecture Notes in Computer Science.

[17]  John I. Goutsias,et al.  Mathematical Morphology and its Applications to Image and Signal Processing , 2000, Computational Imaging and Vision.

[18]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.