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

摘要: This paper discusses the interest of binary partition trees as a region-oriented image representation. Binary concentrate in compact and structured representation set meaningful regions that can be extracted from an image. They offer multiscale define translation invariant 2-connectivity rule among regions. As shown this paper, used for large number processing goals such filtering, segmentation, information retrieval visual browsing. Furthermore, tree leads to very efficient algorithms. Finally, some applications, it may interesting compute once store subsequent use various applications. In context, shows amount bits necessary encode remains moderate.