
66 Variational Methods in Image Processing
We use any of the above equations for u
n+1
i,j
for all interior points (x
i
, y
j
)
such that 1 ≤ i, j ≤ M − 1.
Boundary conditio ns can be implemented in the following way: if u
n
i,j
has
been computed using one of the above numeric al schemes for 1 ≤ i, j ≤ M −1,
then we let
u
n
0,j
= u
n
1,j
, u
n
M,j
= u
n
M−1,j
, u
n
i,0
= u
n
i,1
, u
n
i,M
= u
n
i,M−1
,
and
u
n
0,0
= u
n
1,1
, u
n
0,M
= u
n
1,M−1
, u
n
M,0
= u
n
M−1,1
, u
n
M,M
= u
n
M−1,M−1
.
Remark 12 For the semi-implicit schemes, using u
0
i,j
= f
i,j
, we note t hat if
m
1
≤ f
i,j
≤ m
2
for any 0 ≤ i, j ≤ M , then we have m
1
≤ u
n
i,j
≤ m
2
for any
n ≥ 0 (thus such schemes are unconditionally stable).
3.1.6.2 Denoising and ...