REGION MERGING VIA GRAPH-CUTS
In this paper, we discuss the use of graph-cuts to merge the regions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmenting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection of low boundaries. Our segmen...
Main Authors: | Jean Stawiaski, Etienne Decenciére |
---|---|
Format: | Article |
Language: | English |
Published: |
Slovenian Society for Stereology and Quantitative Image Analysis
2011-05-01
|
Series: | Image Analysis and Stereology |
Subjects: | |
Online Access: | http://www.ias-iss.org/ojs/IAS/article/view/828 |
Similar Items
-
Improvement of Region-Merging Image Segmentation Accuracy Using Multiple Merging Criteria
by: Haoyu Wang, et al.
Published: (2021-07-01) -
Connectivity Status of Intuitionistic Fuzzy Graph and Its Application to Merging of Banks
by: Jayanta Bera, et al.
Published: (2023-04-01) -
Watershed Segmentation Algorithm Based on Luv Color Space Region Merging for Extracting Slope Hazard Boundaries
by: Mingmei Zhang, et al.
Published: (2020-04-01) -
A Novel Algorithm for Multi-Criteria Ontology Merging through Iterative Update of RDF Graph
by: Mohammed Suleiman Mohammed Rudwan, et al.
Published: (2024-02-01) -
Cooperative Merging Strategy Between Connected Autonomous Vehicles in Mixed Traffic
by: Eleonora Andreotti, et al.
Published: (2022-01-01)