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...
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...
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...
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 ...
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...