27 search results - page 3 / 6 » Computing Visual Correspondence with Occlusions via Graph Cu... |
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
CVPR
1998
IEEE
14 years 10 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...