473 search results - page 41 / 95 » Volume scene graphs |
DAGM
2006
Springer
14 years 11 months ago
2006
Springer
This paper presents an optimization framework for the 3D reconstruction of the surfaces from stereo image pairs. The method is based on employing popular graph cut methods under th...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
SIBGRAPI
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
NIPS
1997
14 years 11 months ago
1997
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
RSA
2011
14 years 4 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...