Sciweavers

5595 search results - page 352 / 1119
» Comparing Subsumption Optimizations
Sort
View
EMMCVPR
2011
Springer
14 years 6 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
ICIP
1997
IEEE
16 years 8 months ago
Prediction Based on Boolean Filters for Multiresolution Lossless Image Compression
In this paper Boolean filters and a variation of these, FIR-Boolean hybrid filters are proposed for realizing the prediction stages of a multiresolution lossless image compression...
Doina Petrescu, Moncef Gabbouj
EMO
2005
Springer
175views Optimization» more  EMO 2005»
16 years 8 days ago
A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
R. Lyndon While
EVOW
2005
Springer
16 years 8 days ago
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
Olfa Sammoud, Christine Solnon, Khaled Ghéd...
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
16 years 4 days ago
Robotic Control Using Hierarchical Genetic Programming
In this paper, we compare the performance of hierarchical GP methods (Automatically Defined Functions, Module Acquisition, Adaptive Representation through Learning) with the canon...
Marcin L. Pilat, Franz Oppacher