Refine
Document Type
Way of publication
- Open Access (1)
Keywords
- Color image (2)
- Matrix field (2)
- Amoeba filter (1)
- Amoebas (1)
- Color morphology (1)
- Conservation laws (1)
- Entropy solution (1)
- FCT scheme (1)
- Finite difference methods (1)
- Finite difference schemes (1)
Institute
BTU
Quantile filters, or rank-order filters, are local image filters which assign quantiles of intensities of the input image within neighbourhoods as output image values. Combining a multivariate quantile definition developed in matrix-valued morphology with a recently introduced mapping between the RGB colour space and the space of symmetric 2×2 matrices, we state a class of colour image quantile filters, along with a class of morphological gradient filters derived from these. Using amoeba structuring elements, we devise image-adaptive versions of both filter classes. Experiments demonstrate the favourable properties of the filters.
Mathematical morphology is a part of image processing that has proven to be fruitful for numerous applications. Two main operations in mathematical morphology are dilation and erosion. These are based on the construction of a supremum or infimum with respect to an order over the tonal range in a certain section of the image. The tonal ordering can easily be realised in grey-scale morphology, and some morphological methods have been proposed for colour morphology. However, all of these have certain limitations. In this paper we present a novel approach to colour morphology extending upon previous work in the field based on the Loewner order. We propose to consider an approximation of the supremum by means of a log-sum exponentiation introduced by Maslov. We apply this to the embedding of an RGB image in a field of symmetric 2×2 matrices. In this way we obtain nearly isotropic matrices representing colours and the structural advantage of transitivity. In numerical experiments we highlight some remarkable properties of the proposed approach.
Morphological levelings represent a useful tool for the decomposition of an image into cartoon and texture components. Moreover, they can be used to construct a morphological scale space. However, the classic construction of levelings is limited to the use of grey scale images, since an ordering of pixel values is required.
In this paper we propose an extension of morphological levelings to colour images. To this end, we consider the formulation of colour images as matrix fields and explore techniques based on the Loewner order for formulating morphological levelings in this setting. Using the matrix-valued colours we study realisations of levelings relying on both the completely discrete construction and the formulation using a partial differential equation. Experimental results confirm the potential of our matrix-based approaches for analysing texture in colour images and for extending the range of applications of levelings in a convenient way to colour image processing.
Analytic Existence and Uniqueness Results for PDE-Based Image Reconstruction with the Laplacian
(2017)
Partial differential equations are well suited for dealing with image reconstruction tasks such as inpainting. One of the most successful mathematical frameworks for image reconstruction relies on variations of the Laplace equation with different boundary conditions. In this work we analyse these formulations and discuss the existence and uniqueness of solutions of corresponding boundary value problems, as well as their regularity from an analytic point of view. Our work not only sheds light on useful aspects of the well posedness of several standard problem formulations in image reconstruction but also aggregates them in a common framework. In addition, the performed analysis guides us to specify two new formulations of the classic image reconstruction problem that may give rise to new developments in image reconstruction.
In this work, we propose a novel way for performing operations of mathematical morphology on color images. To this end, we convert pixelwise the rgb-values into symmetric 2x2 matrices. The new color space can be interpreted geometrically as a biconal color space structure. Motivated by the formulation of the fundamental morphological operations dilation and erosion in terms of partial differential equations (PDEs), we show how to define finite difference schemes making use of the matrix field formulation. The computation of a pseudo supremum and a pseudo infimum of three color matrices is a crucial step for setting up advanced PDE-based methods. We show that this can be achieved for our goal by an algebraic technique. We investigate our approach by dedicated experiments and confirm useful properties of the new PDE-based color morphology operations.
In this paper we are concerned with robust structure-preserving denoising filters for color images. We build on a recently proposed transformation from the RGB color space to the space of symmetric 2×2 matrices that has already been used to transfer morphological dilation and erosion concepts from matrix-valued data to color images. We investigate the applicability of this framework to the construction of color-valued median filters. Additionally, we introduce spatial adaptivity into our approach by morphological amoebas that offer excellent capabilities for structure-preserving filtering. Furthermore, we define color-valued amoeba M-smoothers as a generalization of the median-based concepts. Our experiments confirm that all these methods work well with color images. They demonstrate the potential of our approach to define color processing tools based on matrix field techniques.
In spite of significant advances in Shape from Shading (SfS) over the last years, it
is still a challenging task to design SfS approaches that are flexible enough to handle a
wide range of input scenes. In this paper, we address this lack of flexibility by proposing
a novel model that extends the range of possible applications. To this end, we consider
the class of modern perspective SfS models formulated via partial differential equations
(PDEs). By combining a recent spherical surface parametrisation with the advanced
non-Lambertian Oren-Nayar reflectance model, we obtain a robust approach that allows
to deal with an arbitrary position of the light source while being able to handle rough
surfaces and thus more realistic objects at the same time. To our knowledge, the resulting
model is currently the most advanced and most flexible approach in the literature on
PDE-based perspective SfS. Apart from deriving our model, we also show how the corresponding
set of sophisticated Hamilton-Jacobi equations can be efficiently solved by
a specifically tailored fast marching scheme. Experiments with medical real-world data
demonstrate that our model works in practice and that is offers the desired flexibility.
Quantile filters, or rank-order filters, are local image filters which assign quantiles of intensities of the input image within neighbourhoods as output image values. Combining a multivariate quantile definition developed in matrix-valued morphology with a recently introduced mapping between the RGB colour space and the space of symmetric 2 × 2 matrices, we state a class of colour image quantile filters, along with a class of morphological gradient filters derived from these.We consider variants of these filters based on three matrix norms – the nuclear, Frobenius, and spectral norm – and study their differences. We investigate the properties of the quantile and gradient filters and their links to dilation and erosion operators. Using amoeba structuring elements,we devise image-adaptive versions of our quantile and gradient filters. Experiments are presented to demonstrate the favourable properties of the filters, and compare them to existing approaches in colour morphology.
In this article, a concept of implicit methods for scalar conservation laws in one or more spatial dimensions allowing also for source terms of various types is presented. This material is a significant extension of previous work of the first author (Breuß SIAM J. Numer. Anal. 43(3), 970–986 2005). Implicit notions are developed that are centered around a monotonicity criterion. We demonstrate a connection between a numerical scheme and a discrete entropy inequality, which is based on a classical approach by Crandall and Majda. Additionally, three implicit methods are investigated using the developed notions. Next, we conduct a convergence proof which is not based on a classical compactness argument. Finally, the theoretical results are confirmed by various numerical tests.
Laplace interpolation is a popular approach in image inpainting using partial differential equations. The classic approach considers the Laplace equation with mixed boundary conditions. Recently a more general formulation has been proposed, where the differential operator consists of a point-wise convex combination of the Laplacian and the known image data. We provide the first detailed analysis on existence and uniqueness of solutions for the arising mixed boundary value problem. Our approach considers the corresponding weak formulation and aims at using the Theorem of Lax-Milgram to assert the existence of a solution. To this end we have to resort to weighted Sobolev spaces. Our analysis shows that solutions do not exist unconditionally. The weights need some regularity and must fulfil certain growth conditions. The results from this work complement findings which were previously only available for a discrete setup.