1749 search results - page 137 / 350 » Conditional colorings of graphs |
168
click to vote
EJC
2010
15 years 6 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
192
click to vote
MICCAI
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
145
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The non-negativity of color signals implies that they span a conical space with a hyperbolic geometry. We use perspective projections to separate intensity from chromaticity, and ...
167
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In the context of object recognition, it is useful to extract, from the images, efficient indexes that are insensitive to the illumination conditions, to the camera scale factor ...
161
click to vote
ICIP
2005
IEEE
16 years 5 days ago
2005
IEEE
The problem of adjusting the color such that the output image from a digital camera, viewed under a standard condition, matches the scene observed by the photographer’s eye is c...