Sciweavers

3091 search results - page 3 / 619
» The Color Between Two Others
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 11 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
IMAGING
2000
13 years 8 months ago
Conversion Between CMYK Spaces Preserving Black Separation
This paper describes a method for developing a transform between two device CMYK spaces in a way that preserves information about the black separation. An important application of...
Tomasz J. Cholewo
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ICCV
2007
IEEE
14 years 9 months ago
Probabilistic Color and Adaptive Multi-Feature Tracking with Dynamically Switched Priority Between Cues
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
François Le Clerc, Lionel Oisel, Patrick P&...
ICIP
2002
IEEE
14 years 9 months ago
A comparative analysis of two distance measures in color image databases
Euclidean distance measure has been used in comparing feature vectors of images, while cosine angle distance measure is used in document retrieval. In this paper, we theoretically...
Shamik Sural, Gang Qian, Sakti Pramanik