Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)
DOI: 10.1109/icip.1998.723358
|View full text |Cite
|
Sign up to set email alerts
|

Binary partition tree as an efficient representation for filtering, segmentation and information retrieval

Abstract: This paper discusses the interest of Binary Partition Trees as shape-oriented image representations. Binary Partition Trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. This representation can be used for a large number of processing goals such as filtering, segmentation, information retrieval and visual browsing. Furthermore, the processing of the tree representation leads to very efficient algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 22 publications
(17 citation statements)
references
References 10 publications
0
17
0
Order By: Relevance
“…9, the tree is binary (each node has either no child or two children). This is not a constraint on the approach itself, but a binary partition tree [54] is simple to construct and sufficient to illustrate the interest of the approach. Last, let us mention that the similarity estimation can be viewed as a hierarchical segmentation problem.…”
Section: Partition Tree As a Region-based Image Representation: Umentioning
confidence: 99%
See 2 more Smart Citations
“…9, the tree is binary (each node has either no child or two children). This is not a constraint on the approach itself, but a binary partition tree [54] is simple to construct and sufficient to illustrate the interest of the approach. Last, let us mention that the similarity estimation can be viewed as a hierarchical segmentation problem.…”
Section: Partition Tree As a Region-based Image Representation: Umentioning
confidence: 99%
“…Last, any global criterion that is a function of the partition can be used to define the segmentation. For example, the partition creation can use the global peak signalto-noise ratio (PSNR) to define the optimum partition [66], [54].…”
Section: A Unsupervised and Supervised Spatial Segmentationmentioning
confidence: 99%
See 1 more Smart Citation
“…The Binary Partition Tree is a structured and compact representation of regions that can be extracted from an image. It was originally proposed to process and filter images [3]. However, in this work the multiresolution capabilities of the Binary Partition Tree are discussed.…”
Section: Introductionmentioning
confidence: 99%
“…The segmentation is obtained by partitioning (cutting) the graph so that an appropriate criterion is optimized. Several approaches from this category utilize Region Adjacency Graphs (RAGs) where nodes represent regions while edges contain region pairwise dissimilarities [2,8,9]. The pairwise dissimilarities are typically computed using a distance between regions' colour features.…”
Section: Introductionmentioning
confidence: 99%