229 search results - page 44 / 46 » Iterated Graph Cuts for Image Segmentation |
EMMCVPR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
106
click to vote
CVPR
2004
IEEE
15 years 11 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...
113
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
PAMI
2007
14 years 9 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...