74 search results - page 9 / 15 » On edge orienting methods for graph coloring |
SIAMDM
2008
13 years 7 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
3DIM
2005
IEEE
14 years 1 months ago
2005
IEEE
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
ACCV
2009
Springer
14 years 20 hour ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
ICIP
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
CRV
2006
IEEE
13 years 9 months ago
2006
IEEE
The retinex algorithm for lightness and color constancy is extended to include 3-dimensional spatial information reconstructed from a stereo image. A key aspect of traditional ret...