Motivated by applications to image denoising, we propose an approximation of functionals of the form
with increasing and bounded. The approximating functionals are of Ambrosio–Tortorelli type and depend on the Hessian or on the Laplacian of the edge variable v which thus belongs to . When the space dimension is equal to two and three v is then continuous and this improved regularity leads to a sequence of approximating functionals which are ready to be used for numerical simulations.
The variational approach to image processing requires the minimization, over a suitable space of discontinuous functions, of a functional characterized by a regularizing term and a fidelity term. In the framework of image denoising, one of the most successful models is the total-variation based model of Rudin, Osher and Fatemi [20]. According to it, if is a given input image then its reconstruction u is obtained as a solution of the following problem:
where denotes the distributional derivative of and is given by . From the point of view of the numerical implementation, in this case dealing with “discontinuous” functions does not represent an issue. In fact the minimization problem (1.1) can be solved numerically with primal dual methods (see, e.g., [9,10,17]) using the characterization of as
The model (1.1) performs well for removing noise and preserving edges. However it always causes a loss of contrast in the reconstructed image, and this can be attributed to the fact that the jump-penalization increases linearly with the amplitude of the jump , resulting in a strong penalization of large jump-amplitude. Therefore it would be desirable to consider an energy functional which penalizes the jump-amplitude and whose dependence on is increasing for small amplitudes, and bounded for large ones. With this idea in mind, we are then interested in replacing in (1.1) the total variation with the functional
for some , increasing and bounded function such that (see Fig. 1).
It is well known that functionals as (1.2) are difficult to be treated numerically. Then a very important task is to approximate them, in the sense of Γ-convergence, with volume-functionals defined on spaces of more regular functions. In the spirit of Ambrosio and Tortorelli’s approximation of the Mumford–Shah functional [5], Alicandro, Braides and Shah proposed in [2] an approximation of (1.2) by means of the sequence
with and .
The function g.
Motivated by the good computational results obtained in [8], where a second-order approximation of the Mumford–Shah functional has been proposed and analyzed, in (1.3) we replace the first-order term with a second-order term depending either on the Hessian or on the Laplacian of v. Precisely, for and , we consider the functionals
and, under the additional condition , the functionals
In Theorems 3.1 and 3.2 we prove that both and Γ-converge, with respect to the strong topology of , as , to the functional F defined in (1.2), with given by
where represents the minimal cost in terms of the unscaled, one-dimensional Modica–Mortola contribution in (1.4) and (1.5) for a transition between r and 1.
Let us briefly comment the heuristic idea behind these Γ-convergence results. Let be a minimizing sequence either for or for . Then, far from , approaches 1 driven by the factor which multiplies the potential term . Around , instead, both the first and second terms in (1.4) are diverging; to keep them bounded makes transitions from r to 1, the value r chosen so that the sum of the energy contributions given by and the Modica–Mortola term in (1.4) is minimal, i.e., minimizing (1.6).
On account of the Γ-convergence results Theorems 3.1 and 3.2, in Section 5 we prove that, when perturbed by a term for some , the functionals and are equicoercive (see Theorems 5.1 and 5.2). As a result, we derive the convergence of the associated minimization problems to
However the functionals , as well as the functionals , are not suited to numerical applications. In fact, due to the lack of compactness properties of the space , the direct methods of the calculus of variations cannot be applied to obtain the existence of minimizers for and at fixed .
A relaxation argument allows nevertheless to obtain existence of minimizers in the larger space . For , which is the interesting case for applications, if we denote by and the relaxations of and with respect to the strong topology of , we find that, thanks to the presence of the second-order perturbation in v, the expressions of and are particularly easy. Specifically, in Section 5, we prove that if and then
the proof strongly relying on the fact that is compactly embedded in .
Then, the functionals and still Γ-converge to F, and, if perturbed by a term for some , they are equicoercive. If for we consider the minimization problems
and
the term makes the functionals in (1.8) and (1.9) coercive for fixed . Then, the existence of a minimizing pair easily follows appealing to the direct methods of the calculus of variations. Moreover if is chosen so that then it can be easily shown that
Hence if is a minimizing sequence for (1.8) or (1.9), then in , converges to a solution of (1.7) in for all , and
We notice that the strong convergence of to in for all is consequence of the strong convergence of to in together with the fact that one can always assume .
The relaxed functionals and are now ready to be used for numerical simulations. In order to solve (1.8) or (1.9) one can follow the common strategy of iterative alternating minimization (see, e.g., [18]). Hence, given an iterate , one computes
We notice that now, thanks to the continuity of , (1.10) is a standard weighted total-variation minimization problem and can be solved in a straightforward way with primal dual methods (see, e.g., [9,10,17]).
The paper is organized as follows: after recalling some useful notation and preliminaries in Sect. 2, we state and prove the main results, Theorems 3.1 and 3.2, in Sect. 3 and Sect. 4. In Sect. 5 we first establish an equicoercivity result for the functionals under examination and then we provide an integral representation for their relaxations, in the case when .
Notation and preliminaries
In this section we set a few notation and recall some preliminary results we employ in the sequel.
Throughout the paper the parameter ε varies in a strictly decreasing sequence of positive real numbers converging to zero.
Let ; if not otherwise specified, denotes an open bounded set with Lipschitz boundary. We denote by and the families of all open and Borel subsets of Ω, respectively. The Lebesgue measure and the k-dimensional Hausdorff measure on are denoted by and , respectively. If , we denote by its components in the canonical basis of . The scalar product of is denoted by and the Euclidean norm by , whereas denotes the product between two suitable matrices A, B. If and , then denotes the open ball centered at with radius ϱ; if coincides with the origin we omit the dependence on and we simply write . Moreover we denote by the boundary of in .
Let be the set of all bounded Radon measures on Ω; if , we say that weakly∗ in as if
Let and , we use standard notation for the Lebesgue and Sobolev spaces and .
Functions of bounded variation
For the general theory of functions of bounded variation we refer the reader to [4]; here we only collect some useful notation and facts.
For every , denotes the approximate gradient of u, the Cantor part of the distributional derivative of u, the approximate discontinuity set of u, the generalized normal to , which is defined up to the sign, and and are the traces of u on .
We state a compactness result in (see [4, Theorem 3.23 and Proposition 3.21]).
Letbe an open bounded set with Lipschitz boundary and letbe a bounded sequence in. Then there exist a subsequence of(not relabeled) and a functionsuch thatin, i.e.,inandin Ω in.
We say that a function is a special function of bounded variation, and we write , if .
We also consider the larger space of the generalized functions of bounded variation on Ω, , which is made of all the functions whose truncations belong to for every .
By the very definitions we have and .
The space GBV inherits some of the main properties of the space BV (see [4, Theorem 4.34]).
Let. Then
u is approximately differentiable-a.e. in Ω and-a.e. in;
is countably-rectifiable and, wheredenotes the set of the approximate jump points of u.
The Cantor part of the distributional derivative of is defined as
where the supremum is understood in the sense of measure (see [4, Definition 1.68]).
Notice that if then
Slicing
We recall here some properties of one-dimensional restrictions of BV functions. We first fix some notation. For each we consider the hyperplane through the origin and orthogonal to ξ, i.e.,
and, for every and , we consider the one-dimensional set
Moreover, for any given function we define by .
Let. Then for allthe functionbelongs tofor-a.e.. For those y such thatwe haveaccording to the casesor(the casebeing negligible). Moreover, we havefor all, and for all functions
Let. Ifandfor alland for-a.e., then.
The previous theorem will be a key tool to get the lower bound inequality in the proof of Theorem 3.1.
A density result
We denote by the space of all functions such that:
;
is the intersection of Ω with the union of a finite number of pairwise disjoint -dimensional simplexes;
for every .
The following theorem due to Cortesani and Toader (see [11, Theorem 3.1]) provides a density result of in , where by we denote
and it will be used to get the upper bound inequality in both Theorems 3.1 and 3.2.
Let. Then there exists a sequencesuch thatin,in,andfor every upper semicontinuous functionsuch thatfor everyand.
A relaxation result
We state here a relaxation result, due to Fonseca and Leoni (see [15, Theorem 1.8]), which will be crucial to obtain the lower bound inequality in Theorem 3.2.
Let and let be a Borel function. For any we define the recession function of f as
Letand letbe a Borel function. Assume that
for allis convex in;
for alleitherfor all, or for everythere exist,,such thatfor allwithand for all.
Consider the functionaldefined byThen forwe get
Interpolation inequalities and elliptic regularity estimate
As we will heavily use them in what follows, we recall here two interpolation inequalities (see, e.g., [1, Theorems 4.14 and 4.15] and [19, Theorem 3.1.2.1 and Remark 3.1.2.2]).
Let U be an open bounded subset ofand let.
If U has Lipschitz boundary, then there exists a constantsuch thatfor everyand for every.
If U has-boundary, then there exists a constantsuch thatfor everyand for everywith.
Moreover, we also recall a local a priori estimate for the Laplace operator (see [13, Theorem 1, Section 6.3.1]) that we will use in Section 4.
Let U be an open bounded subset of. Then for each open subsetthere exists a constantsuch thatfor all.
Statement of the main result
We consider the functionals and defined as
and
Hereinafter the Γ-convergence of and is understood with respect to the strong topology of .
The first main result of this paper is a Γ-convergence result for the functionals .
The sequencedefined as in (
3.1
) Γ-converges to the functional F defined aswhere g is given by
An analogous result can be recovered on for the functionals , as stated in the following theorem.
For every,withand F defined as in (
3.2
) and (
3.3
), respectively.
We may also consider the functionals defined as
Then, if Ω has -boundary, Theorem 3.2 immediately yields the following theorem.
For every,
In fact it is sufficient to notice that, thanks to the boundary conditions on v and the increased regularity of Ω, we can now invoke Proposition 2.6(ii) to get
which, thanks to [2, Theorem 4.1], guarantees that the domain of the Γ-limit is contained in .
Let . Consider the minimization problem
The constant represents the minimal cost, in terms of the unscaled, one-dimensional Modica–Mortola contribution in (3.1) and (3.2), for a transition from the value r to the value 1 on the positive real half-line. A direct computation gives (see [8, Section 3])
It can be easily checked that the function g defined as in (3.4) satisfies the following properties:
g is increasing, and ;
g is subadditive;
for all and ;
g is Lipschitz continuous on with Lipschitz constant 1;
for any there exists a constant such that for all .
The functional with F defined as in (3.3) is continuous with respect to truncation in . In fact let and for let be the truncation of u at level m. Then by the properties of GBV functions (see Section 2.1) we immediately have
Moreover, by virtue of (i) and (iv) in Remark 3.5, the Monotone Convergence Theorem together with (2.1)–(2.2) yields
Γ-convergence
In this section we study the asymptotic behavior of the functionals and . In particular Theorems 3.1 and 3.2 will follow from Propositions 4.1–4.5.
We start proving the lower bound inequality in the one-dimensional case, where and clearly coincide. The proof follows the line of that of [2, Proposition 4.3]; the main difference is that, due to the presence of the second derivative of v in the approximating functionals, we are not allowed to assume that .
Letand letand F be defined as in (
3.1
) and (
3.3
), respectively. Thenfor all.
For simplicity we suppose that there exist , such that , the general case follows by repeating the same argument in each connected component of Ω.
Let and be such that , in . We want to show that
Clearly it is enough to consider the case ; we suppose moreover
We begin noticing that immediately gives a.e. in . Moreover the interpolation inequality Proposition 2.6(i) yields as ; hence, up to subsequences (not relabeled),
Again appealing to Proposition 2.6(i) we deduce the existence of a positive constant such that for sufficiently small there holds
Therefore for sufficiently small
hence, fixed , we can apply [7, Lemma 6.2 and Remark 6.3], with and , to conclude that there exists a finite set such that, for every fixed and for sufficiently small, on . Let ; then
In particular is equibounded. Hence and
Moreover, by the arbitrariness of η, we have and, since is finite, .
Let , . We claim that
for every .
Suppose for a moment that (4.5) holds true. Then (4.3)–(4.5) immediately give
Finally we first let in (4.6) to get
and then , obtaining the required inequality, since (see Remark 3.5).
We prove now (4.5) for . Upon passing to subsequences (not relabeled), we may assume
By the very definition of essential infimum and essential supremum and by (4.1)–(4.2), we have that for any there exist such that
Let be such that . We have now to distinguish three cases.
Case 1: . In this case the regularity of yields . Moreover we have
We estimate from below the term
where and .
To this end we introduce the auxiliary function given by
testing G with a third-degree polynomial satisfying the boundary conditions, one can easily show that
Let be an admissible function for , i.e., , , , . By construction
hence by (4.9) we infer
Let be the sequence defined as
By definition of it follows that . Since is a test function for (where is as in (3.6) with ), we have
A similar argument applies to the term
in (4.8).
We have
where the last equality follows from the definition (3.4) of g. By letting , we get
Thus, by the arbitrariness of δ, we obtain (4.5).
Case 2: there exists a subsequence of ε (not relabeled) such that . In this case, we have
where the last equality holds for ε sufficiently small by virtue of (4.7). Letting , by Remark 3.5(iii) and again (4.7), we get
thus, by the arbitrariness of δ, (4.5).
Case 3: there exists a subsequence of ε (not relabeled) such that . In this case we apply the same argument as for Case 2. □
We use now Proposition 4.1 to recover the lower bound for in dimension , by means of the slicing method (see Section 2.2). As a preliminary step we localize the functionals by introducing an explicit dependence on the set of integration: for any , we set
Letand letand F be defined as in (
3.1
) and (
3.3
), respectively. Thenfor all.
In what follows we use the notation introduced in Section 2.2.
Let and . We begin noticing that for any and , Fubini’s Theorem yields
where is the one-dimensional functional defined by
for any and open and bounded.
Let and be such that , in and
Then a.e. in Ω. Moreover, by Fubini’s Theorem and Fatou’s Lemma, and in for -a.e. . Therefore, appealing to Proposition 4.1 and taking into account (4.10), we have that for -a.e. and
where in the second inequality we have used Fatou’s Lemma.
Let and consider the truncated functions . Since g is increasing, it is clear that we decrease the last term in (4.12) if we replace u with . Moreover, since , with , by Remark 3.5(v), we have
for a suitable positive constant depending only on m. Then, by (4.11) and (4.12) we have
Thus, applying Theorem 2.3, we get that and
where we have taken into account the arbitrariness of and .
Consider the superadditive increasing function μ on defined by
and the Radon measure
Fixed a sequence , dense in , we have, by (4.13)
for all , where
Hence applying [7, Lemma 15.2] we get
thus, taking ,
Finally by the arbitrariness of , we conclude and the thesis follows letting in (4.14). □
A different approach is needed instead to prove the lower bound inequality for in dimension . The slicing technique is in fact not anymore applicable, because of the symmetry breaking due to the presence of the Laplacian. We use then the blow-up method of Fonseca–Müller [16]. To this end it is convenient to localize the functionals by defining for any
Letand letand F be defined as in (
3.2
) and (
3.3
), respectively. Thenfor all.
First let . Let moreover be such that in , in and
For each consider the measures
By hypothesis is equibounded therefore, up to subsequences (not relabeled), where μ is a non-negative finite Radon measure on Ω. Using the Radon–Nikodým Theorem we decompose μ into the sum of four mutually orthogonal measures
and we claim that
Suppose for a moment that (4.15)–(4.17) hold true, then to conclude it is enough to consider an increasing sequence of smooth cut-off functions , such that and on Ω, and to note that for every
Hence, letting the thesis follows from the Monotone Convergence Theorem.
We have now to check (4.15)–(4.17). The proof of (4.17) follows exactly the proof of (5.3) in [8, Proposition 5.1], the only difference residing in the fact that here we appeal to the one-dimensional result Proposition 4.1.
We prove now (4.15) and (4.16). To this end we define the function by
we notice that Φ is strictly increasing, and .
Let . Fix such that ; appealing to Propositions 2.7 and 2.6 we deduce that there exists a positive constant such that for sufficiently small there holds
where . Moreover for every Young’s inequality yields
with Φ as in (4.18). Hence we have
with defined by
It is easy to check that f satisfies all the hypotheses of Theorem 2.5 with , then we deduce that
where we have used the fact that in , as in . Since u belongs to , letting gives
From this, by using the Besicovitch derivation Theorem, we immediately get (4.15) and (4.16), and this completes the proof for .
If now the thesis follows by a standard truncation argument. In fact the truncations of u belong to for all . Appealing to the continuity under truncation of in (see Remark 3.6) and noticing that (and hence ) decreases by truncation, we immediately get
□
We prove now the upper bound inequality for and . To do this, we will use the density and relaxation results introduced in Section 2.3 and Section 2.4.
Letand letand F be defined as in (
3.1
) and (
3.3
), respectively. Thenfor all.
To check the upper bound inequality, it suffices to deal with and a.e. in Ω.
We divide the proof into three main steps.
Step 1: . We prove that
for all .
By Theorem 2.4 it is enough to prove (4.19) when u belongs to . Indeed assume (4.19) holds true in . If then there exists a sequence such that in and
hence the lower semicontinuity of yields
We now prove (4.19) for a function ; we suppose , with K a -dimensional simplex (the case , with pairwise disjoint -dimensional simplexes, following as a natural generalization). Upon making a rototranslation, we may assume K to be contained in the plane .
For , we set
and appealing to the regularity hypotheses on u we have that for any there exists a triangulation of such that
for every . We consider moreover the piecewise constant function defined by
Then Remark 3.5 together with the fact that gives
Let realize the minimum in (3.4) for , i.e., and
Fix . Then for by virtue of (3.6) we deduce that there exist and such that , , for all and
If now , we have
for every and .
We now construct the sequences and that we expect to be the recovery sequences for .
Let be such that as ; set and
Let be a cut-off function between K and , i.e., , , on K with for some , and let be the sequence defined by
where
For we set
For , and , set
and let be a cut-off function between and , i.e., , , on with
for some .
We define the sequence
where
We have that , ; moreover and in .
We now prove that and satisfy the upper bound inequality.
As and , we have
where we have used that , , as ε decreases to 0 for all .
Moreover, by virtue of (4.23)–(4.25) and since as , we have also
Passing to the limit as , by (4.26) and (4.27), we get
where we have also used that together with (4.21)–(4.22). We finally let η and δ go to 0 to obtain the required inequality. This concludes the case .
Step 2: . We now claim that the relaxation with respect to the strong -topology of the functional
satisfies
for all .
Suppose for a moment that (4.28) holds true. Then by virtue of (4.20) and (4.28) we have
for all , hence the limsup inequality in .
We now prove (4.28). To this end for and we consider the functionals
and their relaxations
A well-known relaxation result (see, e.g., [4, Theorem 5.47]) yields
Then by using (4.29), together with standard density results (see, e.g., [14, Theorem 3, Section 4.2]) and cut-off arguments, one can prove that
If now we define the localized functionals
since , we have ; hence for all and
Arguing as in [6, Proposition 3.3], one can prove that for every the set function is the restriction to of a regular Borel measure μ. Therefore
Then (4.32) yields
while (4.31) gives
Thus finally gathering (4.33) and (4.34) gives (4.28) and thus the limsup inequality for .
Step 3: . Finally to recover the general case , we use a truncation argument. Let and consider the truncated functions . Then
(see Remark 3.6). Since in we get the thesis by virtue of the lower semicontinuity of . □
Letand letand F be defined as in (
3.2
) and (
3.3
), respectively. Thenfor all.
The proof is obtained by taking the same recovery sequence as in Proposition 4.4. □
Convergence of minimization problems and relaxation
In this section we prove an equicoercivity result for suitable modifications of the functionals and . On account of this result, we also study the convergence of the associated minimization problems.
Let and set
with F defined as in (3.3); it is easy to check that the minimization problem in (5.1) admits a solution , and .
Consider the minimization problemwithdefined as in (
3.1
). Letbe a minimizing sequence for, i.e.,Then there exist a subsequence of(not relabeled) and a functionsuch thatandin. Moreoveris a solution of the minimization problem in (
5.1
), and.
Let be as in the statement. As a consequence of (5.2), we immediately have that , and in . We prove now that, up to passing to a subsequence (not relabeled), for some .
We begin noticing that, by means of a truncation argument, we may always assume
Let , then ; we define the sequence by
where Φ is defined as in (4.18).
Then, is bounded in . In fact, since Φ is increasing and , we infer
moreover, appealing to the interpolation inequality Proposition 2.6(i), we deduce the existence of a positive constant such that for sufficiently small we have
where we have also used Young’s inequality together with the fact that for all .
Hence Theorem 2.1 yields the existence of a subsequence of (not relabeled) and a function such that in . As in , we have then in .
We notice now that, by the uniqueness of the limit, (5.3) yields also in so that
where we have used Proposition 4.2.
On the other hand, if is a minimizer for , then by virtue of Proposition 4.4 there exists a sequence in such that
Gathering (5.5)–(5.6), we deduce that is a solution of the minimization problem (5.1) and . □
Letbe an open bounded set withboundary and consider the minimization problemwithdefined as in (
3.5
). Letbe a minimizing sequence for, i.e.,Then there exist a subsequence of(not relabeled) and a functionsuch thatandin. Moreoveris a solution of the minimization problem in (
5.1
), and.
The proof follows the line of that of Theorem 5.1, but here we appeal to Theorem 3.3. We only point out that, to get an analogous bound as in (5.4), we need to use in addition the interpolation inequality Proposition 2.6(ii). □
Let now be such that as and for consider the functionals
Thanks to the requirement that as , arguing as in Propositions 4.1, 4.2 and 4.4, one can easily show that for all
with F defined as in (3.3).
For fixed , let denote the relaxed functional of with respect to the strong topology of ; then, we also have
for all (see, e.g., [12, Proposition 6.11]).
The last part of this section is devoted to provide an integral representation formula for in the case , which is the interesting case in numerical applications. We show in particular that the presence of the second derivative of v makes the expression of particularly easy.
We introduce the following notation: for , we set
Let. Then, for all.
We begin noticing that for all ; moreover it is clear that .
We now show that is lower semicontinuous. To this end let , be such that and in ; we prove that
Clearly it is enough to consider the case , moreover up to subsequences we can always assume that the liminf is a limit. As a result, we have , for some independent of k and for every ; moreover, by the interpolation inequality Proposition 2.6(i) we also have . Then up to subsequences (not relabeled)
and, by virtue of the compact embedding of in when (see, e.g., [1, Theorem 6.2]), we also deduce
Then, appealing to the weak lower semicontinuity of the -norm and to (5.7), we get
where we have also used that, by (5.8),
Then it remains to prove that for all there exists a sequence such that and in , and
Fix and ; in particular, as , . By a standard approximation argument (see, e.g., [14, Theorem 2 and Theorem 3, Section 5.2]) there exists such that in , in and
Then appealing to [4, Proposition 1.80], we infer
Hence the pair is the desired sequence. □
We now consider the minimization problem
By using the direct methods of calculus of variations, one can show that the problem in (5.9) admits a solution in ; moreover we have
Finally the following theorem holds true.
Letbe a minimizing pair for. Then, there exist a subsequence of(not relabeled) and a functionsuch thatandin. Moreoveris a solution of the minimization problem in (
5.1
), and.
The proof follows the line of that of Theorem 5.1. □
Let be an open bounded set with boundary and let . For , set
Arguing as before one can prove that the relaxed functional of with respect to the strong topology of is given by
Moreover, an analogous result as in Theorem 5.4 can be recovered for as well.
Footnotes
Acknowledgement
The author wishes to thank Caterina Ida Zeppieri and Martin Burger for many helpful suggestions and discussions.
References
1.
R.A.Adams, Sobolev Spaces, Academic Press, New York, 1975.
2.
R.Alicandro, A.Braides and J.Shah, Free-discontinuity problems via functionals involving the -norm of the gradient and their approximation, Interfaces and Free Boundaries1 (1999), 17–37. doi:10.4171/IFB/2.
3.
L.Ambrosio, A compactness theorem for a new class of functions of bounded variation, Boll. Un. Mat. Ital.3B (1989), 857–881.
4.
L.Ambrosio, N.Fusco and D.Pallara, Functions of Bounded Variation and Free Discontinuity Problems, Oxford Mathematical Monographs, The Clarendon Press, Oxford University Press, New York, 2000.
5.
L.Ambrosio and V.M.Tortorelli, Approximation of functionals depending on jumps by elliptic functionals via Γ-convergence, Comm. Pure Appl. Math.43(8) (1990), 999–1036. doi:10.1002/cpa.3160430805.
6.
G.Bouchitté, A.Braides and G.Buttazzo, Relaxation result for some free-discontinuity problems, J. Reine Angew. Math.458 (1995), 1–18.
7.
A.Braides, Γ-convergence for Beginners, Oxford Lecture Series in Mathematics and Its Applications, Vol. 22, Oxford University Press, Oxford, 2002.
8.
M.Burger, T.Esposito and C.I.Zeppieri, Second-order edge-penalization in the Ambrosio–Tortorelli functional, SIAM J. Multiscale Model. Simul.13(4) (2015), 1354–1389. doi:10.1137/15M1020848.
9.
M.Burger and S.Osher, A guide to the TV zoo, in: Level Set and PDE Based Reconstruction Methods in Imaging, Lecture Notes in Math., Vol. 2090, Springer, Cham, 2013, pp. 1–70. doi:10.1007/978-3-319-01712-9_1.
10.
A.Chambolle and T.Pock, A first-order primal-dual algorithm for convex problems with applications to imaging, J. Math. Imaging Vision40(1) (2011), 120–145. doi:10.1007/s10851-010-0251-1.
11.
G.Cortesani and R.Toader, A density result in SBV with respect to non-isotropic energies, Nonlinear Analysis38 (1999), 585–604. doi:10.1016/S0362-546X(98)00132-1.
12.
G.Dal Maso, An Introduction to Γ-Convergence, Birkhäuser, Boston, 1993.
13.
L.C.Evans, Partial Differential Equations, Graduate Studies in Mathematics, Vol. 19, American Mathematical Society, Providence, RI, 1998.
14.
L.C.Evans and R.F.Gariepy, Measure Theory and Fine Properties of Functions, CRC Press, Boca Raton, 1992.
15.
I.Fonseca and G.Leoni, On lower semicontinuity and relaxation, Proc. Roy. Soc. Edin.131A (2001), 519–2001. doi:10.1017/S0308210500000998.
16.
I.Fonseca and S.Müller, Quasiconvex integrands and lower semicontinuity in , SIAM J. Math. Anal.23 (1992), 1081–1098. doi:10.1137/0523060.
17.
T.Goldstein and S.Osher, The split Bregman method for -regularized problems, SIAM J. Imaging Sci.2(2) (2009), 323–343. doi:10.1137/080725891.
18.
L.Grady and C.Alvino, The piecewise smooth Mumford–Shah functional on an arbitrary graph, IEEE Transactions on Image Processing18(11) (2009), 2547–2561. doi:10.1109/TIP.2009.2028258.
19.
P.Grisvard, Elliptic Problems in Nonsmooth Domains, Monographs and Studies in Mathematics, Vol. 24, Pitman, Massachusetts, 1985.
20.
L.I.Rudin, S.J.Osher and E.Fatemi, Nonlinear total variation based noise removal algorithms, Phys. D60 (1992), 259–268. doi:10.1016/0167-2789(92)90242-F.