173 search results - page 3 / 35 » Every color chromakey |
141
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Single sensor digital cameras capture one color value for every pixel location. The remaining two color channel values need to be estimated to obtain a complete color image. This ...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
The current paper proposes a new parametric local
color correction technique. Initially, several color transfer
functions are computed from the output of the mean shift
color se...
107
click to vote
CIAC
2010
Springer
15 years 29 days ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
89
Voted
DAM
2002
14 years 9 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
149
click to vote
SIGGRAPH
1996
ACM
15 years 1 months ago
1996
ACM
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...