2310 search results - page 177 / 462 » Coloring Random Graphs |
174
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper presents an algorithm for automatically detecting and segmenting a moving object from a monocular video. Detecting and segmenting a moving object from a video with limit...
119
click to vote
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper proposes to combine spatial and color coherency with the pixel-wise GMM to determine the background model. We first represent each pixel with a hybrid feature vector, w...
123
click to vote
CVPR
2007
IEEE
15 years 8 months ago
2007
IEEE
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...
109
click to vote
ICCVW
1999
Springer
15 years 6 months ago
1999
Springer
Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their...
111
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...