Binary-Partition-Tree Creation using a Quasi-Inclusion Criterion

  • Authors:
  • Christian Ferran Bennstrom;Josep R. Casas

  • Affiliations:
  • Universitat Politécnica de Catalunya, Barcelona, Spain;Universitat Politécnica de Catalunya, Barcelona, Spain

  • Venue:
  • IV '04 Proceedings of the Information Visualisation, Eighth International Conference
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 [Region based analysis of video sequences with a general merging algorithm] and [Binary Partition Tree as an Efficient Representation for Image Processing, Segmentation, and Information Retrieval], the notions of merging order, merging model and merging criterion were introduced for thecreation 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.