Hierarchical image partitioning using combinatorial maps - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Hierarchical image partitioning using combinatorial maps

Résumé

We present a hierarchical partitioning of images using a pairwise similarity function on a combinatorial map based representation. We used the idea of minimal spanning tree to find region borders quickly in a bottom-up way, based on local differences. The result is a hierarchy of image partitions with multiple resolutions suitable for further goal driven analysis. The algorithm can handle large variation and gradient intensity in images. Dual graph representations lack an explicit encoding of the orientation of planes, existing in combinatorial maps.
Fichier principal
Vignette du fichier
IPPR-LB-2005.pdf (519.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00815662 , version 1 (19-04-2013)

Identifiants

  • HAL Id : hal-00815662 , version 1

Citer

Yll Haxhimusa, Adrian Ion, Walter G. Kropatsch, Luc Brun. Hierarchical image partitioning using combinatorial maps. Joint Hungarian-Austrian Conference on Image Processing and Pattern Recognition, 2005, Prague, Czech Republic. pp.179-186. ⟨hal-00815662⟩
217 Consultations
165 Téléchargements

Partager

Gmail Facebook X LinkedIn More