Abstract
Based on the local discontinuous Galerkin method, two substantially different mixed formulations for the subjective surfaces problem are compared using a number of numerical tests of various types. The work also performs the energy stability analysis for both schemes.
Introduction
The discontinuous Galerkin (DG) method first introduced by Reed and Hill [35] represents a very attractive extension of the classical finite element method; its popularity has been rapidly growing ever since especially for CFD applications. A big advantage of this method clearly distinguishing it from the finite volume methods also very popular in the CFD area is the fact that DG schemes fully fit into the Galerkin/Petrov–Galerkin framework and thus allow to exploit the highly developed analysis toolbox that relies on the Sobolev space theory. The original DG formulation was only suited for the first order conservation laws; this drawback was addressed in the 1970s and early 1980s with the introduction of the interior penalty (IP) methods for elliptic problems and in late 1990s with the first local discontinuous Galerkin (LDG) papers for parabolic equations (see [5] for an overview).
All proposed generalization of the original DG framework can be roughly divided into two main classes: Those discretizing the second (as well as higher than second) order operators directly (e.g., IP methods) and the schemes relying on a mixed formulation as in the LDG method introduced by Cockburn and Shu [14] and used in the present work. The latter methodology employs auxiliary variables to represent the PDE as a system of first order equations and may incur higher computational costs; however it offers, in addition to some other advantages, a very flexible framework suitable for a large variety of complex mathematical models represented by nonlinear PDEs. This flexibility of the mixed formulation often allows to deconstruct the original nonlinear equation into a system of much simpler equations and—as in the present case—to put those equations into divergence form natural for a DG discretization. Aside of that, each equation in the mixed system can be discretized independently, thus allowing to choose a discretization space most appropriate for this particular unknown.
An interesting—however somewhat neglected in the DG literature—issue pertaining to producing a mixed formulation for a given nonlinear PDE is the fact that such representations are not unique. Although fully equivalent in the continuous sense, the discrete versions may generally have different properties with regard to computational cost, implementation convenience, discrete stability, etc. The present work attempts to address this deficit by comparing two mixed formulations for the subjective surfaces equation discretized using the LDG method. The first one is closely related to our earlier work on the same application (see [8]), the second is a simplified version of the scheme proposed by Xu and Shu [45] for Willmore flow of graphs. In addition to presenting a number of numerical examples that illustrate the performance of both formulations, an energy stability analysis is carried out in this work.
Solving the image segmentation problem used as the target application in the current work boils down to determining different regions in a given image identified by colors, gray levels, textures, etc. or, alternatively, outlined by some more or less clear contours. Problems of this sort also arise in psychology (see Kanizsa’s triangle [25]) and may involve edges subjectively implied by shapes present on the image.
The origin of the model used in our study can be traced back to the ’Snake’ model proposed by Kass et al. [27]. This active contour method places an initial curve into the image and considers its evolution using the gradient of an energy functional constructed in a way that penalizes curve irregularities and deviations from the object of interest. This method engendered a number of variations (see [6, 10] for an overview of recent developments). The most widely used schemes to represent the evolving curve are based on the level set method [22, 23, 34, 37, 41, 42], whereas handling of the image gradient information turned out to be more difficult due to noisy peaks and troughs often present in the image. One approach proposed in [11, 12] uses a Mumford–Shah segmentation [33] instead of image gradients to improve robustness with respect to noise. Another popular methodology introduced in [9] is called ’Geodesic Active Contours’ since it employs geodesic flow of a level set function that is based on a metric constructed from the input image.
The underlying weakness of the active contour methodology relying on a single curve to detect the image contours is related to the fact that missing image parts (and missing gradient information) may cause the curve evolution to miss some object edges. In order to address this deficiency, Sarti et al. [39, 40], and Sarti and Citti [38] proposed based on the work in [9] the subjective surface method. As opposed to the original active contour method, all level sets of a segmentation function are evolved. This segmentation function is designed in such way that its graph approximates a piecewise constant surface whose levels correspond to the objects present in the image. The evolution of the level sets stops at edges with large gradients, moves in lowgradient parts of the image, and, on top of that, can bridge gaps in the gradient information.
While the first papers on the subjective surface method [38,39,40] used the finite differences, Mikula et al. introduced in [15, 31] complementary volume schemes that combine finite element and finite volume methods. While finite difference schemes are straightforward to formulate and implement and also lead to adequate results, they lack adaptivity capabilities that may potentially result in substantial reductions of computational cost. An adaptive scheme based on the classical finite elements introduced by Mikula and Fried [21] addressed the issue of optimal mesh adaptivity; however, the solution produced there contained spurious peaks in the vicinity of high gradients.
The well known stability of DG schemes when postprocessed by a slope limiting procedure combined with the highly adaptive nature of discontinuous discretizations motivated our interest in DG method for this application. Our previous work [8] was the first one to attempt utilizing the discontinuous Galerkin methodology in the context of the subjective surface method. In addition, a headtohead comparison utilizing a standard benchmark between classical finite element, finite difference, and DG methods was presented there. This comparison was carried out in the simplest possible configuration (no adaptivity, piecewise linear approximations on triangular meshes for DG and finite elements vs. 5pointstencil for finite differences) that certainly did not favor such a flexible scheme as the LDG method. However, even in such setting the findings presented in [8] indicated that DG discretizations are a viable alternative to the established numerical methods both in terms of computational performance and solution quality and thus deserve a further study.
Model problem and mixed formulations
For \(T>0\) and a domain \(\varOmega \subset \mathbb {R}^n\) we consider the following evolution equation on \((0,T)\times \varOmega \) which is used for instance in image segmentation (cf. [29]):
Here, \({\mathcal {G}}\) is a nonnegative function in \(L^\infty (\varOmega )\). A common choice in image segmentation is
with a constant \(K>0\) and a function \({\mathcal {I}}\) that represents a smoothed greyscale image. To obtain a mean curvature flow equation (cf. [19]) one chooses \({\mathcal {G}}\equiv 1\). Since Eq. (MP) can become singular in regions of vanishing \({\varvec{\nabla }}u\), \({\varvec{\nabla }}u\) is often replaced by its regularized approximation \(\sqrt{{\varvec{\nabla }}u^2+\varepsilon ^2}\) with \(\varepsilon >0\) resulting in the governing equation considered in this work
which is combined with an initial condition \(u(0)=u_0\). In order to make secondorder Eq. (MP\(_\varepsilon \)) accessible for the LDG method we need to transform it into a firstorder system. This transformation is not unique, and in the following we present two different mixed formulations. Introducing notation \({Q_{\varepsilon }}:=\sqrt{{\varvec{z}}^2+\varepsilon ^2}\), the first system is very similar to the one used in [8]:
The main advantage of system (M1\(_\varepsilon \)) is that all equations are in divergence form suitable for a DG discretization.
The second mixed formulation is similar to the setup proposed by Xu and Shu for Willmore flow of graphs [45] and is given by
System (M2\(_\varepsilon \)) is not in divergence form, but it consists of only three equations versus four in (M1\(_\varepsilon \)).
There exist various reasonable choices of boundary conditions for these problems, but for simplicity we assume sufficient regularity of the solution and the domain and impose homogeneous Neumann boundary conditions \({\varvec{z}}\cdot {\varvec{\nu }}=0\) a. e. on \(\partial \varOmega \), where \({\varvec{\nu }}\) denotes the outward unit normal to \(\partial \varOmega \).
Discretization
Notation
Similarly to our first paper dealing with the application of a DG method to the subjective surfaces problem [8], the MATLAB toolbox FESTUNG [17] was used for our implementation; thus, the notation used here is generally similar to [18, 24, 36]. We assume that \(\varOmega \) is polygonally bounded and let \(\mathcal {T}_h=\{{\mathcal {K}}\}\) denote a regular family of nonoverlapping partitions of \({\overline{\varOmega }}\) into K closed triangles \({\mathcal {K}}\) of characteristic size h, i.e., \(\displaystyle {\overline{\varOmega }}=\cup {\mathcal {K}}\). For \({\mathcal {K}}\in \mathcal {T}_h\), \({\varvec{\nu }}_{\mathcal {K}}\) is the unit normal on \(\partial {\mathcal {K}}\) exterior to \({\mathcal {K}}\). Letting \(\mathcal {E}_I\) be the set of interior faces, and \(\mathcal {E}_E\) the set of boundary faces, the set of all faces is given by \(\mathcal {E}:=\mathcal {E}_I\,\cup \,\mathcal {E}_E\) (the subscript h is suppressed here). For an interior face \(F\in \mathcal {E}_I\) shared by triangles \({\mathcal {K}}^\) and \({\mathcal {K}}^+\), we define the onesided values of a scalar quantity \(w=w({\varvec{x}})\) on F by
For a boundary face \(F\in \mathcal {E}_E\), only the first makes sense. The onesided values of vectorvalued quantities are defined analogously. The average and the jump of scalar w and vector \({\varvec{u}}\) on \(F\in \mathcal {E}_I\) are given then by
respectively. Note that \(\llbracket {w}\rrbracket \) is vectorvalued, and \(\llbracket {{\varvec{u}}}\rrbracket \) is scalarvalued quantity. Furthermore, we define a vectorvalued jump of vector \({\varvec{u}} = (u_x, u_y)^T\) for an element \({\mathcal {K}}\) as
Semidiscrete formulation
For \(\mathbb {P}_p({\mathcal {K}})\) the space of all polynomials of degree not greater than p on \({\mathcal {K}}\in \mathcal {T}_h\), we denote by
the broken polynomial space on triangulation \(\mathcal {T}_h\). In the following, we utilize \(L^2\)projections of functions \(u_\text {0}\) and \({\mathcal {G}}\) into the DG space \(\mathbb {P}_p(\mathcal {T}_h)\) marked by hsubscript. For a function f, its \(L^2\)projection \(f_h\in \mathbb {P}_p(\mathcal {T}_h)\) has to satisfy
Using this together with the boundary conditions and the initial value of \(u_h\) computed as an \(L^2\)projection of \(u_0\) we can now formulate the semidiscrete problems corresponding to (M1\(_\varepsilon \)) and (M2\(_\varepsilon \)):
Formulation 1
Seek \(({\varvec{z}}_h,{\varvec{v}}_h,{\varvec{y}}_h,u_h)\in \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2 \times \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \left[ \mathbb {P}_{3p}(\mathcal {T}_h)\right] ^2\times \mathbb {P}_p(\mathcal {T}_h)\) such that the following holds \(\forall {\mathcal {K}}\in \mathcal {T}_h\), \(\forall {\varvec{\varphi _z}},{\varvec{\varphi _v}}\in \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2,{\varvec{\varphi _y}}\in \left[ \mathbb {P}_{3p}(\mathcal {T}_h)\right] ^2,\) \({\varphi _u}\in \mathbb {P}_p(\mathcal {T}_h)\), and a.e. \(0<t<T\):
Formulation 2
Seek \(({\varvec{z}}_h,{\varvec{v}}_h,u_h)\in \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \mathbb {P}_p(\mathcal {T}_h)\) such that the following holds \(\forall {\mathcal {K}}\in \mathcal {T}_h\), \(\forall {\varvec{\varphi _z}},{\varvec{\varphi _v}}\in \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2, {\varphi _u}\in \mathbb {P}_p(\mathcal {T}_h)\), and a.e. \(0<t<T\):
where \(\alpha ,\beta ,\gamma >0\) denote penalty coefficients, and \(h_F\) is the length of the boundary face \(F \subset \partial {\mathcal {K}}\).
Stability analysis
In this section, we consider the discrete stability of Formulations 1 and 2. Since the problem is nonlinear we do not carry out these estimates in some standard norm but rather consider statements of so called "energy stability". We were not able to find literature on discrete stability estimates for DG approaches to the equation at hand; however, there are some results for similar highly nonlinear equations. Karasözen et al. [26] and Feng and Li [16] presented fully discrete energy stability estimates for discontinuous Galerkin approximations of the Allen–Cahn equation which is also related to the mean curvature flow as indicated in [16]. The DG schemes used in [16, 26] relied on the symmetric interior penalty method (SIPG) where second order operators are discretized as in the traditional finite element methods (cf. Sect. 1). Xia et al. [43, 44] presented semidiscrete energy estimates for fourthorder Cahn–Hilliard and coupled Allen–Cahn/Cahn–Hilliard systems discretized using LDG methods. Similar estimates for surface diffusion and Willmore flow of graphs—also fourthorder equations—were presented by Xu and Shu [45] and served as an inspiration for the current work. The analysis techniques employed in the proofs below are in part based on our own stability estimates for the 2 and 3D shallowwater [2, 32] and Darcy [4] equations as well as on the work by Cockburn and Dawson [13].
Theorem 1
Let \(({\varvec{z}}_h,{\varvec{v}}_h,{\varvec{y}}_h,u_h)\in \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \left[ \mathbb {P}_{3p}(\mathcal {T}_h)\right] ^2\times \mathbb {P}_p(\mathcal {T}_h)\) be a solution of Formulation 1. In addition, we assume \(0 < {\mathcal {G}}_\text {min} \le {\mathcal {G}}_h \le {\mathcal {G}}_\text {max}\). Then there exists a constant C independent of h (but dependent on the domain \(\varOmega \), problem parameters, etc.) such that the following holds:
Proof
First, we integrate by parts the respective second terms of Eqs. (2a) and (2c) obtaining
Substituting \({\varvec{\varphi _z}}= {\varvec{v}}_h,\, {\varvec{\varphi _v}}= {\varvec{z}}_h, \, {\varvec{\varphi _y}}= {\mathcal {G}}_h {\varvec{z}}_h u_h,\, {\varphi _u}= u_h\), summing over all elements \({\mathcal {K}}\in \mathcal {T}_h\), and evaluating the metaequation ’(2a\(^\prime \))–(2b) + 1/2 (2c\(^\prime \)) + (2d)’, produces
The remainder of the proof deals with estimating the righthandside terms in (5). For convenience, we remind the reader of Young’s inequality frequently used in our analysis: \(\forall a,b\ge 0,\sigma >0\) it holds \(a\,b\le \frac{a^2}{2\sigma }+\frac{\sigma b^2}{2}\).
using the inverse inequality for regular meshes with constant \(C_\text {inv}\) and limits for \({\mathcal {G}}_h\).
The estimate of the boundary integral term on the right hand side of (5) exploits the Lipschitz continuity with the Lipschitz constant less than 1 of the logarithmic function for argument values \(\ge 1\), i.e., \(\left \log a  \log b \right \le a b, \; \forall a,b \ge 1\) and the simple fact that \(\llbracket {const}\rrbracket =0\):
The final result is then obtained by applying Grönwall’s inequality. \(\square \)
Some remarks on this estimate and the required assumptions are in order.

The limits on \({\mathcal {G}}_h\) as well as the ’special’ penalty term in (2a) are needed to perform the stability estimate and can be omitted in the implementation with no negative effects. Whereas the upper limit on \({\mathcal {G}}_h\) is realistic and justified by the application, the lower limit is not. The choice of \({\mathcal {G}}\) in Sect. 2 reveals that in regions of a very large image gradients function \({\mathcal {G}}\) can indeed attain values arbitrary close to zero. Since the lower limit is only needed to estimate the gradient \({\varvec{\nabla }}{\varvec{z}}_h\) by the function itself, one could alternatively attempt to use a weighted inverse inequality. Such results do exist for some specific choices of the weight function (see, e.g., [7]), but this would unnecessarily make the analysis more complicated and less general.

The choice of higher polynomial order for the approximation space for \({\varvec{y}}_h\) in Theorem 1 is motivated by the analysis technique used in this study. From the practical standpoint, using approximation spaces of equal order for all unknowns (as was the case in [8]) also works fine.

Variable \({\varvec{v}}\) in (M1\(_\varepsilon \)) has been introduced for analysis convenience and can be trivially omitted by modifying the last equation in system (M1\(_\varepsilon \)) as was done in [8], thus equating the number of equations to that in system (M2\(_\varepsilon \)).
Theorem 2
Let \(({\varvec{z}}_h,{\varvec{v}}_h,u_h)\in \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \left[ \mathbb {P}_p(\mathcal {T}_h)\right] ^2\times \mathbb {P}_p(\mathcal {T}_h)\) be a solution for Formulation 2. It holds:
Proof
In the first step, we differentiate (3a) with respect to time and integrate the second term by parts resulting in
Choosing \({\varvec{\varphi _z}}= {\varvec{v}}_h,\, {\varvec{\varphi _v}}= \partial _t{\varvec{z}}_h,\, {\varphi _u}= \partial _t u_h\), summing over all elements \({\mathcal {K}}\in \mathcal {T}_h\), and subtracting (3b) from the sum of (3a’) and (3c) we arrive at the result of the theorem. \(\square \)
Numerical results
In this section, we compare the numerical results obtained with Formulations 1 and 2 using an analytical test problem, a standard benchmark on subjective contours, and a medical image. Both formulations represent nonlinear systems of equations that we solve semiimplicitly in time using the backward/forward Euler method by employing implicit Euler for all linear parts of the system and explicit Euler for nonlinear ones. The time step in all runs is chosen small enough to preclude any effects of the time discretization error on the final result.
Code verification
In the following, we verify the correctness of our code and determine the experimental orders of convergence of our numerical scheme. Let
and let \(\displaystyle u(t,{\varvec{x}})=10\,(t+0.1)\,\exp ({\varvec{x}}^2)\) be the exact solution with \({\mathcal {G}}({\varvec{x}})={\varvec{x}}\). Inserting this in Eq. (MP) yields the righthandside function
which goes into (2d) and (3c) as an additional term. We apply Dirichlet boundary conditions in this test case, set \(\varepsilon =0\), and forego any slope limiting because of the expected smoothness of the solution. For \(j\in {\mathbb {N}}\), we denote by \(h_j\) the mesh size of a FriedrichKeller triangulation and define the time step size as \(\tau _j:=C(p)\,h_j^{p+1}\), where p denotes the polynomial degree, and C(p) is chosen as 0.05 if \(p=0\) and 1 otherwise. In case \(p=1\), the definition of \(\tau _j\) is a standard choice for diffusion problems (see [19, 20, 29], where a classical (piecewise linear) finite element discretization was used). Furthermore, we define the error of our approximation \(u_{h_j}\) in the jth refinement level via \(\textit{err}_j:=\Vert u(t)u_{h_j}(t)\Vert _{L^2(\varOmega )}\vert _{t=0.01}\) and, for \(j>1\), the experimental order of convergence by
Formulation 1
Table 1 shows that our first method converges with the expected order of \(p+1\). We omitted the first penalty term, i.e. set \(\alpha =0\), since the exact solution is regular enough to prevent instabilities.
Formulation 2
Table 2 shows that also our second method converges with an estimated order of \(p+1\). This convergence behavior is consistent with known LDG results for advectiondiffusion equations [14]. We also note that the first formulation appears to have a somewhat better absolute error even though the convergence orders are very similar for both systems.
Kanizsa’s triangle
In this section, we apply our algorithms to a standard image segmentation benchmark called Kanizsa’s triangle [Fig. 1 (left)] whose aim is to find the subjective contours. As already mentioned in Sect. 2, Eq. (MP) is used in image segmentation (cf. [8, 15, 30, 38,39,40] for a detailed description). In a nutshell, it enforces a level set/graph flow of a segmentation function towards a steady and approximately piecewise constant surface. The different plateaus of the segmentation function correspond to "objects" in an image, and its level sets correspond to their edges. Such objects can be described in terms of both physical edges—corresponding to high gradients in the image—and subjective edges such as the triangle in Fig. 1 (left) that is discernible although it is not objectively present in the image. However, the subjective surfaces method (MP) is able to detect both of these two types of edges.
As initial segmentation function with level sets in Fig. 1 (right) we have
\({\varvec{x}}_0\in \varOmega \) and \(R>0\) are the object’s estimated center of mass and half diameter, respectively; \(\chi _{\{\cdot \}}\) denotes the characteristic function of a set.
The regularization parameter is chosen as \(\varepsilon =0\) for Formulation 1 and \(\varepsilon =10^{6}\) for Formulation 2, respectively. We choose \((0,T)\times \varOmega =(0,0.12)\times [0,1]^2\) and discretize the problem using 120 equidistant time steps and 11,858 elements in the spatial triangulation. The edge detector \({\mathcal {G}}\) is given by (1) with \(K=0.005\), and the stabilization parameters are \(\alpha =0,\,\beta =10\), and \(\gamma =0.1\). The polynomial degree of the spatial approximation is \(p=1\). Similarly to the results presented in [8], the solution is postprocessed after each time step using the vertexbased slope limiter introduced in [1, 3, 28].
Figure 2 shows 10 level lines of the segmentation function equidistributed in the interval \([1/3,2/3]\cdot \max _{\varOmega }u(T)\) for both formulations after 60 and 120 time steps. In addition, the values of the edge detector \({\mathcal {G}}\) for Kanizsa’s triangle are depicted in the background, where blue corresponds to 0 and red to 1.
Obviously, both formulations are able to produce the desired result, i.e. the level sets evolve towards the contours of the subjective triangle that one perceives. However, the level sets in Fig. 2 and the graphs in Fig. 3 indicate that the first formulation produces a less stable evolution than the second. In particular, small over and undershoots are clearly visible in Fig. 3 (left) in the vicinity of the triangle. It remains to be mentioned that the second formulation must have a strictly positive \(\varepsilon \) to guarantee regularity of the system matrix, whereas the first formulation allows for a vanishing \(\varepsilon \). However, in our numerical experiments, the first formulation required larger values of the penalty parameter (\(\beta \gg \gamma \)).
Medical image segmentation
To validate the applicability of our algorithms to realworld problems, we attempt to segment a single heart chamber in an ultrasonic image of the heart. The same spacetime domain is used as in Sect. 5.2 with a somewhat coarser mesh consisting of only ca. 5000 elements. Apart from the parameter K in the edge detector, which is changed to \(K=0.05\), all other parameters have the same values as in Sect. 5.2. Figure 4 shows the original image and 10 equidistributed level sets of the solutions to (M1\(_\varepsilon \)) and (M2\(_\varepsilon \)) in the intervals \([4/10,6/10]\cdot \max _{\varOmega }u(T)\) and \([6/10,8/10]\cdot \max _{\varOmega }u(T)\), respectively.
Conclusions
In this study, we compared two mixed formulations for the subjective surface method discretized using the local discontinuous Galerkin method. Both formulations were evaluated using numerical tests, and energy stability estimates were carried out. Even though our numerical tests showed similar convergence behavior in both cases, a number of notable differences became apparent in the course of our study. These can be summarized as follows:

In the setting considered in our stability analysis, system (M1\(_\varepsilon \)) contains one more equation than (M2\(_\varepsilon \)) and requires a higher order polynomial space for one of the unknowns thus producing more degrees of freedom with the corresponding higher computational cost. However, both requirements were introduced to simplify analysis and can be safely omitted in practical computations as illustrated in [8].

System (M1\(_\varepsilon \)) is in divergence form whereas (M2\(_\varepsilon \)) is not; implementing the former in the context of a DG scheme is much more straightforward. In addition, system (M2\(_\varepsilon \)) requires division by a nonlinear expression in each time step that may cause further numerical difficulties.

The stability analysis for system (M1\(_\varepsilon \)) is more technical; however the obtained result is stronger and utilizes a ’typical’ DG norm. For system (M2\(_\varepsilon \)), on the other hand, the energy stability analysis results in an upper bound for the expression that may also contain nonpositive terms and thus does not qualify as a norm or a seminorm.

Applied to the Kanizsa’s triangle benchmark, Formulation 1 produced a less stable evolution than Formulation 2. In addition, the contours located by the second formulation appear to be closer to the subjective contours of the Kanizsa’s triangle. This phenomenon persists if one reduces the time step size and may require a more elaborate solution strategy than the pseudotime stepping used in this work (e.g. some form of Newton’s method). We ascribe this difference between formulations to a somewhat more efficient handling of the nonlinearity \({Q_{\varepsilon }}:=\sqrt{{\varvec{z}}^2+\varepsilon ^2}\) in (M2\(_\varepsilon \)).

Comparing both formulations on a medical imaging application once again led to a somewhat less stable solution using the first scheme. Nonetheless, both methods were able to sufficiently accurately locate the boundary of the heart chamber.
The results obtained in [8] and in this study encourage further investigation of DG methods for the subjective surface problem incorporating spacial adaptivity in order to significantly reduce the computational effort. Another interesting avenue of research concerns combining elements of lower and higher polynomial order in the same adaptive scheme (hpadaptivity).
References
 1.
Aizinger, V.: A geometry independent slope limiter for the discontinuous Galerkin method. In: Krause, E., Shokin, Y., Resch, M., Kröner, D., Shokina, N. (eds.) Computational Science and High Performance Computing IV, Volume 115 of Notes on Numerical Fluid Mechanics and Multidisciplinary Design, pp. 207–217. Springer, Berlin (2011)
 2.
Aizinger, V., Dawson, C.: The local discontinuous Galerkin method for threedimensional shallow water flow. Comput. Methods Appl. Mech. Eng. 196(4), 734746 (2007)
 3.
Aizinger, V., Kosik, A., Kuzmin, D., Reuter, B.: Anisotropic slope limiting for discontinuous Galerkin methods. Int. J. Numer. Methods Fluids 84(9), 543565 (2017)
 4.
Aizinger, V., Rupp, A., Schütz, J., Knabner, P.: Analysis of a mixed discontinuous Galerkin method for instationary Darcy flow. Comput. Geosci. 22(1), 179–194 (2018)
 5.
Arnold, D.N., Brezzi, F., Cockburn, B., Marini, L.D.: Analysis of discontinuous Galerkin methods for elliptic problems. SIAM J. Numer. Anal. 39, 1749–1779 (2002)
 6.
Baswaraj, D., Govardhan, A., Premchand, P.: Active contours and image segmentation: the current state of the art. Glob. J. Comput. Sci. Technol. 12(11F) (2012). https://computerresearch.org/index.php/computer/article/view/568
 7.
Belhachmi, Z., Bernardi, C., Deparis, S.: Weighted Clément operator and application to the finite element discretization of the axisymmetric Stokes problem. Numer. Math. 105(2), 217–247 (2006)
 8.
Bungert, L., Aizinger, V., Fried, M.: A discontinuous Galerkin method for the subjective surfaces problem. J. Math. Imaging Vis. 58(1), 147–161 (2017)
 9.
Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vis. 22(1), 61–79 (1997)
 10.
Chan, T.F., Moelich, M., Sandberg, B.: Some recent developments in variational image segmentation. In: Tai, X.C., Lie, K.A., Chan, T.F., Osher, S. (eds.) Image Processing Based on Partial Differential Equations, pp. 175–210. Springer, New York (2007)
 11.
Chan, T.F., Sandberg, B., Vese, L.A.: Active contours without edges for vectorvalued images. J. Vis. Commun. Image Represent. 11(2), 130–141 (2000)
 12.
Chan, T.F., Vese, L.A.: Active contours without edges. IEEE Trans. Image Process. 10(2), 266–277 (2001)
 13.
Cockburn, B., Dawson, C.: Some extensions of the local discontinuous Galerkin method for convectiondiffusion equations in multidimensions. In: Whiteman, J. (eds.) Proceedings of the 10th Conference on the Mathematics of Finite Elements and Applications, pp. 225–238. Elsevier, Amsterdam (2000)
 14.
Cockburn, B., Shu, C.: The local discontinuous Galerkin method for timedependent convectiondiffusion systems. SIAM J. Numer. Anal. 35(6), 2440–2463 (1998)
 15.
Corsaro, S., Mikula, K., Sarti, A., Sgallari, F.: Semiimplicit covolume method in 3D image segmentation. SIAM J. Sci. Comput. 28, 2248–2265 (2006)
 16.
Feng, X., Li, Y.: Analysis of symmetric interior penalty discontinuous Galerkin methods for the Allen–Cahn equation and the mean curvature flow. IMA J. Numer. Anal. 35, 1622–1651 (2014)
 17.
Frank, F., Reuter, B., Aizinger, V.: FESTUNG—The Finite Element Simulation Toolbox for UNstructured Grids. http://www.math.fau.de/FESTUNG. Accessed 15 Feb 2018
 18.
Frank, F., Reuter, B., Aizinger, V., Knabner, P.: FESTUNG: a MATLAB/GNU Octave toolbox for the discontinuous Galerkin method, part I—diffusion operator. Comput. Math. Appl. 70(1), 11–46 (2015)
 19.
Fried, M.: Berechnung des Krmmungsflusses von Niveauflächen (in German). Master’s thesis, University of Freiburg (1993)
 20.
Fried, M.: Multichannel image segmentation using adaptive finite elements. Comput. Vis. Sci. 12(3), 125–135 (2009)
 21.
Fried, M., Mikula, K.: Efficient subjective surfaces segmentation by adaptive finite elements. In: Lecture Presented at the IMI International Workshop on Computational Photography and Aesthetics, 12 (2009)
 22.
Frolkovič, P., Mikula, K.: Fluxbased level set method: a finite volume method for evolving interfaces (2003). https://doi.org/10.1016/j.apnum.2006.06.002
 23.
Frolkovič, P., Mikula, K.: Highresolution fluxbased level set method. SIAM J. Sci. Comput. 29(2), 579–597 (2007)
 24.
Jaust, A., Reuter, B., Aizinger, V., Schütz, J., Knabner, P.: FESTUNG: a MATLAB/GNU Octave toolbox for the discontinuous Galerkin method, part III—hybridized discontinuous Galerkin (HDG) formulation. Submitted to Computers & Mathematics with Applications (2018)
 25.
Kanizsa, G.: Subjective contours. Sci. Am. 234(4), 48–52 (1976)
 26.
Karasözen, B., Filibelioğlu, A.S., Uzunca, M.: Energy stable discontinuous Galerkin finite element method for the Allen–Cahn equation. arXiv preprint arXiv:1409.3997 (2014)
 27.
Kass, M., Witkin, A., Terzopoulos, D.: Snakes: active contour models. Int. J. Comput. Vis. 1(4), 321–331 (1988)
 28.
Kuzmin, D.: A vertexbased hierarchical slope limiter for adaptive discontinuous Galerkin methods. J. Comput. Appl. Math. 233(12), 3077–3085 (2010). Finite Element Methods in Engineering and Science (FEMTEC 2009)
 29.
Mikula, K., Peyriéras, N., Remešíková, M., Sarti, A.: 3D embryogenesis image segmentation by the generalized subjective surface method using the finite volume technique. In: Eymard, R., Hérard, J.M. (eds.) Finite Volumes for Complex Applications V, pp. 585–592. Wiley, New York (2008)
 30.
Mikula, K., Sarti, A.: Parallel covolume subjective surface method for 3D medical image segmentation. In: Suri, J.S., Farag, A.A. (eds.) Deformable Models, Topics in Biomedical Engineering. International Book Series, pp. 123–160. Springer, New York (2007)
 31.
Mikula, K., Sarti, A., Sgallari, F.: Covolume level set method in subjective surface based medical image segmentation. In: Suri, J.S., Wilson, D.L., Laxminarayan, S. (eds.) Handbook of Biomedical Image Analysis, pp. 583–626. Springer, New York (2005)
 32.
Mirabito, C., Dawson, C., Aizinger, V.: An a priori error estimate for the local discontinuous Galerkin method applied to twodimensional shallow water and morphodynamic flow. Numer. Methods Partial Differ. Equ. 31(2), 397–421 (2015)
 33.
Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Commun. Pure Appl. Math. 42(5), 577–685 (1989)
 34.
Osher, S., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces (Applied Mathematical Sciences), 2003 Edition. Springer, New York (2002)
 35.
Reed, H., Hill, T.R.: Triangular mesh methods for the neutron transport equation. Technical Report LAUR73479, Los Alamos Scientific Laboratory, NM (1973)
 36.
Reuter, B., Aizinger, V., Wieland, M., Frank, F., Knabner, P.: FESTUNG: a MATLAB/GNU Octave toolbox for the discontinuous Galerkin method, part II—advection operator and slope limiting. Comput. Math. Appl. 72(7), 1896–1925 (2016)
 37.
Sapiro, G.: Geometric Partial Differential Equations and Image Analysis, 1st edn. Cambridge University Press, Cambridge (2001)
 38.
Sarti, A., Citti, G.: Subjective surfaces and riemannian mean curvature flow graphs. Acta Math. Univ. Comen. 70, 85–104 (2001)
 39.
Sarti, A., Malladi, R., Sethian, J.A.: Subjective surfaces: a method for completing missing boundaries. Proc. Natl. Acad. Sci. 97(12), 6258–6263 (2000)
 40.
Sarti, A., Malladi, R., Sethian, J.A.: Subjective surfaces: a geometric model for boundary completition. Int. J. Comput. Vis. 46(3), 201–221 (2002)
 41.
Sethian, J.A.: Numerical algorithms for propagating interfaces: Hamilton–Jacobi equations and conservation laws. J. Differ. Geom. 31(1), 131–161 (1990)
 42.
Sethian, J.A.: Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, 2nd edn. Cambridge University Press, Cambridge (1999)
 43.
Xia, Y., Xu, Y., Shu, C.W.: Local discontinuous Galerkin methods for the Cahn–Hilliard type equations. J. Comput. Phys. 227(1), 472–491 (2007)
 44.
Xia, Y., Xu, Y., Shu, C.W.: Application of the local discontinuous Galerkin method for the Allen–Cahn/Cahn–Hilliard system. Commun. Comput. Phys 5, 821–835 (2009)
 45.
Xu, Y., Shu, C.W.: Local discontinuous Galerkin method for surface diffusion and Willmore flow of graphs. J. Sci. Comput. 40(1–3), 375–390 (2009)
Author information
Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aizinger, V., Bungert, L. & Fried, M. Comparison of two local discontinuous Galerkin formulations for the subjective surfaces problem. Comput. Visual Sci. 18, 193–202 (2018). https://doi.org/10.1007/s0079101802914
Received:
Accepted:
Published:
Issue Date:
Keywords
 Local discontinuous Galerkin method
 Image segmentation
 Subjective surfaces
 Stability analysis
 Mixed formulation
 Divergence form
 Edge detection