1. Petter Strandmark Fredrik Kahl Lund University

2. Image denoising Stereo estimation Segmentation Shape fitting from point clouds

3. S T 2 1 1 3 1 1 3 1 2 1 3 2 1 1 2 1 5 2 1 1 4 2 3 1 1 22 1 1 Minimum cut: 4 1 1

4.  Delong and Boykov, CVPR 2008  Implementation of push-relabel  Excellent speed-up for 2-8 processors  Method of choice for dense 3D graphs  CUDA-cuts: Vineet and Narayanan, CVGPU CVPR 2008  Push-relabel on GPU  Not clear what range of regularization can be used  L1-norm: Bhusnurmath and Taylor, PAMI 2008  Solves continuous problem on GPU  Not faster than augmenting paths on single processor

5.  Liu and Sun, CVPR 2010  ” Parallel Graph-cuts by Adaptive Bottom-up Merging”  Splits large graph into several pieces  Augmenting paths found separately  Pieces merged together and search trees reused  Our approach  Graph split into several pieces  Solutions constrained to be equal with dual variables  Shared memory not required See Komodakis et al. in ICCV 2007 for dual decomposition

6. Two separate problems! Dualize the constraint!

7. = = = ≠ 3 1 1 3 1 1 4 23 1 2 1 1 3 4 2 3 1 2 1 3 2 1 1 2 1 2 1 1 1 2 3 1 3 S T ½ ½

8.  Zero duality gap  Dual function has a maximum such that the constraints are met  Global solution guaranteed! Original Min-cut Problem Decomposed Min-cut Problem  ? Linear Program  Dual Linear Program Decomposed Linear Program 

9. Theorem: If the graph weights are even integers, there exists an integer vector maximizing the dual function. This means that the dual problem can be solved without floating point arithmetic.

10.  Begin with a graph  Split into two parts  Constrained to be equal on the overlap - 1 2 3 = Independent problems!

13. Berkeley segmentation database 301 images 2 processors 4 processors

14. Iteration12345...1011 Differences108105303316...90 Time (ms)2451.51.20.10.08...0.070.47 1152 × 1536

15. Easy problem: 230 ms Hard problem: 4 s

16. ST This choice of split severes all possible s/t paths Parallel approach still 30% faster

18.  LUNARC cluster  401 × 396 × 312 7 seconds 4 computers  95 × 98 × 30 × 1980-connectivity 12.3 GB4 computers  512 × 512 × 23176-connectivity 131 GB36 computers Not much data need to be exchanged, 54kB in the first example 4D MRI data 3D CT data

19.  Dual decomposition allows:  Faster processing  Solving larger graphs  Open source  C++/Matlab  Python