.png){kind=icon}
返回
Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval
.png){kind=icon}
PRE
AI
DOI：10.1109/83.841934.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper discusses the interest of binary partition trees as a region-oriented image representation, Binary partition trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image, They offer a multiscale representation of the image and define a translation invariant 2-connectivity rule among regions, As shown in this paper, this representation can be used for a large number of processing peals such as filtering, segmentation, information retrieval and visual browsing. Furthermore, the processing of the tree representation leads to very efficient algorithms, Finally, for some applications, it may be interesting to compute the binary partition tree once and to store it for subsequent use for various applications, In this context, the last section of the paper will show that the amount of bits necessary to encode a binary partition tree remains moderate.
Keyword:
browsing
connected operators
information retrieval
mathematical morphology
nonlinear filtering
object recognition
partition tree
pruning strategy
region adjacency graphs
segmentation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Temperature Dependence of 1HN–1HN Distances in Ubiquitin As Studied by Exact Measurements of NOEs
PREAI
分享收藏
查看更多内容