Table - PMC

Skip to main content

View full-text article in PMC

. 2017 Jan 22;17(1):207. doi: 10.3390/s17010207

Algorithm 1 Split Bregman for color-flattening.

1:
procedure COLORFLATTEN(ϵ, $λ_{p}$ )
2:
Initial: $z^{0} = z^{i n}$ ; $d_{0}, b_{0} = 0$ ;
3:
while $| | z^{k} - z^{k - 1} {| |}_{2}^{2} > ϵ$ do
4:
$A = β I_{3 n \times 3 n} + λ_{p} L^{T} L$
5:
$v = β z^{i n} + λ_{p} L^{T} (d_{k} - b_{k})$
6:
Update $z^{k + 1}$ by solving $A z^{k + 1} = v$
7:
$d_{k + 1} =$ Shrink( $L z^{k + 1} + b_{k}, \frac{1}{λ_{p}}$ )
8:
$b_{k + 1} = b_{k} + L z^{k + 1} - d_{k + 1}$
9:
$k = k + 1$
10:
end while
11:
return $z^{k}$
12:
end procedure
13:
procedure SHRINK( $y, γ$ )
14:
return $\frac{y}{| | y | |} \times max (| | y | | - γ, 0)$
15:
end procedure