.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
browsing
connected operators
information retrieval
mathematical morphology
nonlinear filtering
object recognition
partition tree
pruning strategy
region adjacency graphs
segmentation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
No organization information available