173 search results - page 1 / 35 » Every color chromakey |
ICPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper, we propose a region extraction method using chromakey with a two-tone checker pattern background. The proposed method solves the problem in conventional chromakey t...
COCOA
2010
Springer
13 years 3 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
DAM
2011
13 years 22 days ago
2011
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic ...
IJCM
2002
13 years 5 months ago
2002
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
CORR
2011
Springer
13 years 22 days ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...