Combinatorial pyramids and discrete geometry for energy-minimizing segmentation

The main drawback of the top-down pyramidal model is that the global amount of required memory is bounded below by the size of the larger partition processed within the pyramid:

In this paper, we propose a novel approach for the definition of tiled top-down pyramids based on the combination of three hierarchical data structures: a pyramid of images encoding

Using the definition given in [9] for the simultaneous removal of cells in an n-map, we have defined here n-dimensional combinatorial pyramids the way Brun and Kropatsch did in

We finally define in the same way the simultaneous contraction operation in maps and provide a first result (Proposition 20) that justifies this definition using the

Moreover, as in the dual graph framework (Section 2.4), an inside relationship between two regions is encoded by two edges: one edge encodes the common border between the two

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

We then present in Section 3 the notions of connecting walks and connecting dart sequences that generalize the notion of reduction window and receptive fields.. Eventually, we

This criterion is proved to be equivalent to a corrected version of Grasset’s condition (Theorem 1). Grasset et al.’s criterion prevents this configuration from being considered as