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.