Talks and Poster Presentations (with Proceedings-Entry):
S. de Sousa, Y. Haxhimusa, W. Kropatsch:
"Estimation of Distribution Algorithm for the Max-Cut Problem";
Talk: GbR 2013, 9th IAPR - TC-15 Workshop,
Wien;
2013-05-15
- 2013-05-17; in: "Graph-based Representations in Pattern Recognition",
Lecture Notes in Computer Science, Volume 7877, Springer-Verlag,
7877
(2013),
ISBN: 9783642382208;
244
- 253.
English abstract:
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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-38221-5
Created from the Publication Database of the Vienna University of Technology.