An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
Color-based trackers recently proposed in [3,4,5] have been proved robust and versatile for a modest computational cost. They are especially appealing for tracking tasks where the ...
Carine Hue, Jaco Vermaak, Michel Gangnet, Patrick ...
In this work, a new approach to fully automatic color
image segmentation, called JSEG, is presented. First, colors
in the image are quantized to several representing
classes tha...
Transmission of high quality video over the Internet faces many challanges including unpredictable packet loss characteristics of the current Internet and the heterogeneity of rec...
Antialiasing of ray traced images is typically performed by supersampling the image plane. While this type of filtering works well for many algorithms, it is much more efficient t...