. Binary-Partition Tree creation using a quasi-inclusion criterion. In 8th International Conference on Information Visualization (IV04). 2004. pp. 259–264. 
(217.17 KB)
(217.17 KB) Abstract
The aim of this paper is to present how structural relationships among regions can be used in the context of a general merging algorithm based on texture. In [1] and [2], the notions of merging order, merging model and merging criterion were introduced for the creation of Binary-Partition- Trees (BPTs). We extend this framework to syntactic features, representing geometric relationships between image regions, which are taken into account for the creation of the BPT. In particular, we perform structure analysis on the shapes and the spatial conguration of image regions. In order to test the syntactic features approach, a proof of concept has been carried out following a quasi-inclusion criterion.