
338 Variational Methods in Image Processing
Denoting by (Div)
n
an approximation of one of the expressions
div
u∇v−v∇u
u
2
+v
2
(for p = 2) and div
u∇v−v∇u
|u∇v−v∇u|
(for p = 1), evaluated at
(n△t, ih, jh), a nd solving the previous algebraic systems in u
n+1
and v
n+1
,
we obtain, for both p = 1 and p = 2 :
u
n+1
=
u
n
−
2v
n
+ u
n
△t(Div)
n
2
△t(Div)
n
2
1 +
△t(Div)
n
2
2
,
v
n+1
=
v
n
+
2u
n
− v
n
△t(Div)
n
2
△t(Div)
n
2
1 +
△t(Div)
n
2
2
.
To discretize the expressions div
u∇v−v∇u
u
2
+v
2
(for p = 2) and
div
u∇v−v∇u
|u∇v−v∇u|
(for p = 1), we use the finite difference scheme proposed
in [277] for div
∇u
|∇u|
which has also been used in [31] for a more general
case.
Remark 20 As in the continuous case, ...