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

Author

Bennström, Christian Ferran ; Casas, Josep R.

Author_Institution

Dept. of Signal Theor. & Commun., Univ. Politecnica de Catalunya, Barcelona, Spain

fYear

2004

fDate

14-16 July 2004

Firstpage

259

Lastpage

264

Abstract

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.

Keywords

computational geometry; image representation; image segmentation; image texture; merging; trees (mathematics); binary partition tree creation; general merging algorithm; merging criterion; merging model; merging order; quasiinclusion criterion; spatial configuration; structure analysis; syntactic features; Context; Geometry; Image analysis; Image segmentation; Merging; Partitioning algorithms; Performance analysis; Shape; Testing; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

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

ISSN

1093-9547

Print_ISBN

0-7695-2177-0

Type

conf

DOI

10.1109/IV.2004.1320154

Filename

1320154