Recognizing hierarchical watersheds
Résumé
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.
Domaines
Traitement des images [eess.IV]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...