Sciweavers

501 search results - page 2 / 101
» Local and global colorability of graphs
Sort
View
ICMCS
2005
IEEE
110views Multimedia» more  ICMCS 2005»
13 years 11 months ago
Learned color constancy from local correspondences
The ability of humans for color constancy, i.e. the ability to correct for color deviation caused by a different illumination, is far beyond computer vision performances: nowadays...
Tijmen Moerland, Frédéric Jurie
ICPR
2002
IEEE
14 years 6 months ago
Bayesian Marker Extraction for Color Watershed in Segmenting Microscopic Images
In this paper we study the ability of the cooperation of Bayesian color pixel classification in extracting seeds for color watershed. Using color pixel classification alone does n...
Olivier Lezoray, Hubert Cardot
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 9 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
CVPR
2011
IEEE
13 years 1 months ago
Unsupervised Local Color Correction for Coarsely Registered Images
The current paper proposes a new parametric local color correction technique. Initially, several color transfer functions are computed from the output of the mean shift color se...
Miguel Oliveira, Angel D. Sappa, Vitor Santos
ENDM
2000
131views more  ENDM 2000»
13 years 5 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar