Stochastic Hierarchical Watershed Cut Based on Disturbed Topographical Surface

C. A. F. P. Filho, A. Araújo, J. Cousty, S. Guimarães, Laurent Najman
{"title":"Stochastic Hierarchical Watershed Cut Based on Disturbed Topographical Surface","authors":"C. A. F. P. Filho, A. Araújo, J. Cousty, S. Guimarães, Laurent Najman","doi":"10.1109/SIBGRAPI.2016.044","DOIUrl":null,"url":null,"abstract":"In this article we present a hierarchical stochastic image segmentation approach. This approach is based on a framework of edge-weighted graph for minimum spanning forest hierarchy. Image regions, that are represented by trees in a forest, can be merged according to a certain rule in order to create a single tree that represents segments hierarchically. In this article, we propose to add a uniform random noise into the edge-weighted graph and then we build the hierarchy with several realizations of independent segmentations. At the end, we combine all the hierarchical segmentations into a single one. As we show in this article, adding noise into the edge weights improves the segmentation precision of larger image regions and for F-Measure of objects and parts.","PeriodicalId":201572,"journal":{"name":"2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI.2016.044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this article we present a hierarchical stochastic image segmentation approach. This approach is based on a framework of edge-weighted graph for minimum spanning forest hierarchy. Image regions, that are represented by trees in a forest, can be merged according to a certain rule in order to create a single tree that represents segments hierarchically. In this article, we propose to add a uniform random noise into the edge-weighted graph and then we build the hierarchy with several realizations of independent segmentations. At the end, we combine all the hierarchical segmentations into a single one. As we show in this article, adding noise into the edge weights improves the segmentation precision of larger image regions and for F-Measure of objects and parts.
基于扰动地形面的随机分层分水岭切割
在本文中,我们提出了一种分层随机图像分割方法。该方法基于最小生成森林层次结构的边加权图框架。图像区域由森林中的树表示,可以根据一定的规则进行合并,以创建一个分层表示片段的树。在本文中,我们提出在边缘加权图中加入均匀随机噪声,然后通过几种独立分割的实现来构建层次结构。最后,我们将所有的分层分割合并成一个单一的。正如我们在本文中所展示的那样,在边缘权重中添加噪声可以提高较大图像区域的分割精度以及物体和部件的F-Measure。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信