765 search results - page 116 / 153 » Graph Coloring with Rejection |
125
click to vote
SCIA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...
122
click to vote
PR
2000
2000
A region-level motion-based graph representation and labeling for tracking a spatial image partition
15 years 2 months ago
This paper addresses two image sequence analysis issues under a common framework. These tasks are, "rst, motion-based segmentation and second, updating and tracking over time...
153
click to vote
BMVC
2010
14 years 10 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
108
click to vote
JCT
2008
15 years 2 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
131
Voted
DAM
2010
15 years 3 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...