Binary partition tree as an efficient representation for filtering, segmentation and information retrieval
Philippe Salembier, Luís Garrido · 2002
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.