期刊
IEEE TRANSACTIONS ON IMAGE PROCESSING
卷 9, 期 4, 页码 561-576出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/83.841934
关键词
browsing; connected operators; information retrieval; mathematical morphology; nonlinear filtering; object recognition; partition tree; pruning strategy; region adjacency graphs; segmentation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据