Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...