Binary-partition-tree creation using a quasi-inclusion criterion
C.F. Bennstrom, Josep R. Casas · Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004. · 2004
The aim of This work is to present how structural relationships among regions can be used in the context of a general merging algorithm based on texture. In Garrido and Salembier (1998) and Salembier and Garrido (2000) 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 configuration of image regions. In order to test the syntactic features approach, a proof of concept has been carried out following a quasi-inclusion criterion.