Evaluation of Hierarchical Watersheds

Perret, Benjamin; Cousty, Jean; Guimarães, Silvio Jamil Ferzoli; Maia, Deise Santana

doi:10.1109/tip.2017.2779604

Cited by 40 publications

(44 citation statements)

References 56 publications

(94 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The set of quasi-flat zones of the weighted graph at all levels λ forms the quasi-flat zones hierarchy of the weighted graph. According to [11], we chose to use the Structured Edge Detector (SED) [4] in order to weight the edges of the graph: indeed this detector offers good performances in combination with quasi-flat zones hierarchies on natural images while being fast to compute. To further improve the invariance of the salient region detection process (in particular, the definition of the depth of a region), we propose to perform a histogram normalization of the gradient produced by SED.…”

Section: Methodsmentioning

confidence: 99%

Hierarchy-Based Salient Regions: A Region Detector Based on Hierarchies of Partitions

Otiniano-Rodríguez

Araújo

Cámara-Chávez

et al. 2019

Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

Self Cite

View full text Add to dashboard Cite

This article introduces a novel region detector based on hierarchies of partitions, so-called Hierarchy-Based Salient Regions (HBSR). This approach enables to combine the clues given by a high quality contour detector with a custom salient region detection procedure. The evaluation of the proposed method HBSR with a standard feature detection assessment framework shows that HBSR outperforms the state-of-the-art methods, in average. These promising results may lead to improvements in many computer vision tasks.

show abstract

Section: Methodsmentioning

confidence: 99%

Hierarchy-Based Salient Regions: A Region Detector Based on Hierarchies of Partitions

Otiniano-Rodríguez

Araújo

Cámara-Chávez

et al. 2019

Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is worth noting that a number of works appeared aimed at theoretical and practical development of watershed optimized versions. For instance, a paper [40] extended a graph-based image segmentation framework and proposed a new family of algorithms termed power watersheds; a paper [41] proposed a novel evaluation framework that is used to optimize hierarchies for hierarchical watersheds.…”

Section: Watershed By Rain Fallingmentioning

confidence: 99%

An Overview of Watershed Algorithm Implementations in Open Source Libraries

2018

View full text Add to dashboard Cite

Watershed is a widespread technique for image segmentation. Many researchers apply the method implemented in open source libraries without a deep understanding of its characteristics and limitations. In the review, we describe benchmarking outcomes of six open-source marker-controlled watershed implementations for the segmentation of 2D and 3D images. Even though the considered solutions are based on the same algorithm by flooding having O(n)computational complexity, these implementations have significantly different performance. In addition, building of watershed lines grows processing time. High memory consumption is one more bottleneck for dealing with huge volumetric images. Sometimes, the usage of more optimal software is capable of mitigating the issues with the long processing time and insufficient memory space. We assume parallel processing is capable of overcoming the current limitations. However, the development of concurrent approaches for the watershed segmentation remains a challenging problem.

show abstract

“…Thus, one can obtain a series of nested partitions, hence a hierarchy of partitions as defined in this article, where every partition is optimal. These hierarchies are studied in [12,14,35,41].…”

Section: Hierarchical Minimum Spanning Forests and Watershedsmentioning

confidence: 99%

Hierarchical Segmentations with Graphs: Quasi-flat Zones, Minimum Spanning Trees, and Saliency Maps

et al. 2017

Self Cite

View full text Add to dashboard Cite

Hierarchies of partitions are generally represented by dendrograms (direct representation). They can also be represented by saliency maps or minimum spanning trees. In this article, we precisely study the links between these three representations. In particular, we provide a new bijection between saliency maps and hierarchies based on quasi-flat zones as often used in image processing and we characterize saliency maps and minimum spanning trees as solutions to constrained minimization problems where the constraint is quasiflat zones preservation. In practice, these results make up a toolkit for designing new hierarchical methods where one can choose the most convenient representation. They also invite us to process non-image data with morphological hierarchies. More precisely, we show the practical interest of the proposed framework for: i) hierarchical watershed image segmentations, ii) combinations of different hierarchical segmentations, iii) hierarchicalizations of some non-hierarchical image segmentation methods based on regional dissimilarities, and iv) hierarchical analysis of geographical data.

show abstract

Evaluation of Hierarchical Watersheds

Cited by 40 publications

References 56 publications

Hierarchy-Based Salient Regions: A Region Detector Based on Hierarchies of Partitions

Hierarchy-Based Salient Regions: A Region Detector Based on Hierarchies of Partitions

An Overview of Watershed Algorithm Implementations in Open Source Libraries

Hierarchical Segmentations with Graphs: Quasi-flat Zones, Minimum Spanning Trees, and Saliency Maps

Contact Info

Product

Resources

About