Efficient encoding of n-D combinatorial pyramids

Sébastien Fourey (1) , Luc Brun (1)

1 Equipe Image - Laboratoire GREYC - UMR6072

Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of objects (either shapes or partitions). Combinatorial pyramids have first been defined in 2D, then extended using n-D generalized combinatorial maps. We motivate and present here an implicit and efficient way to encode pyramids of n-D combinatorial maps.

Domaines: Traitement des images [eess.IV]; Algorithme et structure de données [cs.DS]

Sébastien Fourey, Luc Brun. Efficient encoding of n-D combinatorial pyramids. International Conference on Pattern Recognition (ICPR 2010), Aug 2010, Istanbul, Turkey. pp.1036-1039, ⟨10.1109/ICPR.2010.259⟩. ⟨hal-00807887⟩