12 research outputs found
Mathematical morphology on tensor data using the Loewner ordering
The notions of maximum and minimum are the key to the powerful tools of greyscale morphology. Unfortunately these notions do not carry over directly to tensor-valued data. Based upon the Loewner ordering for symmetric matrices this paper extends the maximum and minimum operation to the tensor-valued setting. This provides the ground to establish matrix-valued analogues of the basic morphological operations ranging from erosion/dilation to top hats. In contrast to former attempts to develop a morphological machinery for matrices, the novel definitions of maximal/minimal matrices depend continuously on the input data, a property crucial for the construction of morphological derivatives such as the Beucher gradient or a morphological Laplacian. These definitions are rotationally invariant and preserve positive semidefiniteness of matrix fields as they are encountered in DT-MRI data. The morphological operations resulting from a component-wise maximum/minimum of the matrix channels disregarding their strong correlation fail to be rotational invariant. Experiments on DT-MRI images as well as on indefinite matrix data illustrate the properties and performance of our morphological operators
A Second Order Non-Smooth Variational Model for Restoring Manifold-Valued Images
We introduce a new non-smooth variational model for the restoration of
manifold-valued data which includes second order differences in the
regularization term. While such models were successfully applied for
real-valued images, we introduce the second order difference and the
corresponding variational models for manifold data, which up to now only
existed for cyclic data. The approach requires a combination of techniques from
numerical analysis, convex optimization and differential geometry. First, we
establish a suitable definition of absolute second order differences for
signals and images with values in a manifold. Employing this definition, we
introduce a variational denoising model based on first and second order
differences in the manifold setup. In order to minimize the corresponding
functional, we develop an algorithm using an inexact cyclic proximal point
algorithm. We propose an efficient strategy for the computation of the
corresponding proximal mappings in symmetric spaces utilizing the machinery of
Jacobi fields. For the n-sphere and the manifold of symmetric positive definite
matrices, we demonstrate the performance of our algorithm in practice. We prove
the convergence of the proposed exact and inexact variant of the cyclic
proximal point algorithm in Hadamard spaces. These results which are of
interest on its own include, e.g., the manifold of symmetric positive definite
matrices
Morphology for matrix data : ordering versus PDE-based approach
Matrix fields are becoming increasingly important in digital imaging. In order to perform shape analysis, enhancement or segmentation of such matrix fields, appropriate image processing tools must be developed. This paper extends fundamental morphological operations to the setting of matrices, in the literature sometimes referred to as tensors despite the fact that matrices are only rank two tensors. The goal of this paper is to introduce and explore two approaches to mathematical morphology for matrix-valued data: One is based on a partial ordering, the other utilises nonlinear partial differential equations (PDEs).
We start by presenting definitions for the maximum and minimum of a set of symmetric matrices since these notions are the cornerstones of the morphological operations. Our first approach is based on the Loewner ordering for symmetric matrices, and is in contrast to the unsatisfactory component-wise techniques. The notions of maximum and minimum deduced from the Loewner ordering satisfy desirable properties such as rotation invariance, preservation of positive semidefiniteness, and continuous dependence on the input data.
These properties are also shared by the dilation and erosion processes governed by a novel nonlinear system of PDEs we are proposing for our second approach to morphology on matrix data. These PDEs are a suitable counterpart of the nonlinear equations known from scalar continuous-scale morphology. Both approaches incorporate information simultaneously from all matrix channels rather than treating them independently. In experiments on artificial and real medical positive semidefinite matrix-valued images we contrast the resulting notions of erosion, dilation, opening, closing, top hats, morphological derivatives, and shock filters stemming from these two alternatives. Using a ball shaped structuring element we illustrate the properties and performance of our ordering- or PDE-driven morphological operators for matrix-valued data
Mathematical morphology for tensor data induced by the Loewner orderingin higher dimensions
Positive semidefinite matrix fields are becoming increasingly important in digital imaging. One reason for this tendency consists of the introduction of diffusion tensor magnetic resonance imaging (DTMRI). In order to perform shape analysis, enhancement or segmentation of such tensor fields, appropriate image processing tools must be developed. This paper extends fundamental morphological operations to the matrix-valued setting. We start by presenting novel definitions for the maximum and minimum of a set of matrices since these notions lie at the heart of the morphological operations. In contrast to naive approaches like the component-wise maximum or minimum of the matrix channels, our approach is based on the Loewner ordering for symmetric matrices. The notions of maximum and minimum deduced from this partial ordering satisfy desirable properties such as rotation invariance, preservation of positive semidefiniteness, and continuous dependence on the input data. We introduce erosion, dilation, opening, closing, top hats, morphological derivatives, shock filters, and mid-range filters for positive semidefinite matrix-valued images. These morphological operations incorporate information simultaneously from all matrix channels rather than treating them independently. Experiments on DT-MRI images with ball- and rod-shaped structuring elements illustrate the properties and performance of our morphological operators for matrix-valued data
Curvature-driven PDE methods for matrix-valued images
Matrix-valued data sets arise in a number of applications including diffusion tensor magnetic resonance imaging (DT-MRI) and physical measurements of anisotropic behaviour. Consequently, there arises the need to filter and segment such tensor fields. In order to detect edgelike structures in tensor fields, we first generalise Di Zenzo\u27s concept of a structure tensor for vector-valued images to tensor-valued data. This structure tensor allows us to extend scalar-valued mean curvature motion and self-snakes to the tensor setting. We present both two-dimensional and three-dimensional formulations, and we prove that these filters maintain positive semidefiniteness if the initial matrix data are positive semidefinite. We give an interpretation of tensorial mean curvature motion as a process for which the corresponding curve evolution of each generalised level line is the gradient descent of its total length. Moreover, we propose a geodesic active contour model for segmenting tensor fields and interpret it as a minimiser of a suitable energy functional with a metric induced by the tensor image. Since tensorial active contours incorporate information from all channels, they give a contour representation that is highly robust under noise. Experiments on three-dimensional DT-MRI data and an indefinite tensor field from fluid dynamics show that the proposed methods inherit the essential properties of their scalar-valued counterparts
Median and related local filters for tensor-valued images
We develop a concept for the median filtering of tensor data. The main part of this concept is the definition of median for symmetric matrices. This definition is based on the minimisation of a geometrically motivated objective function which measures the sum of distances of a variable matrix to the given data matrices. This theoretically wellfounded concept fits into a context of similarly defined median filters for other multivariate data. Unlike some other approaches, we do not require by definition that the median has to be one of the given data values. Nevertheless, it happens so in many cases, equipping the matrix-valued median even with root signals similar to the scalar-valued situation. Like their scalar-valued counterparts, matrix-valued median filters show excellent capabilities for structure-preserving denoising. Experiments on diffusion tensor imaging, fluid dynamics and orientation estimation data are shown to demonstrate this. The orientation estimation examples give rise to a new variant of a robust adaptive structure tensor which can be compared to existing concepts. For the efficient computation of matrix medians, we present a convex programming framework. By generalising the idea of the matrix median filters, we design a variety of other local matrix filters. These include matrix-valued mid-range filters and, more generally, M-smoothers but also weighted medians and \alpha-quantiles. Mid-range filters and quantiles allow also interesting cross-links to fundamental concepts of matrix morphology
Amoeba Techniques for Shape and Texture Analysis
Morphological amoebas are image-adaptive structuring elements for
morphological and other local image filters introduced by Lerallut et al. Their
construction is based on combining spatial distance with contrast information
into an image-dependent metric. Amoeba filters show interesting parallels to
image filtering methods based on partial differential equations (PDEs), which
can be confirmed by asymptotic equivalence results. In computing amoebas, graph
structures are generated that hold information about local image texture. This
paper reviews and summarises the work of the author and his coauthors on
morphological amoebas, particularly their relations to PDE filters and texture
analysis. It presents some extensions and points out directions for future
investigation on the subject.Comment: 38 pages, 19 figures v2: minor corrections and rephrasing, Section 5
(pre-smoothing) extende
Selected Algorithms of Quantitative Image Analysis for Measurements of Properties Characterizing Interfacial Interactions at High Temperatures.
In the case of every quantitative image analysis system a very important
issue is to improve the quality of images to be analyzed, in other words, their
pre-processing. As a result of pre-processing, the significant part of the
redundant information and disturbances (which could originate from imperfect
vision system components) should be removed from the image.
Another particularly important problem to be solved is the right choice of
image segmentation procedures. Segmentation essence is to divide an image
into disjoint subsets that meet certain criteria for homogeneity (e.g. color,
brightness or texture). The result of segmentation should allow the most
precise determination of geometrical features of objects present in a scene
with a minimum of computing effort. The measurement of geometric
properties of objects present in the scene is the subject of image analysis