Random finite-difference discretizations of the Ambrosio-Tortorelli functional with optimal mesh size
Annika Bach, Marco Cicalese, Matthias Ruf

TL;DR
This paper investigates finite-difference discretizations of the Ambrosio-Tortorelli functional, demonstrating that using random lattices allows for $ ext{Gamma}$-convergence to the Mumford-Shah functional even when the mesh size is comparable to the approximation parameter.
Contribution
It extends the understanding of discretization schemes by proving $ ext{Gamma}$-convergence for random lattices at optimal mesh sizes, unlike traditional periodic lattice discretizations.
Findings
Random lattices enable $ ext{Gamma}$-convergence at $ ext{mesh size} \, ext{comparable to} \, ext{parameter}$
Periodic lattice discretizations require $ ext{mesh size} \, ext{much smaller than}$ \, $ ext{parameter}$ for convergence
Discretization on random lattices converges to an isotropic Mumford-Shah functional
Abstract
We propose and analyze a finite-difference discretization of the Ambrosio-Tortorelli functional. It is known that if the discretization is made with respect to an underlying periodic lattice of spacing , the discretized functionals -converge to the Mumford-Shah functional only if , being the elliptic approximation parameter of the Ambrosio-Tortorelli functional. Discretizing with respect to stationary, ergodic and isotropic random lattices we prove this -convergence result also for , a regime at which the discretization with respect to a periodic lattice converges instead to an anisotropic version of the Mumford-Shah functional.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Random finite-difference discretizations of the Ambrosio-Tortorelli functional with optimal mesh size
Annika Bach
Zentrum Mathematik, Technische Universität München, Boltzmannstraße 3, 85748 Garching bei München, Germany
,
Marco Cicalese
Zentrum Mathematik, Technische Universität München, Boltzmannstraße 3, 85748 Garching bei München, Germany
and
Matthias Ruf
EPFL SB MATH, Ecole polytechnique fédérale de Lausanne, Station 8, 1015 Lausanne, Switzerland
Abstract.
We propose and analyze a finite-difference discretization of the Ambrosio-Tortorelli functional. It is known that if the discretization is made with respect to an underlying periodic lattice of spacing , the discretized functionals -converge to the Mumford-Shah functional only if , being the elliptic approximation parameter of the Ambrosio-Tortorelli functional. Discretizing with respect to stationary, ergodic and isotropic random lattices we prove this -convergence result also for , a regime at which the discretization with respect to a periodic lattice converges instead to an anisotropic version of the Mumford-Shah functional. Moreover, we show that this scaling is optimal in the sense that it is the largest possible discretization scale for which the -limit is of Mumford-Shah type. Finally, we present some numerical results highlighting the isotropic behavior of our random discrete functionals.
Key words and phrases:
Ambrosio-Tortorelli functional, random discretization, -convergence, homogenization
2010 Mathematics Subject Classification:
49M25, 68U10, 49J55, 49J45
1. Introduction
The minimization of the Mumford-Shah functional has been introduced in the framework of image analysis as a simple and yet powerful variational method for image-segmentation problems (see, e.g., [9, 11, 31, 36]. In this field, a main task consists in detecting relevant object contours of (possibly distorted) digital images. Representing a gray-scale image on a domain as a function encoding at each point of the gray-level of the image, a “cartoon” version of is obtained by minimizing in the pair the functional
[TABLE]
In this setting is a piece-wise regular and relatively closed set with finite -dimensional Hausdorff measure , the function belongs to and and are nonnegative parameters. Loosely speaking, the minimization of the above functional results in a pair where is smooth and close to the input image outside a set whose -measure has to be as small as possible. In this sense may be interpreted as the set of contours of the “cartoon” image , or in other words the set of relevant object contours of . Besides being a simple model for image segmentation (in this case the relevant space dimension is ), the Mumford-Shah functional has applications also in higher dimensions. The case is particularly important for its mechanical interpretation, as the functional coincides with the Griffith’s fracture energy in the anti-plane case (see [16]).
A weaker formulation of the problem was proposed in [5] and led to the introduction of the space of special functions of bounded variation on which the Mumford-Shah functional is defined as
[TABLE]
In this new setting the functional depends only on the function , and the role of is now played by the set of discontinuity points of , so that a solution of the original problem can be obtained by proving regularity of the pair , where is a minimizer of and (see [26] for a recent review on this research direction). The Mumford-Shah functional belongs to the family of so-called free-discontinuity functionals, whose variational analysis has been initiated in [4] and it is the object of many papers in the last decades (see, e.g., the monograph [6] and the references therein).
It turns out that minimizing the Mumford-Shah functional numerically is a difficult task mainly due to the presence of the surface term . Hence, several kind of approximations have been proposed (cf., e.g., [7, 8, 19, 29, 34]). Among them, the most popular is perhaps the one introduced by Ambrosio and Tortorelli in [7, 8]. Given a small parameter and the elliptic approximation is given by
[TABLE]
It is well-known that as the family approximates the Mumford-Shah functional in the sense of -convergence (cf. [7, 8]). Since the functionals are equicoercive this implies that, up to subsequences, the first component of any global minimizer of converges to a global minimizer of . The second component is a sequence of edge variables that provides a diffuse approximation of . The functionals being elliptic, finite-elements or finite-difference schemes can be implemented. On the one hand, should be taken very small in order to be sure that the diffuse approximation of produces almost sharp edges. On the other hand, to guarantee that finite elements/differences still approximate the Mumford-Shah functional, former mathematical results assumed the mesh-size used in the discretization step to be infinitesimal with respect to (see [12, 15]). Moreover, in [10] Braides, Zeppieri and the first author have proven that such a condition is indeed necessary to obtain the isotropic surface term in the -limit when using a finite-difference discretization on a square lattice (see also [20] for a similar result concerning the Modica-Mortola functional). Dropping the fidelity term , which does not affect the -convergence analysis, we briefly describe their result. For such that , in [10] the authors considered functionals defined for as
[TABLE]
In [10, Theorem 2.1] it has been proven that the -limit of depends on according to the following scheme:
if then - is the Mumford-Shah functional (2),
- -
if and then - is an anisotropic free-discontinuity functional,
- -
if then - is finite only on where it coincides with .
The case has also been considered in the recent paper [24], where the authors prove a similar result in dimension and for finite-difference discretizations of Ambrosio-Totorelli-type approximations of the Griffith functional in the context of brittle fracture. The scheme above points out that this discretization works only for a very fine mesh-size , while it approximates only an anisotropic version of the functional for . However an approximation at a scale is preferable, since it has a lower computational cost with respect to one at a scale . One possible way to avoid the emergence of anisotropy in the limit, while keeping the computational cost low could be to take into account long-range interactions in the approximation of the gradient of the edge variable (similar to the approach in [23] in the case of the so-called weak-membrane energy) and not only neighboring differences as done in [10]. Here we take a different approach which draws some inspiration from the recent results in [35] and exploit the fact that statistically isotropic point sets have the flexibility to approximate interfaces without any directional bias also in the case that only short-range interactions are taken into account. More precisely, we use discretizations on random point sets to circumvent anisotropic limits. Namely, we replace periodic lattice in (4) by so-called stochastic lattices and then define a random family of discretizations of the Ambrosio-Tortorelli functional (3) with mesh-size for which we can prove -convergence to the isotropic Mumford-Shah functional almost surely (a.s.). We point out that this is a purely theoretical result which suggests a possible way to numerically approximate isotropic free-discontinuity functionals with discrete ones on random grids. In the last section of this paper we select two specific test images to point out some qualitative differences between a segmentation based on such an approximation and that based on a nearest-neighbors discretization of the Ambrosio-Tortorelli functionals on the square lattice. Since the number of nearest-neighbor interactions in the random lattice is in average larger than the one in the square lattice (see also Seciton 6), an in-depth comparison of the two approaches (deterministic and random) should also include possibly long-range deterministic discretizations. The natural question of the quantitative comparison of these different approaches is an interesting problem on its own and is out of the scope of this paper.
We highlight that, although the starting point of the present analysis, namely the discretization on a stochastic lattice, is the same as in [35], the proof of the convergence result is quite challenging and requires new ideas. In particular, as we will explain in details later, our result needs a fine characterization of the surface-energy density in (10), which turns out to be quite involved as it has to take into account the interaction of the two variables in the Ambrosio-Tortorelli approximation.
In what follows we give a more detailed description of the results contained in this paper. Given a probability space for each we consider a countable point set that satisfies suitable geometric constraints preventing the formation of clusters or arbitrarily large holes (cf. Definition 2.1). Then, given we introduce a random discretization of the functional in (3) as the family of functionals defined on maps by
[TABLE]
where and denote the bulk and surface terms of the discretization, respectively. They are defined as
[TABLE]
and
[TABLE]
In the above sums denotes a suitable set of short-range edges (for instance the Voronoi neighbors; see Definition 2.5 for general assumptions). Our main result (Theorem 3.5) reads as follows: Assuming the random graph to be stationary, ergodic and isotropic in distribution (for a precise definition see Section 2.2) there exist two positive constants such that with full probability the functionals -converge to the deterministic functional
[TABLE]
Some remarks are in order:
- (i)
A point process that satisfies all our assumptions is given by the random parking process [28, 33]. 2. (ii)
The coefficients and are not given in a closed form but can be estimated by solving two asymptotic minimization problems (see Section 3). Moreover, their ratio can be tuned via the parameter since is proportional to , while does depend only on the graph . 3. (iii)
Our approach requires to determine only the Voronoi neighbors, but not the volume of teh Voronoi cells or other related geometric quantities. One can also avoid the determination of the Voronoi neighbors using a -NN algorithm with a sufficiently large (see also the discussion in [35, Remark 2.7]). 4. (iv)
In the definition of the discrete approximation (5), (6), (7), we have taken the mesh-size equal to . Except for the value of the constant , the above result and the analysis of this paper remain unchanged if we consider a mesh-size that is only proportional to (see also Theorem 3.9). Interestingly, this is the largest possible discretization scale for which the -limit is of Mumford-Shah type (see Corollary 3.11 and the discussion below). 5. (v)
The addition of a fidelity term of the form
[TABLE]
to the discrete approximations can be analyzed exactly as in [35, Theorem 3.8] and leads to an additive term in the limit functional, provided the discrete approximation of converges in . Moreover, under this assumption the global minimizers of the modified discrete functionals converge in to the minimizers of the new limit functional
[TABLE]
In this paper we will neglect the fidelity term for the sake of notational simplicity.
We now explain briefly the strategy to prove the approximation result described above. It consists of two main steps, a first deterministic one and a second stochastic one. Applying the so-called localization method of -convergence together with [14, Theorem 1], in the first step we show that for a single realization the functionals -converge up to subsequences to a free-discontinuity functional of the form
[TABLE]
(see Theorem 3.2). Based on this integral representation, in the second step we establish a stochastic homogenization result (Theorem 3.4), which states that for a stationary and ergodic graph the whole sequence -converges a.s. to the functional
[TABLE]
In contrast to (10) the densities and in (11) do not depend on and are deterministic. Moreover, assuming that in addition the graph is isotropic, one can show that also and are isotropic, which finally allows us to write the -limit in the form (8).
We highlight that a crucial step in this procedure consists in proving that a separation of bulk and surface contributions takes place in the limit. More precisely, we show that the bulk density in (10) coincides with the density of the -limit of the quadratic functionals defined in (6), while the surface density is determined by solving a -dependent non-convex constrained optimization problem involving only the surface contribution (see Remark 3.3). Such a separation of energy contributions in the characterization of the surface density has already been a major issue in [10]. There the authors use a geometric construction to show that in dimension 2 the discrete bulk energy can be neglected in the formula of the surface integrand (cf. [10, Theorem 5.10]). This explicit construction is however not feasible for a stochastic lattice. Instead our approach is more abstract. It makes use of a weighted coarea formula (cf. Lemma 4.11) that works both in the case of stochastic and deterministic lattices and in any dimension. Hence the characterization of can be seen as one of the main novelties in this paper. Moreover, it is a key ingredient in the proof of the stochastic homogenization result. More in detail, it leads to the definition of a suitable subadditive stochastic process that can be analyzed as in [3, 18, 21] via ergodic theorems and finally to the almost sure existence of the -limit as in (11).
The above integral representation can be extended to the case where the discretization parameter is only proportional to . More in detail, we show that for with the volume integrand in (10) remains unchanged, while the surface integrand depends on the ratio and blows up linearly as (cf. Theorem 3.9). This indicates that as in the deterministic case considered in [10], the stochastic discretization of the Ambrosio-Tortorelli functionals on a scale cannot converge to a functional that is finite on . Indeed, this is shown in Corollary 3.11. In that sense the discretization of the Ambrosio-Tortorelli functionals defined in (5) can be interpreted as optimal since it approximates the Mumford-Shah functional at the largest possible discretization scale.
The paper is organized as follows. In Section 2 we introduce the notation used throughout the paper, before presenting the general results in Section 3. The latter section contains our main approximation result Theorem 3.5 together with the integral-representation result and the stochastic homogenization theorem mentioned above, which we consider to be of independent interest for the reader. In particular, we also present here the asymptotic minimization formula characterizing and we discover a natural relation between our discrete Ambrosio-Tortorelli functionals and weak-membrane energies. The proofs of the general results are carried out in Sections 4 and 5. Section 4 contains the proof of the integral-representation result and the asymptotic formulas for the integrands, while the stochastic homogenization result is proven in Section 5. Eventually, in Section 6 we briefly explain how to use our approximation result in practice, i.e., we describe the construction of a suitable stochastic lattice. We also include some numerical results based on an alternating minimization scheme highlighting the different behavior of the discrete functionals in (4) and (5) regarding (an)isotropy.
2. Setting of the problem and preliminaries
2.1. General notation
We first introduce some notation that will be used in this paper. Given a measurable set we denote by its -dimensional Lebesgue measure, and by its -dimensional Hausdorff measure. We denote by the characteristic function of . If is finite, denotes its cardinality. Given an open set , we denote by the family of all bounded, open subsets of and by the family of bounded, open subsets with Lipschitz boundary. Given and we set
[TABLE]
For we denote by the Euclidean norm. As usual denotes the open ball with radius centered at . We write when . Given , we let be an orthonormal basis of and we define the cube as
[TABLE]
where the brackets denote the scalar product. Given and , we set . We also denote by the hyperplane orthogonal to and passing through . If we simply write .
For we use standard notation for the Lebesgue spaces and for the Sobolev spaces. We denote by the space of special functions of bounded variation in (for the general theory see, e.g., [6]). If we denote by its approximate gradient, by the approximate discontinuity set of , by the generalized outer normal to , and and are the traces of on both sides of . Moreover, we consider the larger space , which consists of all functions such that for each the truncation of at level defined as belongs to . Furthermore, we set
[TABLE]
and
[TABLE]
It can be shown that .
For , and we define the function as
[TABLE]
Moreover, for we denote by the affine function defined as
[TABLE]
Finally, the letter stands for a generic positive constant that may change every time it appears.
2.2. Stochastic lattices
Throughout this paper we let be a probability space with a complete -algebra and probability measure . We call a random variable a stochastic lattice. A realization of the stochastic lattice will be denoted by and we also refer to it as a stochastic lattice. The following definition essentially forbids clustering of points as well as arbitrarily big empty regions in space.
Definition 2.1** (Admissible lattices).**
Let be a stochastic lattice. is called admissible if there exist such that the following two conditions hold a.s.:
- (i)
for all ;
- (ii)
for all .
Remark 2.2**.**
We also make use of the associated Voronoi tessellation , where the (random) Voronoi cells with nuclei are defined as
[TABLE]
If is admissible, then [3, Lemma 2.3] yields the inclusions .
Next we introduce some notions from ergodic theory that build the basis for stochastic homogenization.
Definition 2.3**.**
We say that a family of measurable functions , is an additive group action on if
[TABLE]
An additive group action is called measure preserving if
[TABLE]
Moreover, is called ergodic if, in addition, for all we have the implication
[TABLE]
Definition 2.4**.**
A stochastic lattice is said to be stationary if there exists an additive, measure preserving group action on such that for all
[TABLE]
If in addition is ergodic, then is called ergodic, too.
We call isotropic, if for every there exists a measure preserving function such that
[TABLE]
In order to define gradient-like structures, we equip a stochastic lattice with a set of directed edges.
Definition 2.5** (Admissible edges).**
Let be an admissible stochastic lattice and . We say that is a collection of admissible undirected111One can also consider directed edges as done in [35] but then the arguments get more intricate. edges if for all the set is -measurable and
- (i)
there exists such that a.s.
[TABLE]
- (ii)
the Voronoi neighbors are contained in , i.e.,
[TABLE]
If is stationary or isotropic, we say that the edges are stationary or isotropic if for all or for all .
For every we also set .
Enlarging if necessary, by Remark 2.2 we may assume without loss of generality that
[TABLE]
2.3. Discretized Ambrosio-Tortorelli functionals
In order to define the discrete approximation of the Ambrosio-Tortorelli functional (3) we scale a stochastic lattice by the same small parameter . Given a fixed bounded Lipschitz domain and two functions we define the localized discretization on an open set by
[TABLE]
where the bulk and surface terms are defined as
[TABLE]
and
[TABLE]
respectively. If we write simply for .
In order to recast our approximation problem in the framework of -convergence (we refer the reader to [17, 25] for a general overview of this topic), we will identify discrete functions with their piecewise constant interpolations on the Voronoi cells of the lattice, that is with functions of the class
[TABLE]
With a slight abuse of notation we extend the functional to by setting
[TABLE]
3. Presentation of the general results
In this section we present the main results of the paper.
3.1. Integral representation and separation of bulk and surface contributions
Our first main result is stated below in Theorem 3.2. It shows that for every admissible lattice the discrete functionals defined in (21) -converge (up to subsequences) in the strong -topology to a free-discontinuity functional. Moreover, bulk and surface contributions essentially decouple in the limit. More precisely, the volume integrand coincides with the density of the discrete quadratic functionals given by (19), while the surface integrand is determined by solving a -dependent constrained minimization problem which involves only the surface energy (cf. Remark 3.3). Note that these results are true pointwise for a fixed realization of the random graph as long as the realization satisfies the geometric conditions in Definitions 2.1 and 2.5. In order to give the precise statement of the theorem we first recall a convergence result for the functionals (here we implicitly consider as domain of this functional the set ) which is a direct consequence of [2, Theorem 3] and of the fact that the -limit of quadratic functionals is quadratic, too.
Theorem 3.1** ([2]).**
Let be an admissible stochastic lattice with admissible edges. For every sequence there exists a subsequence (possibly depending on the realization) such that for every the functionals -converge in the strong -topology to a functional that is finite only on , where it takes the form
[TABLE]
for some non-negative Carathéodory-function that is quadratic in the second variable for a.e. and satisfies the growth conditions
[TABLE]
We are now in a position to state our first main result.
Theorem 3.2**.**
Let be an admissible stochastic lattice with admissible edges. For every sequence there exists a subsequence (possibly depending on the realization) such that for every the functionals -converge in the strong -topology to a free-discontinuity functional of the form
[TABLE]
where is a measurable function and is given by Theorem 3.1.
Remark 3.3**.**
Both the integrands and provided by Theorem 3.2 can be characterized by asymptotic formulas. We write them after introducing some notation. For every , and every pointwise well-defined function we denote by the set
[TABLE]
of those -functions whose values agree with those of in a discretized -neighborhood of . Then for a.e. and every it holds that
[TABLE]
where is the affine function defined in (14) and is the maximal range of interactions in Definition 2.5. Moreover, for every , and we define the class of functions
[TABLE]
and we introduce the function
[TABLE]
We also consider the minimization problem
[TABLE]
For every we then have that the surface density of in Theorem 3.2 is given by
[TABLE]
Note that the boundary conditions for in the definition of (25) are posed on a much smaller layer than those for . This is only due to technical reasons in the proof of Lemma 4.11. Alternatively we could also require that , but this would overburden the notation.
3.2. Stochastic homogenization and convergence to the Mumford-Shah functional
Our second main result relies on the statistical properties of the lattice and the edges. More precisely, when and are stationary we can prove the following stochastic homogenization result, which shows in particular that in this case the -limit provided by Theorem 3.2 is independent of the converging subsequence and hence the whole sequence converges.
Theorem 3.4**.**
Let be an admissible stationary stochastic lattice with admissible stationary edges in the sense of Definitions 2.1 and 2.5. Then for -a.e. and for every , there exist the limits
[TABLE]
where is defined as in (25). Moreover, the functionals - converge in the strong -topology to the functional defined by
[TABLE]
If in addition is ergodic then and are independent of .
In order to make the densities and isotropic, we suggest to take as stochastic lattice the so-called random parking process. We refer the interested reader to the two papers [33, 28]. We recall that the random parking process defines a stochastic lattice that is admissible, stationary, ergodic, and isotropic in the sense of Definition 2.4. Moreover, the choice yields stationary and isotropic edges. We state our result for general stochastic lattices satisfying all these assumptions.
Theorem 3.5**.**
Assume that is an admissible stochastic lattice that is stationary, ergodic and isotropic with admissible stationary and isotropic edges. Then there exist constants such that -a.s. the functionals defined in (18) -converge with respect to the -topology to the functional with domain , on which
[TABLE]
Remark 3.6**.**
As explained in the introduction, a discrete version of the fidelity term as in (9) can be added to the functional obtaining discrete functionals of the form
[TABLE]
where is a given input datum and a suitable discretization of on . The fidelity term leads to an additional term in the -limit in (29), where is proportional to the constant in (30). For details we refer the reader to the analogous result proved in [35, Theorem 3.8] for weak membrane approximations.
3.3. Connection to weak-membrane energies
In this subsection we show how the discretizations of the Ambrosio-Tortorelli functional in (18), (19) and (20) are related to the weak-membrane energies. In fact, neglecting the second sum in (20), we can associate a weak-membrane model to the discrete Ambrosio-Tortorelli functional by optimizing for fixed (cf. Proposition 3.8). This connection, which we find interesting in itself, also allows us to take advantage of some of the estimates established in [35] which turns out to be useful in the proof of our main convergence result.
We first explain what we mean by (generalized) weak-membrane energy. Consider a bounded and monotone increasing function such that and . Then, given and we set
[TABLE]
In our present random setting these functionals are a special case of those considered in [35]. While our weak membrane energies depend on non-pairwise interactions, we remark that in the context of computer vision they were introduced and studied in [13, 27, 30] in a simpler form accounting only for pairwise interactions.
For our purpose it will be convenient to consider weak-membrane energies with a special choice of . Namely, for a given parameter we set and we notice that satisfies all assumptions listed above. We then define according to (31) with . The following convergence result for the sequence , which can be compared with Theorem 3.2, is a consequence of [35, Theorem 3.3 and Remark 3.4]. We recall it here for the reader’s convenience.
Theorem 3.7** ([35]).**
Let be an admissible stochastic lattice with admissible edges in the sense of Definitions 2.1 & 2.5. For every sequence there exists a subsequence (possibly depending on the realization) such that for every and every the functionals -converge in the strong -topology to a free discontinuity functional with domain , where it is given by
[TABLE]
where coincides with the integrand in Theorem 3.1 and the surface tension can be equivalently characterized by the two formulas
[TABLE]
with the energy defined on functions via
[TABLE]
In particular, we have and the following estimates
[TABLE]
In what follows, we show that the Ambrosio-Tortorelli approximation can be interpreted as a weak membrane energy , provided we neglect the term containing the discrete gradient of the edge variable . Indeed, the following proposition holds true:
Proposition 3.8**.**
Let be an admissible stochastic lattice with admissible edges and let be defined as in (31) with . Then for all and it holds that
[TABLE]
Proof.
Recalling the definition of the bulk term in (19), we can derive a pointwise optimality condition for the minimization problem, which reads (neglecting the constraint )
[TABLE]
Rearranging terms we find that for we have
[TABLE]
so that a posteriori and thus it is a minimizer of the constrained problem as well. Inserting this formula for yields the claim after some algebraic manipulations. ∎
3.4. Discretization with mesh-size proportional to and optimality of the lattice-scaling
In this section we present a version of Theorem 3.2 when the mesh-size is not equal to the elliptic-approximation parameter , but only proportional to it. More precisely, we let be a sequence of positive parameters, decreasing as decreases and such that and for every we set
[TABLE]
When for some we have the following integral-representation result for the functionals , similar to Theorem 3.2.
Theorem 3.9**.**
Let be an admissible stochastic lattice with admissible edges and for a given let be as in (32) with . For every sequence there exist a subsequence (possibly depending on the realization) and a functional of the form
[TABLE]
such that -converges in the strong -topology to . Moreover, the volume integrand is given by Theorem 3.1 and is a measurable function which satisfies for every and every the estimate
[TABLE]
Here is as in (17) and is the surface integrand of the -limit given by Theorem 3.7, which exists upon passing possibly to a further subsequence. In particular, we have
[TABLE]
Remark 3.10**.**
Although we don’t state it separately, note that the statements of Theorems 3.4 & 3.5 remain valid for the functionals with with minor modifications in the proof and with surface densities depending on as in the theorem above.
Theorem 3.9 shows that the surface density blows up linearly in when . Thus, one expects that (similar to the result in [10, Theorem 2.1(iii) and Theorem 3.1(ii)]) one cannot approximate the Mumford-Shah (or any other free-discontinuity) functional by discretizing the Ambrosio-Tortorelli functional via finite differences on an admissible lattice with . In fact, Corollary 3.11 states that in this regime the -component of any sequence with equibounded in and such that converges up to subsequences to some . Thus interfaces are ruled out in the limit.
Corollary 3.11** (Optimality of the lattice-space scaling).**
Let be admissible with admissible edges and consider a sequence with decreasing as decreases and such that . Let be as in (32) and let be such that and
[TABLE]
Then, up to subsequences, in for some .
Remark 3.12**.**
Under the assumptions of Corollary 3.11, (up to subsequences) the -limit agrees with the one given by Theorem 3.1. Indeed, an upper bound is given by setting , while the lower bound is obtained via comparison with weak membrane energies for any in the case of a limit function . We leave the details to the interested reader.
4. Separation of scales: proof of Theorem 3.2, Theorem 3.9 and Corollary 3.11
The main part of this section is devoted to the proof of the integral-representation result Theorem 3.2.
4.1. Integral representation in
As a first step towards the proof of Theorem 3.2, using the so-called localization method of -convergence together with the general result [14, Theorem 1] we prove the following preliminary result.
Proposition 4.1**.**
Let be an admissible stochastic lattice with admissible edges . Given any sequence there exists a subsequence (possibly depending on the realization) such that for all the functionals -converge in the strong -topology to a functional . If then can be written as
[TABLE]
where, for , , and , the integrands are given by
[TABLE]
with the functions and defined in (13) and (14), respectively, and the function defined for any and by
[TABLE]
In order to prove this result we will analyze the localized and of the functionals , which are defined as
[TABLE]
Remark 4.2**.**
Both functionals are -lower semicontinuous. Moreover, for any there exists indeed a sequence such that in .
Our aim is to apply the integral representation of [14, Theorem 1]. To this end, below we establish several properties of and . The next remark about truncations allows to reduce some of the arguments used in the forthcoming proofs to the case of bounded functions.
Remark 4.3**.**
Let . For any let denote the truncation of at level . Then it is immediate to see that for any . In particular, whenever we can compute and considering sequences such that for all . Moreover, also and decrease by truncation in . Thus, since in addition both functionals are -lower semicontinuous, for all we have
[TABLE]
Moreover, since is invariant under translation in , we deduce that also both and are invariant under translation in .
We next show that is local.
Lemma 4.4** (Locality).**
Let . If and a.e. on , then .
Proof.
Due to Remark 4.2 there exist sequences converging to and in , respectively, and such that
[TABLE]
Define by their values on as
[TABLE]
Using that and the equiintegrability of , and , one can show that and in . Then by definition
[TABLE]
Exchanging the roles of and we conclude. ∎
The next lemma provides a lower bound for . We also obtain equicoercivity under an additional equiintegrability assumption.
Lemma 4.5** (Compactness and lower bound).**
Assume that and are such that
[TABLE]
Then in . If is equiintegrable on , then there exists a subsequence (not relabeled) such that in for some . Moreover we have the estimate
[TABLE]
for some constant independent of and .
Proof.
Since , boundedness of the energy and Remark 2.2 imply that in . Moreover, due to Proposition 3.8 we have
[TABLE]
Hence the compactness statement and the lower bound on the are a direct consequence of the corresponding result for weak-membrane energies (cf. Theorem 3.7 or [35, Lemma 5.6]). ∎
As a next step we prove the corresponding upper bound for .
Lemma 4.6** (Upper bound).**
Let . There exists a constant independent of and such that for all with it holds that
[TABLE]
Proof.
We compare the functionals with weak-membrane energies in the sense of an appropriate upper bound. To this end, let and fix an edge . We assume without loss of generality that . Then
[TABLE]
so that . From (17) we then conclude that
[TABLE]
In particular, applying Proposition 3.8, for every we deduce the upper bound
[TABLE]
Hence the statement follows by comparison with the upper bound for weak-membrane energies (cf. Theorem 3.7 or [35, Lemma 5.7]). Note that any sequence of optimal ’s will convergence to since the energy remains bounded for any target function . ∎
The following technical lemma establishes an almost subadditivity of the set function .
Proposition 4.7** (Almost subadditivity).**
Let . Moreover let be such that . Then, for all ,
[TABLE]
Proof.
Let and be as in the statement. It suffices to consider the case where both and are finite. Moreover, Remark 4.3 allows us to restrict to the case . We choose sequences both converging to in and satisfying
[TABLE]
In view of Remark 4.3 we may further assume that . Hence, since also we actually have in .
For fixed we now construct a sequence converging to in such that
[TABLE]
for some constant depending only on and . Then the result follows by the arbitrariness of . We will obtain the required sequence by a classical averaging procedure, adapting the construction in [10, Proposition 5.2] to a stochastic lattice. To this end we first need to introduce some notation. We consider an auxiliary function defined as
[TABLE]
In particular, in . Moreover, we fix and for every we set
[TABLE]
and we also introduce the layer-like sets
[TABLE]
For every let be a smooth cut-off function between the sets and , i.e., on , on and .
For every we now define a pair by setting
[TABLE]
and
[TABLE]
Note that for fixed we have in by convexity. Moreover, we can estimate as
[TABLE]
Hence, in view of (35), estimate (36) follows if we can show that the last term on the right hand side of (4.1) can be bounded by for a suitable choice of . We start estimating the bulk term. First observe that for every pair it holds that
[TABLE]
In addition, for every the properties of the cut-off function imply that
[TABLE]
Thus, using the mean-value theorem for and the convexity inequality , from (4.1) we obtain
[TABLE]
for every pair with . Summing the above estimate over all such pairs we infer that
[TABLE]
Next we consider the surface term. Since the function is convex, we obtain from the definition of that
[TABLE]
For the finite differences, observe that we can equivalently write
[TABLE]
Then, by the analogue of formula (4.1), we can estimate
[TABLE]
where we used that the distance between the sets and is of order to reduce the number of possible interactions with respect to the case-by-case definition of . Inserting the elementary inequality
[TABLE]
the above estimate can be continued to
[TABLE]
Combining (40) and (41) and summing over all pairs gives
[TABLE]
Combining the above inequality with (39) then yields
[TABLE]
We eventually notice that for every we have whenever and is small enough. Moreover, for we have and . Thus, summing (4.1) over and averaging, we find satisfying
[TABLE]
where we used Remark 2.2 to pass from the sum to the integral norms. Since and have the same limit in and , thanks to (35) we obtain the required sequence satisfying (36) by setting (\hat{u}_{\varepsilon},\hat{v}_{\varepsilon}):=\big{(}\hat{u}_{\varepsilon}^{i(\varepsilon)},\hat{v}_{\varepsilon}^{i(\varepsilon)}\big{)}. ∎
The next lemma is a standard consequence of Proposition 4.7 and Lemma 4.6. A proof can be found for example in [35, Lemma 5.9].
Lemma 4.8** (Inner regularity).**
Let . Then for any it holds that
[TABLE]
Now we are in a position to establish the main result of this subsection.
Proof of Proposition 4.1.
Having at hand Remark 4.3 and Lemmata 4.4, 4.5, 4.6, and 4.8 as well as Proposition 4.7, the well-known arguments how to apply the general integral representation theorem [14, Theorem 1] in order to conclude, can be found, e.g., in [35, Proposition 5.2]. ∎
4.2. Characterization of the bulk density
In this subsection we argue that the function given by Proposition 4.1 agrees with the density of the -limit of the sequence of discrete quadratic functionals defined in (19).
Proposition 4.9** (Characterization of the bulk density).**
Let and be as in Proposition 4.1. Then the -convergence result of Theorem 3.1 holds along the sequence and for a.e. and every it holds that
[TABLE]
where is an (equivalent) integrand of the -limit of (cf. Theorem 3.1).
Proof.
The first equality characterizing the function , which does not rely on the discrete functionals, but only on the structure and growth of the continuum limit, can be proven as in [35, Lemma 5.11]. Hence we only prove the second inequality. By Theorem 3.1, upon passing temporarily to a further subsequence (not relabeled), we may assume that the sequence -converges to some integral functional with density . Fix satisfying the first equality.
Since is an admissible phase-field for any trial recovery sequence of the affine function and for every , we deduce that
[TABLE]
In order to prove the reverse inequality, note that due to Proposition 3.8 we have
[TABLE]
Hence, possibly passing to a further subsequence, we obtain that
[TABLE]
where the last equality follows from Theorem 3.7 and the fact that . Using the uniform local Lipschitz continuity of in the third variable (which is a consequence of the quadratic dependence and local boundedness) one can pass to the limit in by Lebesgue’s differentiation theorem except for a null set independent of , which yields
[TABLE]
for a.e. and every .
Hence we proved the claim along the chosen subsequence. In particular, along any subsequence of the -limit of is uniquely defined by the integrand , so that the -limit along the sequence exists by the Urysohn-property of -convergence, although the integrand might differ on a negligible set depending on the subsequence. ∎
4.3. Characterization of the surface density
Having identified the bulk term, we now show that the surface integrand can be computed with the discrete functional restricted to functions taking only the two values and [math] and functions that vanish on all couples where jumps. This implies in particular that along such sequences , so that . Nevertheless the variable enters the procedure in the form of a non-convex constraint (cf. (25)).
We first study the asymptotic minimization problems given by Proposition 4.1 and their connection to boundary value problems for the discrete functionals . As a first step, we compare the two quantities
[TABLE]
where the limit functional is given (up to subsequences) by Proposition 4.1 and is as in (22). Along the subsequence provided by Proposition 4.1 we can prove the following result about the asymptotic behavior of on cubes when first and then .
Lemma 4.10** (Approximation of minimum values).**
Let and be as in Proposition 4.1. Then, for as in (13) and given by (24), it holds that
[TABLE]
with the cube defined in (12) and the succeeding line.
Proof.
By monotonicity the limits with respect to exist. To reduce notation, we replace by in what follows and write . Moreover, we set and . For every let and be such that . Note that these minimizers exist as the optimization problem is finite dimensional. Due to Remark 4.3 we can assume without loss of generality that for all . Testing the pointwise evaluation of the functions and as competitors for the minimization problem, we see that for small enough
[TABLE]
where in the second inequality we used the implication
[TABLE]
and the last bound in (44) follows from counting lattice points in an tubular neighborhood of the hyperplane . Hence Lemma 4.5 yields that, up to a subsequence (not relabeled), in for some (recall the -bound) and in . Using Remark 2.2, we infer that on . Consequently is admissible in the infimum problem defining and and the -convergence result of Proposition 4.1 yields
[TABLE]
As was arbitrary, we conclude that .
In order to prove the second inequality, for given we let be such that in a neighborhood of and . By Remark 4.3 we can also assume that . Due to -convergence we find converging to and in (again we rely on Remark 4.3) and such that
[TABLE]
Our goal is to modify both sequences such that they attain the discrete boundary conditions. The argument is closely related to the proof of Proposition 4.7, so we just sketch some parts. Since in a neighborhood of , we find equally oriented cubes with
[TABLE]
Fix . For and we define the sets
[TABLE]
and consider an associated cut-off function such that on and . Set and define by
[TABLE]
and
[TABLE]
Since we may assume that , by (47) we have that in . Moreover, also in for all . Setting , the energy can be estimated via
[TABLE]
where we used again (45). The behavior of first term in the last line is controlled by (46). In order to bound the second one, note that the structure of (cf. (24)) and Remark 2.2 imply that
[TABLE]
Since the set admits a -dimensional Minkowski content that agrees (up to a multiplicative constant) with the Hausdorff measure of the closure, we conclude that
[TABLE]
where we used that . For the last term in (4.3) one can use the same arguments already used to prove (4.1) in order to show that
[TABLE]
By construction we have for and for . Averaging the previous inequality we find an index such that
[TABLE]
Due to (47) we have that in . Moreover, and for all , so that and for all small enough. Hence from (46), (4.3), and (50) we deduce that
[TABLE]
As was arbitrary, the claim follows letting first , then and finally . ∎
Our next aim is to provide a simplified form of the discrete minimization problem that is suitable for subadditivity estimates. To this end we will compare the two quantities and given by (25). Namely, we show that we have the following equivalent characterization for the surface density.
Lemma 4.11** (Construction of a competitor for ).**
Let . Then, for all , all and all it holds that
[TABLE]
Remark 4.12**.**
The condition in the definition of implies that the latter is independent of the jump opening . More precisely, for every we have . Thus, combining (34) with Lemma 4.10 and Lemma 4.11 above, we obtain that the surface integrand in Theorem 4.1 is given by
[TABLE]
for , , and .
Proof of Lemma 4.11.
Note that it suffices to bound the left hand side from above by the right hand side. To reduce notation, we set and write instead of . If then both sides are zero. Thus we assume that (the case can be treated similarly). Fix such that
[TABLE]
which exists at least for small taking for instance and . In particular, . In what follows we construct sequences and such that
[TABLE]
and which have almost the same energy. We fix and consider the set of points
[TABLE]
For we define
[TABLE]
To reduce notation, we also introduce the set
[TABLE]
Observe that for with we have if and only if or . Hence for such the following coarea-type estimate holds true:
[TABLE]
Summing this estimate, we infer from Hölder’s inequality that
[TABLE]
The last sum is bounded by the energy, while for small enough the cardinality term can be bounded via . Hence in combination with (51) we obtain
[TABLE]
From this inequality we deduce the existence of some such that
[TABLE]
Define and by its values on setting
[TABLE]
As , the boundary conditions imposed on imply that the function satisfies for all , so that as claimed. Moreover, whenever , then for all with we have . Hence the boundary conditions on are active and implies that , so that . Consequently and therefore . In order to verify condition (52), observe that for any pair with we have if and only if , so that by its very definition . Hence (52) holds true. Next we estimate the energy difference. Recall that . We first estimate the energy term involving the discrete gradients of . Consider first the case when and . Then we have
[TABLE]
The symmetric conclusion holds true when we exchange the roles of and . In all remaining cases we have . Hence we obtain the global bound
[TABLE]
Next we bound the ’singe-well’-term. Since the function is -Lipschitz on , we obtain
[TABLE]
Summing this estimate over all and adding the result to (4.3), we infer from (51) that
[TABLE]
We claim that the last three terms can be made small relatively to by choosing the order of limits as in the statement. On the one hand, note that since we have by (51)
[TABLE]
On the other hand, since , from (53) we deduce
[TABLE]
Inserting (56) and (57) in (4.3) we obtain the estimate
[TABLE]
Taking the appropriate infimum on each side, then letting first , then and , we conclude by the arbitrariness of . ∎
Gathering Proposition 4.1, Proposition 4.9, Lemma 4.10 and Lemma 4.11 we can now prove Theorem 3.2.
Proof of Theorem 3.2.
Let be an admissible lattice with admissible edges and let and be the subsequence and the functional provided by Proposition 4.1. Thanks to Proposition 4.9 we know that along the subsequence also the functionals -converge to for every with given by Theorem 3.1. Combining Propositions 4.1 and 4.9 we then deduce that for every and every we have
[TABLE]
where is given by Theorem 3.1 and is determined by the derivation formula (34). Moreover, Lemma 4.10 together with Lemma 4.11 ensure that the surface integrand does not depend on the jump opening (see also Remark 4.12). In fact, for every and every we obtain
[TABLE]
where is given by the asymptotic formula (26). Finally, using a standard truncation argument (see, e.g., the proof of [35, Theorem 3.3] for more details), thanks to Remark 4.3 we deduce that formula (58) extends to the whole . ∎
4.4. Optimality of the lattice-space scaling
We close this section by proving Theorem 3.9 and the optimality of the lattice-space scaling.
Proof of Theorem 3.9.
Let be an admissible lattice with admissible edges and for every let be as in (32) with for some . It is convenient to rewrite the energy as
[TABLE]
where
[TABLE]
It is then easy to see that Lemmata 4.4–4.8 are satisfied also for the functionals with the constant in Lemma 4.5 and Lemma 4.6 depending on . As a consequence, Proposition 4.1 holds for and yields a limit functional . Moreover, Proposition 4.9 remains unchanged if is replaced by . Finally, Lemma 4.10 and Lemma 4.11 are still valid for and , where for every , and are as in (43) with instead of and instead of , and is as in (25) with and replaced by and , respectively. Moreover, and are replaced by and . Thus, arguing as in the proof of Theorem 3.2 we obtain the required integral representation of on , where now the surface integrand can be equivalently characterized by the formulas
[TABLE]
Notice that thanks to the separation of scales only the surface integrand may depend on the ratio , while the volume integrand is independent of .
In order to verify the estimate in (33) we use again the connection to weak-membrane energies. To this end let be a subsequence such that -converges to and set . Upon passing to a further subsequence we can assume that also -converges for every . Let and for , arbitrary let be admissible for . Clearly, is admissible for the minimization problem
[TABLE]
Moreover, due to Proposition 3.8 we have
[TABLE]
Hence, passing to the infimum and taking the appropriate limits in , and , thanks to Theorem 3.7 we deduce that
[TABLE]
We continue proving the upper estimate in (33). For , fixed we choose admissible for the minimization problem
[TABLE]
and we observe that the -component of the pair defined as
[TABLE]
belongs to . Moreover, arguing as in the proof of Lemma 4.6 we obtain
[TABLE]
However, in general is not admissible for due to the boundary conditions. Nevertheless, , hence using only the boundary conditions of we can argue as in the first part of the proof of Lemma 4.10 to show that
[TABLE]
Since was arbitrarily chosen, passing to the infimum and taking again the appropriate limits in , , finally yields
[TABLE]
∎
Eventually we prove Corollary 3.11.
Proof of Corollary 3.11.
Let be an admissible lattice with admissible edges and suppose now that is such that as . Note that by Proposition 3.8, for every there exists such that for every we have
[TABLE]
Since is bounded in , the compactness result for weak-membrane energies (cf. [35, Lemma 5.6]) yields that up to a subsequence, in for some . It remains to show that . To do so, we prove that the sequence is bounded in uniformly with respect to , then we may conclude by letting . Thanks to Theorem 3.7, up to passing to a further subsequence (not relabeled), we can assume that -converges to . Thus, the growth conditions for the integrands in Theorem 3.7 imply that
[TABLE]
for every , so that . In particular, for every we have and . Since and this implies that is bounded in uniformly with respect to and we conclude. ∎
5. Stochastic homogenization: Proof of Theorems 3.4 and 3.5
In this section we prove Theorem 3.4. In particular we establish the existence of the limit defining in (28). Similar arguments have already been used by the second and third author in [3, Theorem 5.5], [18, Theorem 5.8] (see also [21, Sections 5 and 6]). The main step consists in defining a suitable subadditive stochastic process (see Definition 5.1 below), which then allows us to apply the subadditive ergodic theorem which we recall in Theorem 5.2 below. To this end, we first need to introduce some notation.
For every with for we define the -dimensional interval and we set .
Definition 5.1**.**
A discrete subadditive stochastic process is a function satisfying the following properties:
- (i)
(subadditivity) for every and every finite partition of a.s. we have
[TABLE] 2. (ii)
(boundedness from below) there holds
[TABLE]
We make use of the following pointwise subadditive ergodic theorem (see [1, Theorem 2.4]).
Theorem 5.2**.**
Let be a discrete subadditive stochastic process and let . Suppose that there exists a measure preserving group action such that is stationary with respect to ,i.e.,
[TABLE]
Then there exists a function such that, for -a.e. ,
[TABLE]
As a first step towards the proof of Theorem 3.4 we prove the following proposition.
Proposition 5.3**.**
Let be an admissible stochastic lattice that is stationary with respect to a measure-preserving additive group action with admissible, stationary edges in the sense of Definitions 2.1 & 2.5. Then there exist with and a function satisfying
[TABLE]
for every and every . Moreover, we have for every and
[TABLE]
for every , , and .
In order to prove Proposition 5.3 above we will use several times the following lemma.
Lemma 5.4**.**
Let , and be such that the cubes and satisfy the following conditions
[TABLE]
Then there exists a constant such that
[TABLE]
Proof.
To shorten notation let us set and . Let us choose a pair satisfying and . Thanks to (ii) we can extend to a function by setting on . We now construct a function satisfying . To this end we introduce some notation. We denote by
[TABLE]
the stripe enclosed by the two hyperplanes and . Moreover, the sets
[TABLE]
are the layers of thickness around and . Finally, we set
[TABLE]
Notice that for any pair with at least one point not contained in and one of the following conditions is satisfied:
- (a)
if and , since we have ; 2. (b)
if then implies that and lie on two different sides of the hyperplane , hence .
This motivates to define on by setting
[TABLE]
(see Figure 1).
Observe that thanks to (ii) we have . Moreover, by construction , thus is admissible for and it remains to show that
[TABLE]
then the result follows from the choice of the test pair .
In order to prove (60) we first notice that for any by definition we have only if . Similarly, for with we have only if at least one point belongs to . Thus, thanks to (17) we immediately deduce
[TABLE]
The remaining contributions can be estimated in the same way. In fact, for any we have only if or . Finally, any pair with at least one point belonging to only gives a contribution if at least one point belongs to or to . In combination with (61) this yields
[TABLE]
where to obtain the second inequality we have used Remark 2.2 and (iii). Eventually, since
[TABLE]
we obtain (60) from (5) upon noticing that by hypotheses . ∎
Having at hand Lemma 5.4 we now prove Proposition 5.3.
Proof of Proposition 5.3.
For definiteness we specify the orientation of the cube . Given , we choose the orthonormal basis as the columns of the orthogonal matrix induced by the linear mapping
[TABLE]
The proof is divided into several steps.
Step 1 Existence of for rational directions .
Let ; then is such that and the set is an orthonormal basis for . Moreover, there exists an integer such that for every . We show that there exists a set of probability one such that the limit defining exists for all . To this end, we define a suitable discrete stochastic process (depending on ) that satisfies all the conditions of Theorem 5.2. We start with some notation. For every we define the set as
[TABLE]
and we define a stochastic process by setting
[TABLE]
where is a constant to be chosen later. Note that here we have chosen the same width for the boundary condition imposed on and . Let us prove that . Using the measurability of and (cf. Definition 2.5), one can show that for fixed (interpreted as deterministic vectors ) and the function
[TABLE]
is -measurable. Minimizing over the first components of the vectors and (while fixing the others to zero) preserves measurability and when we infer that is measurable. Sending then we finally conclude that also is measurable as the pointwise limit of measurable functions. In order to show integrability, note that the function is admissible in the minimization problem defining (see also (45)) and, similar to the counting argument used to derive (4.3), one can show that
[TABLE]
uniformly in , so that .
We next prove the stationarity of the process. To this end, for every we set and we define a measure-preserving group action by setting , where is as in the statement. Note that for every and every we have . Moreover, since and is stationary with respect to , we have
[TABLE]
Applying once more the stationarity of and the edges we also obtain the identities and , which yields , and hence the stationarity of the process.
Since , it remains to prove the subadditivity of the process. To this end, let and let be a finite family of pairwise disjoint -dimensional intervals with . For fixed we choose such that and
[TABLE]
Note that also the -dimensional intervals are pairwise disjoint. This allows us to define a pair by setting
[TABLE]
Since and , thanks to the boundary conditions satisfied by we have
[TABLE]
Let us show that , so that is admissible for . Since by construction for every , it suffices to show that for any with and for some we have . To this end, we notice that for such a pair we have , so that and . Similarly and . In particular, if and only if and lie on different sides of the hyperplane . Since this implies , so that . We conclude that indeed . Moreover, by the definition of we have
[TABLE]
Fix , and let . Then only if , so that
[TABLE]
Further, at the points , such that satisfies the boundary conditions, so that only if or . Since , in both cases we have . Thus, denoting by the orthogonal projection onto the hyperplane , we obtain . Moreover the segment intersects the -dimensional set and we deduce that
[TABLE]
Gathering (64) and (65) yields the existence of a constant such that
[TABLE]
Since is admissible for , keeping in mind that
[TABLE]
from (66) we deduce that
[TABLE]
hence the subadditivity follows provided we choose .
Since the contribution is of lower order with respect to the surface scaling , applying Theorem 5.2 yields the existence of a set of full probability and a function such that for every there holds
[TABLE]
Thanks to Lemma 5.4 the passage from the integer sequence to arbitrary sequences is now straightforward. Indeed, let be arbitrary and set , . Applying Lemma 5.4 with the cubes and then yields
[TABLE]
Again applying Lemma 5.4 with cubes and gives
[TABLE]
Dividing by and gathering (67), (68) and (69) we get
[TABLE]
Since the sequence was arbitrarily chosen we deduce that for all belonging to the set of full measure , for every there exists the limit
[TABLE]
Step 2 From rational to irrational directions.
We continue by proving that (70) holds for every and every . To this end, for every and we introduce the auxiliary functions
[TABLE]
and we observe that for every and we have
[TABLE]
We now aim to extend this equality to every and every by density of in .
Let and . As the inverse of the stereographic projection maps rational points to rational directions, we find a sequence converging to . In particular, since , it follows by the continuity of that for fixed there exists an index such that for all we have
- (i)
;
- (ii)
,
where denotes the Hausdorff distance. Using similar arguments as in the proof of Lemma 5.4 we aim to compare the two quantities and . To simplify notation we set
[TABLE]
For and we choose a pair satisfying and . Moreover, we observe that thanks to (i) for t sufficiently large we have . This allows us to extend to a function by setting on . We now construct a function satisfying and which has almost the same energy as . To this end, we consider the cone
[TABLE]
and we set
[TABLE]
We denote by the union of the three sets above. We then define by its values on via
[TABLE]
(see Figure 2).
Let us now verify that . First observe that for all we have and hence by hypotheses. Suppose now that with at least one point belonging to and . Then we can distinguish the following two cases:
- (a)
and : since we have . Moreover, by definition it holds that . In particular, . The latter implies that , so that , which yields ; 2. (b)
: then necessarily , so that and we conclude again.
The above discussion shows that is admissible for (note that also satisfies the correct boundary conditions). Moreover, the same reasoning as in Lemma 5.4 leads to the estimate
[TABLE]
where the second inequality follows thanks to (ii). Dividing the above inequality by and passing to the upper limit as , in view of the choice of we obtain
[TABLE]
Thus, letting first and then gives . A similar argument, now using the second inclusion in (i), leads to the inequality . Hence the equality (71) extends to all and the limit in (70) exists for all directions.
Step 3 Shift invariance in the probability space
Next we find a set on which is invariant under the group action for every . Namely, we define the set
[TABLE]
which has full measure since is measure preserving. Moreover, as a consequence of Definition 2.3 every map is bijective, so that for every we have , hence the limit defining exists for every and every . Thus, it remains to prove that and coincide. To this end it suffices to show that
[TABLE]
holds for every , , and , then the opposite inequality follows by applying (72) with replaced by and replaced by .
Let be as above. There exists such that for all it holds that
[TABLE]
An argument similar to the one used to prove the stationarity of the stochastic process shows that
[TABLE]
Moreover, in view of (73) for sufficiently large the cubes and satisfy all the conditions of Lemma 5.4. Hence we deduce that
[TABLE]
and we obtain (72) by dividing the above inequality by and passing to the limit as . ∎
It is by now standard to show that in the limit defining the cubes can be replaced by with , arbitrary. In fact, the following proposition can be proved by repeating the arguments in the proof of [18, Theorem 5.8] (see also [3, Theorem 5.5]) and applying Lemma 5.4 and Proposition 5.3 above. We thus omit its proof here.
Proposition 5.5**.**
Let be an admissible stationary stochastic lattice with admissible stationary edges in the sense of Definitions 2.1 & 2.5. Then there exists with such that for every and every , , there holds
[TABLE]
where is given by Proposition 5.3. In particular, the limit in (74) exists and is independent of and .
We finally prove Theorem 3.4. Combining [2, Theorem 2] and
Proof of Theorem 3.4.
Proposition 5.3 above yields the existence of a set with such that for all the limit in (28) exists for every and every and (74) holds true. In addition, [2, Theorem 2] proves the existence of a set of full measure (without loss of generality ) such that the limit in (27) exists for every . Moreover, since is an admissible stochastic lattice with admissible edges , for every and every Theorem 3.2 provides us with a subsequence and a functional of the form
[TABLE]
such that -converges to in the strong -topology. Thanks to Proposition 4.9 we know that
[TABLE]
with given by (27), where we have used that thanks to [2, Theorem 2] does not depend on . Moreover, combining the asymptotic formula for in Proposition 4.1 with Lemma 4.10, Lemma 4.11, and a change of variables yields
[TABLE]
where . Since for every fixed we have for sufficiently large, from (75) and Proposition 5.5 we immediately deduce that for every , .
To prove the opposite inequality we fix and . Then a procedure similar to the one used in the proof of Lemma 5.4 allows to extend any pair
[TABLE]
to in such a way that is admissible for and
[TABLE]
Passing to the infimum and dividing the above inequality by we obtain by letting first and then . Hence the limit is determined uniquely independent of the subsequence. The claim then follows from the Urysohn-property of -convergence and the fact that the ergodicity of the group action makes the functions and deterministic due to (59) and [2, Theorem 2], respectively. ∎
Finally, we prove the approximation of the Mumford-Shah functional in the isotropic case.
Proof of Theorem 3.5.
Due Theorem 3.4 it only remains to show that and for some constants . By Theorem 3.2 the function is a non-negative quadratic form. Reasoning exactly as for the vectorial case treated in [2, Theorem 9] one can show that ergodicity and isotropy imply for all and all . Hence is constant on and has to be of the form for some .
We next show that for all . Recall that denotes a measure preserving map such that for all . Next observe that by this isotropy property of we have the equivalences
[TABLE]
Moreover, by the joint isotropy of and of the edges , it holds that
[TABLE]
Hence, from definition (25) we conclude that
[TABLE]
Since is deterministic by ergodicity, we can take expectations in the asymptotic formula given by (28) and due to the fact that is measure preserving, by dominated convergence and a change of variables we obtain
[TABLE]
We finish the proof setting . ∎
6. Numerical results
We complement the theoretical results proved in the previous sections with two numerical examples that illustrate the isotropic behavior of the random discretization considered in this paper.
We start describing how to create the random lattice. The construction of the random lattice is based on the random parking model with parameter , that we briefly describe below. On a fixed bounded domain one constructs a point set as follows
- (1)
Choose a point according to a uniform distribution.
- (2)
For choose the point according to a uniform distribution and accept it if for all .
One obtains the so-called jamming limit repeating this process ad infinitum. When the domain invades the whole space in a suitable sense (for instance, take the sequence ), then it was proven in [33, Theorem 2.2] that the corresponding jamming limits converge weakly (in the sense of measures) to a point process on the whole space , namely the random parking process in . This limit point process together with the associated Voronoi edges satisfy all the assumptions of Theorem 3.5. In practice, however one has to work with the finite approximation described in (1)-(2). Nevertheless, using similar arguments as in [28, Lemma 2.5] one can prove that the -limit remains the same provided the random parking model is constructed on a sequence of rescaled Lipschitz set with via the graphical construction as described in [28, Section 2.1].
For standard images we create the random parking process in a finite rectangular box (usually and are the pixel dimensions of the original image). We notice that the distance test (2) does not need to be done for all points. With an auxiliary list we reduce this test to a uniformly bounded number of points in each iteration step. In this way one can add points until condition (i) in Definition 2.1 is satisfied inside with a sufficiently small . Even though in the (theoretical) jamming limit one can ensure that , for our purposes, with in pixel units, it suffices to ensure that . Instead of checking this condition, a more efficient stopping criterion for creating the random lattice is to stop the iteration process after a certain number ( in the following examples) of unsuccessful iterations (cf. Figure 3 for an example). Finally we mention that the stochastic lattice has to be created just once and can be saved for future usage.
After the lattice has been created one has to compute the Delaunay triangulation in order to obtain the Voronoi neighbors. In this step we also delete long edges close to the boundary of .
In what follows, we compare the number of points and interactions of a discretization of a ()-image with respect and a realization of with which was the parameter we used in our examples. Clearly, with one has points and the number of interactions per point equals (except some points at the boundary that we neglect). For the random lattice, the average of realizations yields points with a maximal deviation of . The average number of interactions per point equals up to boundary corrections of order . In Figure 4 we display a typical distribution of the number of interactions per point. One can conclude that the average number of points does not change significantly when one uses random lattices instead of , while the number of interactions increases by a factor of .
Having created the lattice together with the edges one has to define a discrete version of the original image on the stochastic grid to construct the discrete fidelity term in (30). To this end, at every point we define to be the value at the pixel obtained by taking componentwise the integer part of the coordinates of (of course other choices are possible).
After this preparation we apply the well-known method of alternate minimization for the Ambrosio-Tortorelli functionals. For this method, given a starting guess one minimizes the discrete functional with respect to and finds a first candidate . Then, for fixed one minimizes with respect to and finds a candidate . Note that each minimization requires to solve a linear equation. In the examples presented below we repeat this procedure until for two iterative solutions , it holds .
In what follows we apply the procedure described above to simple but meaningful test images that help to illustrate the anisotropic behavior of the functionals in (4) obtained by discretizing on a periodic lattice in contrast to the isotropic behavior of the discretization on a stochastic lattice in (18). In fact, we present two examples showing that the discretization on a square lattice prefers jump sets whose normal has a small supremum norm. Notice that this is also consistent with the results in [10, Theorem 6.1 and Proposition 7.1]. The first example (Figure 5) is the reconstruction of differently oriented squares. The tuning parameters are chosen as and in the periodic case, while in the stochastic case . We notice that the lower constant in the stochastic setting makes the weight of the surface term per lattice cell comparable in both models. In fact it takes into account that the term has the same weight in both models, while the proportion between the gradient term in the square lattice and the gradient term in the stochastic lattice is . The latter corresponds to the proportion between the number of interactions in the square lattice and the average number of interactions in the stochastic one.
The second example (Figure 6) shows the reconstruction of a circle. For the periodic functionals the tuning parameters are chosen as , , while for the stochastic ones we chose . We display in each case the reconstructed image together with the corresponding edge variable and a binary plot of the sublevelset , the latter one making the anisotropic behavior more evident.
Acknowledgment
The work of A.B. and M.C. was supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics”. M.R. acknowledges financial support from the European Research Council under the European Community’s Seventh Framework Program (FP7/2014-2019 Grant Agreement QUANTHOM 335410).
Conflict of interest
The authors declare that they have no conflict of interest.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. A. Akcoglu and U. Krengel, Ergodic theorems for superadditive processes, J. Reine Angew. Math. , 323 (1981), 53–67.
- 2[2] R. Alicandro, M. Cicalese and A. Gloria, Integral representation results for energies defined on stochastic lattices and application to nonlinear elasticity, Arch. Ration. Mech. Anal. , 200 (2011), 881–943.
- 3[3] R. Alicandro, M. Cicalese and M. Ruf, Domain formation in magnetic polymer composites: an approach via stochastic homogenization, Arch. Ration. Mech. Anal. , 218 (2015), 945–984.
- 4[4] L. Ambrosio, Existence theory for a new class of variational problems, Arch. Ration. Mech. Anal. , 111 (1990), 291–322.
- 5[5] L. Ambrosio and E. De Giorgi, New functionals in the calculus of variations, (Italian) Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. , 82 (1988), 199–210.
- 6[6] 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.
- 7[7] L. Ambrosio and V. M. Tortorelli, Approximation of functionals depending on jumps by elliptic functionals via Γ Γ \Gamma -convergence, Commun. Pure Appl. Math. , 43 (1990), 999-1036.
- 8[8] L. Ambrosio and V. M. Tortorelli, On the approximation of free discontinuity problems, Boll. Un. Mat. Ital. , 6 –B (1992), 105–123.
