173 search results - page 18 / 35 » Every color chromakey |
66
Voted
DM
2006
14 years 11 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
108
click to vote
MCAM
2007
Springer
15 years 5 months ago
2007
Springer
This paper proposes a scheme to detect and locate the players and the ball on the grass playfield in soccer videos. We put forward a shape analysisbased approach to identify the pl...
86
Voted
DICTA
2003
15 years 1 months ago
2003
In this paper a new method for color image segmentation is presented. The proposed algorithm divides the image into homogeneous regions by deriva...
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
105
click to vote
COMBINATORICS
2006
14 years 11 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...