Computing visual correspondence with occlusions using graph cuts
Citations
11,283Â citations
Cites methods from "Computing visual correspondence wit..."
...For stereo matching, we run global [26, 37, 46], semiglobal [23], local [5, 20, 38] and seed-growing [27, 10, 9] methods....
[...]
..., guided cost-volume filtering [38], pixel-wise graph cuts [26]....
[...]
7,458Â citations
Cites methods from "Computing visual correspondence wit..."
...More recently, max-flow and graph-cut methods have been proposed to solve a special class of global optimization problems [59, 36, 18, 77, 44]....
[...]
7,413Â citations
Cites background from "Computing visual correspondence wit..."
...[ 28 ] presents a stereo algorithm based on expansion moves that addresses these problems....
[...]
4,463Â citations
Cites background or methods or result from "Computing visual correspondence wit..."
...The corresponding graph structures were previously described by [15, 18, 4, 8, 23, 24, 5] in detail....
[...]
...We selected several examples in image restoration, stereo, and segmentation where different forms of energy (1) are minimized via graph structures originally described in [15, 18, 4, 8, 23, 24, 6]....
[...]
...A growing number of publications in vision use graph-based energy minimization techniques for applications like image segmentation [18, 39, 21, 5], restoration [15], stereo [32, 4, 17, 23, 24, 9], shape reconstruction [36], object recognition [2], augmented reality [38], texture synthesis [26], and others....
[...]
...We consider three graph-based methods for solving this problem: pixel-labeling stereo with the Potts model [4, 8], stereo with occlusions [23], and multi-camera scene reconstruction [24]....
[...]
...[32, 18, 4, 17, 8, 2, 30, 39, 21, 36, 38, 6, 23, 24, 9, 26]) can be represented as...
[...]
4,146Â citations
References
18,761Â citations
"Computing visual correspondence wit..." refers methods in this paper
...For example, correlation based approaches and energy minimization methods based on regularization [15] or Markov Random Fields [11] are typically formulated as labeling problems, where each pixel in one image must be assigned a disparity....
[...]
8,496Â citations
7,458Â citations
7,413Â citations
4,463Â citations