98 search results - page 14 / 20 » Segment-Based Stereo Matching Using Graph Cuts |
117
Voted
ESA
1994
Springer
15 years 3 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
269
click to vote
PAMI
2010
14 years 10 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
120
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
103
Voted
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
CVGIP
2008
14 years 11 months ago
2008
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...