6 research outputs found

    Morphology for matrix data : ordering versus PDE-based approach

    Get PDF
    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

    Get PDF
    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

    Get PDF
    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

    Improving Fiber Alignment in HARDI by Combining Contextual PDE Flow with Constrained Spherical Deconvolution

    Get PDF
    We propose two strategies to improve the quality of tractography results computed from diffusion weighted magnetic resonance imaging (DW-MRI) data. Both methods are based on the same PDE framework, defined in the coupled space of positions and orientations, associated with a stochastic process describing the enhancement of elongated structures while preserving crossing structures. In the first method we use the enhancement PDE for contextual regularization of a fiber orientation distribution (FOD) that is obtained on individual voxels from high angular resolution diffusion imaging (HARDI) data via constrained spherical deconvolution (CSD). Thereby we improve the FOD as input for subsequent tractography. Secondly, we introduce the fiber to bundle coherence (FBC), a measure for quantification of fiber alignment. The FBC is computed from a tractography result using the same PDE framework and provides a criterion for removing the spurious fibers. We validate the proposed combination of CSD and enhancement on phantom data and on human data, acquired with different scanning protocols. On the phantom data we find that PDE enhancements improve both local metrics and global metrics of tractography results, compared to CSD without enhancements. On the human data we show that the enhancements allow for a better reconstruction of crossing fiber bundles and they reduce the variability of the tractography output with respect to the acquisition parameters. Finally, we show that both the enhancement of the FODs and the use of the FBC measure on the tractography improve the stability with respect to different stochastic realizations of probabilistic tractography. This is shown in a clinical application: the reconstruction of the optic radiation for epilepsy surgery planning

    Median and related local filters for tensor-valued images

    Get PDF
    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

    Anisotropic Diffusion Partial Differential Equations in Multi-Channel Image Processing : Framework and Applications

    Get PDF
    We review recent methods based on diffusion PDE's (Partial Differential Equations) for the purpose of multi-channel image regularization. Such methods have the ability to smooth multi-channel images anisotropically and can preserve then image contours while removing noise or other undesired local artifacts. We point out the pros and cons of the existing equations, providing at each time a local geometric interpretation of the corresponding processes. We focus then on an alternate and generic tensor-driven formulation, able to regularize images while specifically taking the curvatures of local image structures into account. This particular diffusion PDE variant is actually well suited for the preservation of thin structures and gives regularization results where important image features can be particularly well preserved compared to its competitors. A direct link between this curvature-preserving equation and a continuous formulation of the Line Integral Convolution technique (Cabral and Leedom, 1993) is demonstrated. It allows the design of a very fast and stable numerical scheme which implements the multi-valued regularization method by successive integrations of the pixel values along curved integral lines. Besides, the proposed implementation, based on a fourth-order Runge Kutta numerical integration, can be applied with a subpixel accuracy and preserves then thin image structures much better than classical finite-differences discretizations, usually chosen to implement PDE-based diffusions. We finally illustrate the efficiency of this diffusion PDE's for multi-channel image regularization - in terms of speed and visual quality - with various applications and results on color images, including image denoising, inpainting and edge-preserving interpolation
    corecore