[Zurück]


Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):

S. de Sousa, Y. Haxhimusa, W. Kropatsch:
"Estimation of Distribution Algorithm for the Max-Cut Problem";
Vortrag: GbR 2013, 9th IAPR - TC-15 Workshop, Wien; 15.05.2013 - 17.05.2013; in: "Graph-based Representations in Pattern Recognition", Lecture Notes in Computer Science, Volume 7877, Springer-Verlag, 7877 (2013), ISBN: 9783642382208; S. 244 - 253.



Kurzfassung englisch:
Abstract.
In this paper, we investigate the
Max-Cut
problem and pro-
pose a probabilistic heuristic to address its classic and weighted version.
Our approach is based on the Estimation of Distribution Algorithm
(EDA) that creates a population of individuals capable of evolving at
each generation towards the global solution. We have applied the
Max-
Cut
problem for image segmentation and de ned the edges' weights as
a modi ed function of the L2 norm between the RGB values of nodes.
The main goal of this paper is to introduce a heuristic for
Max-Cut
and
additionally to investigate how it can be applied in the segmentation context.


"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-38221-5


Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.