513 search results - page 17 / 103 » Soft Edge Coloring |
GC
2007
Springer
15 years 12 days ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
96
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
A new color segmentation method is presented in this paper. The method is specified for color images that have both large and small objects, and objects with both step and ramp ed...
76
Voted
CPC
2008
15 years 16 days ago
2008
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
87
Voted
ICCV
1998
IEEE
16 years 2 months ago
1998
IEEE
Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India Bilateral filtering smooths images while preserving edges, by means of a nonlinear combinati...
121
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we propose a new segmentation algorithm which combines patch-based information with edge cues under a probabilistic framework. We use a mixture of multiple Gaussians...