Sciweavers

3251 search results - page 319 / 651
» On a vector q-d algorithm
Sort
View
ICPR
2008
IEEE
16 years 5 months ago
Prototype learning with margin-based conditional log-likelihood loss
The classification performance of nearest prototype classifiers largely relies on the prototype learning algorithms, such as the learning vector quantization (LVQ) and the minimum...
Cheng-Lin Liu, Xiaobo Jin, Xinwen Hou
ICRA
2009
IEEE
123views Robotics» more  ICRA 2009»
15 years 11 months ago
Realtime segmentation of range data using continuous nearest neighbors
— In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. This paper presents an algorithm for realti...
Klaas Klasing, Dirk Wollherr, Martin Buss
CAMP
2005
IEEE
15 years 10 months ago
Face Localization in Color Images with Complex Background
— In this paper we describe a two step algorithm which localizes faces in 2D color images depicting a single face on a complex background. Given a single image, the algorithm rou...
Paola Campadelli, Raffaella Lanzarotti, Giuseppe L...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 10 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
CVPR
2010
IEEE
15 years 9 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince