513 search results - page 81 / 103 » Soft Edge Coloring |
131
Voted
DM
1998
15 years 3 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
142
Voted
DM
1999
15 years 3 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
127
click to vote
PR
2010
15 years 2 months ago
2010
We propose a new algorithm for simultaneous localization and figure-ground segmentation where coupled region-edge shape priors are involved with two different but complementary ...
162
click to vote
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper proposes an algorithm for abandoned object detection based on generative model of low level features. First, suspected blobs are detected by foreground detection and pi...
137
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...