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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...