Efficient Hierarchical Multi-Object Segmentation in Layered Graphs

L. C. Leon, K. Ciesielski, P. A. Miranda
{"title":"Efficient Hierarchical Multi-Object Segmentation in Layered Graphs","authors":"L. C. Leon, K. Ciesielski, P. A. Miranda","doi":"10.1515/mathm-2020-0108","DOIUrl":null,"url":null,"abstract":"Abstract We propose a novel efficient seed-based method for the multi-object segmentation of images based on graphs, named Hierarchical Layered Oriented Image Foresting Transform (HLOIFT). It uses a tree of the relations between the image objects, with each node in the tree representing an object. Each tree node may contain different individual high-level priors of its corresponding object and defines a weighted digraph, named as layer. The layer graphs are then integrated into a hierarchical graph, considering the hierarchical relations of inclusion and exclusion. A single energy optimization is performed in the hierarchical layered weighted digraph leading to globally optimal results satisfying all the high-level priors. The experimental evaluations of HLOIFT, on medical, natural, and synthetic images, indicate promising results comparable to the related baseline methods that include structural information, but with lower computational complexity. Compared to the hierarchical segmentation by the min-cut/max-flow algorithm, our approach is less restrictive, leading to globally optimal results in more general scenarios, and has a better running time.","PeriodicalId":244328,"journal":{"name":"Mathematical Morphology - Theory and Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Morphology - Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/mathm-2020-0108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract We propose a novel efficient seed-based method for the multi-object segmentation of images based on graphs, named Hierarchical Layered Oriented Image Foresting Transform (HLOIFT). It uses a tree of the relations between the image objects, with each node in the tree representing an object. Each tree node may contain different individual high-level priors of its corresponding object and defines a weighted digraph, named as layer. The layer graphs are then integrated into a hierarchical graph, considering the hierarchical relations of inclusion and exclusion. A single energy optimization is performed in the hierarchical layered weighted digraph leading to globally optimal results satisfying all the high-level priors. The experimental evaluations of HLOIFT, on medical, natural, and synthetic images, indicate promising results comparable to the related baseline methods that include structural information, but with lower computational complexity. Compared to the hierarchical segmentation by the min-cut/max-flow algorithm, our approach is less restrictive, leading to globally optimal results in more general scenarios, and has a better running time.
分层图中高效的分层多目标分割
摘要提出了一种高效的基于种子的基于图的图像多目标分割方法——面向分层分层的图像森林变换(HLOIFT)。它使用图像对象之间关系的树,树中的每个节点表示一个对象。每个树节点可能包含其对应对象的不同单独的高级先验,并定义一个加权有向图,称为层。然后考虑包含和排除的层次关系,将层图整合成一个层次图。在分层加权有向图中进行单个能量优化,得到满足所有高级先验的全局最优结果。HLOIFT在医学、自然和合成图像上的实验评估表明,与包含结构信息但计算复杂度较低的相关基线方法相比,HLOIFT的结果很有希望。与min-cut/max-flow算法的分层分割相比,我们的方法限制更少,在更一般的场景下产生全局最优结果,并且具有更好的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信