513 search results - page 23 / 103 » Soft Edge Coloring |
90
Voted
BMVC
1998
15 years 1 months ago
1998
Snakes provide high-level information in the form of continuity constraints and minimum energy constraints related to the contour shape and image features. These image features ar...
107
Voted
JGT
2006
15 years 13 days ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
105
Voted
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
111
Voted
CGF
2010
15 years 17 days ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
84
Voted
DAM
2006
15 years 14 days ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...