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

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

of local Radon transform

Retinal vessel detection via second derivative of local Radon transfor

PDE-based Morphology for Matrix Fields: Numerical Solution Schemes

Tensor fields are important in digital imaging and computer vision. Hence there is a demand for morphological operations to perform e.g. shape analysis, segmentation or enhancement procedures. Recently, fundamental morphological concepts have been transferred to the setting of fields of symmetric positive definite matrices, which are symmetric rank two tensors. This has been achieved by a matrixvalued extension of the nonlinear morphological partial differential equations (PDEs) for dilation and erosion known for grey scale images. Having these two basic operations at our disposal, more advanced morphological operators such as top hats or morphological derivatives for matrix fields with symmetric, positive semidefinite matrices can be constructed. The approach realises a proper coupling of the matrix channels rather than treating them independently. However, from the algorithmic side the usual scalar morphological PDEs are transport equations that require special upwind-schemes or nove

Supervised Morphology for Structure Tensor-Valued Images Based on Symmetric Divergence Kernels

International audienceMathematical morphology is a nonlinear image processing methodology based on computing min/max operators in local neighbourhoods. In the case of tensor-valued images, the space of SPD matrices should be endowed with a partial ordering and a complete lattice structure. Structure tensor describes robustly the local orientation and anisotropy of image features. Formulation of mathematical morphology operators dealing with structure tensor images is relevant for texture filtering and segmentation. This paper introduces tensor-valued mathematical morphology based on a supervised partial ordering, where the ordering mapping is formulated by means of positive definite kernels and solved by machine learning algorithms. More precisely, we focus on symmetric divergences for SPD matrices and associated kernels