nD generalized map pyramids: definition, representations and basic operations - Archive ouverte HAL Access content directly
Journal Articles Pattern Recognition Year : 2006

nD generalized map pyramids: definition, representations and basic operations

Abstract

Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more topological information than graph pyramids. The main contribution of this work is the definition of pyramids of $n$-dimensional generalized maps. This extends the previous works to any dimension, and generalizes them in order to represent any type of pyramid built by using any removal and/or contraction operations. We give basic algorithms that allow to build an n-dimensional generalized pyramid that describes a multi-level segmented image. A pyramid of n-dimensional generalized maps can be implemented in several ways. We propose three possible representations and give conversion algorithms.
Fichier principal
Vignette du fichier
revue-pr2006.pdf (283.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00211784 , version 1 (21-01-2008)

Identifiers

Cite

Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt. nD generalized map pyramids: definition, representations and basic operations. Pattern Recognition, 2006, 39 (4), pp.527-538. ⟨10.1016/j.patcog.2005.10.004⟩. ⟨hal-00211784⟩
380 View
354 Download

Altmetric

Share

Gmail Facebook X LinkedIn More