Hierarchical Image partitioning using Combinatorial Maps

Y.; Haxhimusa, W. Kropatsch, L. Brun A. Ion.

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 and effortlessly in a bottom-up way, based on local differences in a color space. The result is a hierarchy of partitions with multiple resolutions suitable for further goal driven analysis. The algorithm can handle large variation and gradient intensity in images. Dual graph pyramid representations lack the explicit encoding of edge orientation around vertices i.e they lack an explicit encoding of the orientation of planes, existing in combinatorial maps. Moreover with combinatorial maps, the dual must not be explicitly represented because one map is enough to fully characterize the partition.