98 search results - page 9 / 20 » Segment-Based Stereo Matching Using Graph Cuts |
125
click to vote
IJCV
2008
16 years 4 months ago
2008
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
105
Voted
EMMCVPR
2003
Springer
15 years 4 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
101
click to vote
PAMI
2007
14 years 11 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
We address the fundamental problem of matching in two static images. The remaining challenges are related to occlusion and lack of texture. Our approach addresses these difficultie...
107
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...