By Topic

Binary-partition-tree creation using a quasi-inclusion criterion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bennstrom, C.F. ; Dept. of Signal Theor. & Commun., Univ. Politecnica de Catalunya, Barcelona, Spain ; Casas, J.R.

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.

Published in:

Information Visualisation, 2004. IV 2004. Proceedings. Eighth International Conference on

Date of Conference:

14-16 July 2004