@InProceedings{brun-03-2,


author = {Luc Brun and Walter Kropatsch},
title = {Construction of Combinatorial Pyramids},
booktitle = {Graph based Representations in Pattern Recognition},
pages = {1-12},
year = 2003,
editor = {Edwin Hancock and Mario Vento},
volume = 2726,
series = {LNCS},
address = {York, UK},
month = {June},
organization = {IAPR-TC15},
url = {article:=https://brunl01.users.greyc.fr/ARTICLES/gbr2003.pdf,slides:=https://brunl01.users.greyc.fr/ARTICLES/slides_gbr2003.pdf},
abstract = "Irregular pyramids are made of a stack of successively
reduced graphs embedded in the plane. Each vertex of a reduced graph
corresponds to a connected set of vertices in the level below. One
connected set of vertices reduced into a single vertex at the above
level is called the reduction window of this vertex. In the same
way, a connected set of vertices in the base level graph reduced to
a single vertex at a given level is called the receptive field of
this vertex. The graphs used in the pyramid may be region adjacency
graphs, dual graphs or combinatorial maps. This last type of
pyramids are called Combinatorial Pyramids. Compared to usual graph
data structures, combinatorial maps encode one graph and its dual
within a same formalism and offer an explicit encoding of the
orientation of edges around vertices. This paper describes the
construction scheme of a Combinatorial Pyramid. We also provide a
constructive definition of the notions of reduction windows and
receptive fields within the Combinatorial Pyramid framework.",
theme = {hierarchical}

 }