3091 search results - page 18 / 619 » The Color Between Two Others |
ESA
2004
Springer
15 years 4 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
107
click to vote
SIAMDM
2008
14 years 11 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
DM
2010
14 years 11 months ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
ECCV
1998
Springer
16 years 26 days ago
1998
Springer
Abstract. A simplified color image formation model is used to construct an algorithm for image reconstruction from CCD sensors samples. The proposed method involves two successive ...