Sciweavers

315 search results - page 7 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
PPSN
2000
Springer
13 years 11 months ago
Competitive Segmentation: A Struggle for Image Space
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
Cor J. Veenman, Marcel J. T. Reinders, Eric Backer
JMIV
2008
106views more  JMIV 2008»
13 years 7 months ago
Estimation of Vector Fields in Unconstrained and Inequality Constrained Variational Problems for Segmentation and Registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimat...
Gozde B. Unal, Greg G. Slabaugh
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 1 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
13 years 11 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
13 years 11 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom