An Overview of Max-Tree Principles, Algorithms and Applications

R. Souza, Luis A. Tavares, L. Rittner, R. Lotufo
{"title":"An Overview of Max-Tree Principles, Algorithms and Applications","authors":"R. Souza, Luis A. Tavares, L. Rittner, R. Lotufo","doi":"10.1109/SIBGRAPI-T.2016.011","DOIUrl":null,"url":null,"abstract":"The max-tree is a mathematical morphology data structure that represents an image through the hierarchical relationship of connected components resulting from different thresholds. It was proposed in 1998 by Salembier et al., since then,many efficient algorithms to build and process it were proposed.There are also efficient algorithms to extract size, shape and contrast attributes of the max-tree nodes. These algorithms al-lowed efficient implementation of connected filters like attribute-openings and development of automatic and semi-automatic applications that compete with the state-of-the-art. This paper reviews the max-tree principles, algorithms, applications and its current trends.","PeriodicalId":424240,"journal":{"name":"2016 29th SIBGRAPI Conference on Graphics, Patterns and Images Tutorials (SIBGRAPI-T)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 29th SIBGRAPI Conference on Graphics, Patterns and Images Tutorials (SIBGRAPI-T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI-T.2016.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

The max-tree is a mathematical morphology data structure that represents an image through the hierarchical relationship of connected components resulting from different thresholds. It was proposed in 1998 by Salembier et al., since then,many efficient algorithms to build and process it were proposed.There are also efficient algorithms to extract size, shape and contrast attributes of the max-tree nodes. These algorithms al-lowed efficient implementation of connected filters like attribute-openings and development of automatic and semi-automatic applications that compete with the state-of-the-art. This paper reviews the max-tree principles, algorithms, applications and its current trends.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大树原理、算法及应用综述
最大树是一种数学形态学数据结构,它通过不同阈值产生的连接组件的层次关系来表示图像。1998年,Salembier等人提出了它,此后,人们提出了许多高效的算法来构建和处理它。还有一些有效的算法可以提取最大树节点的大小、形状和对比度属性。这些算法允许有效地实现连接过滤器,如属性打开和开发与最先进的技术竞争的自动和半自动应用程序。本文综述了极大树的原理、算法、应用及其发展趋势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tensor Fields for Multilinear Image Representation and Statistical Learning Models Applications Introduction to Research in Magnetic Resonance Imaging An Overview of Max-Tree Principles, Algorithms and Applications Image Operator Learning and Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1