Recognizing hierarchical watersheds
1 : Laboratoire d'Informatique Gaspard-Monge
Université Paris-Est Marne-la-Vallée, Ecole des Ponts ParisTech, ESIEE Paris, Fédération de Recherche Bézout, Centre National de la Recherche Scientifique : UMR8049
Combining hierarchical watersheds has proven to be a good alternative method to outperform individual hierarchical watersheds. Consequently, this raises the question of whether the resulting combinations are hierarchical watersheds themselves. Since the naive algorithm to answer this question has a factorial time complexity, we propose a new characterization of hierarchical watersheds which leads to a quasi-linear time algorithm to determine if a hierarchy is a hierarchical watershed.
| Subject : | : | oral |
| Topics | : | Mathematical Morphology |
| PDF version | : |  PDF version |
