Selective Segmentation for Global Optimization of Depth Estimation in Complex Scenes

Algorithm 2

Energy minimization process by graph cut.

Input: Labeling f, label sets L

Initialize finish → finish = 1

Repeat

 For (α ∈L)

  Using one α-expansion of 𝑓, find 𝑓^∗=argmin𝐸(𝑓^′) among 𝑓^′

  If (𝐸(𝑓^∗) < 𝐸(𝑓))

     f → f = 𝑓^∗

     finish → finish = 0

  end If

 end For

Until finish = 1

Return f