Recognizing Hierarchical Watersheds

@inproceedings{Maia2019RecognizingHW,
  title={Recognizing Hierarchical Watersheds},
  author={Deise Santana Maia and Jean Cousty and Laurent Najman and Benjamin Perret},
  booktitle={DGCI},
  year={2019}
}
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. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Characterization of graph-based hierarchical watersheds: theory and algorithms

Deise Santana Maia, Jean Cousty, Laurent Najman, Benjamin Perret
  • 2019
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2009
VIEW 4 EXCERPTS

Contour Detection and Hierarchical Image Segmentation

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2011
VIEW 1 EXCERPT