Sciweavers

1397 search results - page 33 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
IJIG
2008
222views more  IJIG 2008»
13 years 8 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
14 years 4 days ago
Reference point based multi-objective optimization using evolutionary algorithms
: Evolutionary multi-objective optimization (EMO) methodologies have been amply applied to find a representative set of Pareto-optimal solutions in the past decade and beyond. Alth...
Kalyanmoy Deb, J. Sundar
COCOON
2009
Springer
14 years 3 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
ICPR
2008
IEEE
14 years 9 months ago
An adaptive-PCA algorithm for reflectance estimation from color images
This paper deals with the problem of spectral reflectance estimation from color camera outputs. Because the reconstruction of such functions is an inverse problem, stabilizing the...
Alamin Mansouri, Jon Yngve Hardeberg, Tadeusz Sliw...
EVOW
2010
Springer
14 years 1 months ago
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
Greg Durrett, Muriel Médard, Una-May O'Reil...