@InProceedings{CI-Pruvot-2007,


author = {Pruvot, Jean Hugues and Luc Brun},
title = {Hierarchy construction schemes Within the scale set framework},
booktitle = {Graph based Representation in Pattern Recognition'2007},
pages = {126-137},
year = 2007,
editor = {Francisco Escolano and Mario Vento},
number = 4538,
address = {Alicante},
month = {June},
organization = {IAPR TC15},
publisher = {LNCS},
abstract= "Segmentation algorithms based on an energy minimisation framework
often depend on a scale parameter which balances a fit to data and a
regularising term. Irregular pyramids are defined as a stack of
graphs successively reduced. Within this framework, the scale is
often defined implicitly as the height in the pyramid. However,
each level of an irregular pyramid can not usually be readily
associated to the global optimum of an energy or a global criterion
on the base level graph. This last drawback is addressed by the
scale set framework designed by Guigues. The methods designed by
this author allow to build a hierarchy and to design cuts within
this hierarchy which globally minimise an energy. This paper
studies the influence of the construction scheme of the initial
hierarchy on the resulting optimal cuts. We propose one sequential
and one parallel method with two variations within both. Our
sequential methods provide partitions near the global optima while
parallel methods require less execution times than the sequential
method of Guigues even on sequential machines.",
url="article(ps):=https://brunl01.users.greyc.fr/ARTICLES/gbr2007.ps, arXiV:=https://arxiv.org/abs/0712.1878, slides(pdf):=https://brunl01.users.greyc.fr/ARTICLES/slides_gbr2007.pdf, video:=http://videolectures.net/gbr07_pruvot_hcs/",
theme = {hierarchical},

 }