Mimetic finite difference methods in image processing

Abstract

Abstract.We introduce the use of mimetic methods to the imaging community, for the solution of the initial-value problems ubiquitous in the machine vision and image processing and analysis fields. PDE-based image processing and analysis techniques comprise a host of applications such as noise removal and restoration, deblurring and enhancement, segmentation, edge detection, inpainting, registration, motion analysis, etc. Because of their favorable stability and efficiency properties, semi-implicit finite difference and finite element schemes have been the methods of choice (in that order of preference). We propose a new approach for the numerical solution of these problems based on mimetic methods. The mimetic discretization scheme preserves the continuum properties of the mathematical operators often encountered in the image processing and analysis equations. This is the main contributing factor to the improved performance of the mimetic method approach, as compared to both of the aforementioned popular numerical solution techniques. To assess the performance of the proposed approach, we employ the Catté-LionsMorel-Coll model to restore noisy images, by solving the PDE with the three numerical solution schemes. For all of the benchmark images employed in our experiments, and for every level of noise applied, we observe that the best image restored by using the mimetic method is closer to the noise-free image than the best images restored by the other two methods tested. These results motivate further studies of the application of the mimetic methods to other imaging problems.Mathematical subject classification: Primary: 68U10; Secondary: 65L12.

A Numerical Study of Two-Phase Flow Models with Dynamic Capillary Pressure and Hysteresis

“…Castillo and Grone (2003) developed a set of mimetic operators knows as Castillo-Grone's mimetic (CGM) operators. CGM operators have been used in many fields, such as seismic studies Rojas et al (2008), electrodynamics Runyan (2011) and image processing Bazan et al (2011). Numerical results in these fields validate the high efficiency and reliability of the CGM operators.…”

Discrete Total Variation: New Definition and Minimization

“…at cell centers or at cell edges. This idea is also applied in so-called mimetic finite difference methods [27,28]. Transposed to the present context, pixel values are located at the pixel centers, whereas a finite difference like…”

Box Relaxation Schemes in Staggered Discretizations for the Dual Formulation of Total Variation Minimization

“…Using (9) we formally deduce thatp = ∇u/|∇u| for |∇u| = 0 and the primal-dual change of variable (12) is the Euler-Lagrange equation (2) of the primal problem (1), complemented with, as usual in image processing, Neumann homogeneous boundary conditions (∇u/|∇u|) ·n = 0 which correspond to (11).…”

“…Staggered grids were first proposed in [7] in the context of computational fluid mechanics for incompressible fluids. In the framework of computational solid mechanics, this kind of meshes have also been successfully applied in multigrid schemes for problems with dominating gradient-divergence operators [8] and in the context of image processing they were used for a resolution of the primal-dual scheme using a Newton method [9], in inpainting [10] and more recently in [11]. Block relaxation methods are extremely important for multigrid methods.…”