MKMarvin Kahra

Marvin Kahra

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Marvin Kahra has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Morphological Granulometric Analysis of Particle Imagery from Microgravity Experiments

    by Shima Shabani, Michael Breuß, Marvin Kahra, Jens Teiser, Gretha Swantje Völke, Nico Wenders

  • Open Access

    Matrix-Valued LogSumExp Approximation for Colour Morphology

    by Marvin Kahra, Michael Breuß, Andreas Kleefeld, Martin Welk

    Mathematical morphology is a part of image processing that employs a moving window to modify pixel values through the application of specific operations. The supremum and infimum are pivotal concepts, yet defining them in a general sense for high-dimensional data such as colour is a challenging endeavour. As a result, a number of different approaches have been taken to try to find a solution, with certain compromises being made along the way. In this paper, we present an analysis of a novel approach that replaces the supremum within a morphological operation with the LogExp approximation of the maximum for matrix-valued colours. This approach has the advantage of extending the associativity of dilation from the one-dimensional to the higher-dimensional case. Furthermore, the minimality property is investigated and a relaxation specified to ensure that the approach is continuously dependent on the input data.


  • Open Access

    Morphological Granulometric Analysis of Particle Imagery from Microgravity Experiments

    by Shima Shabani, Michael Breuß, Marvin Kahra, Jens Teiser, Gretha Swantje Völke, Nico Wenders

    The aim of our work is to analyze size distributions of particles and their agglomerates in imagery from astrophysical microgravity experiments. The data acquired in these experiments are given by sequences consisting of several hundred images. It is desirable to establish an automated routine that helps to assess size distributions of important image structures and their dynamics in a statistical way. The main technique we adopt to this end is the morphological granulometry. After preprocessing steps that facilitate granulometric analysis, we show how to extract useful information on size of particle agglomerates as well as underlying dynamics. At hand of the discussion of two different microgravity key experiments we demonstrate that the granulometric analysis enables to assess important experimental aspects. We conjecture that our developments are a useful basis for the quantitative assessment of microgravity particle experiments.

  • Open Access

    Colour Morphological Distance Ordering based on the Log-Exp-Supremum

    by Marvin Kahra, Michael Breuß

    Mathematical morphology, a field within image processing, includes various filters that either highlight, modify, or eliminate certain information in images based on an application's needs. Key operations in these filters are dilation and erosion, which determine the supremum or infimum for each pixel with respect to an order of the tonal values over a subset of the image surrounding the pixel. This subset is formed by a structuring element at the specified pixel, which weighs the tonal values. Unlike grey-scale morphology, where tonal order is clearly defined, colour morphology lacks a definitive total order. As no method fully meets all desired properties for colour, because of this difficulty, some limitations are always present. This paper shows how to combine the theory of the log-exp-supremum of colour matrices that employs the Loewner semi-order with a well-known colour distance approach in the form of a pre-ordering. The log-exp-supremum will therefore serve as the reference colour for determining the colour distance. To the resulting pre-ordering with respect to these distance values, we add a lexicographic cascade to ensure a total order and a unique result. The objective of this approach is to identify the original colour within the structuring element that most closely resembles a supremum, which fulfils a number of desired properties. Consequently, this approach avoids the false-colour problem. The behaviour of the introduced operators is illustrated by application examples of dilation and closing for synthetic and natural images.


  • Open Access

    Matrix-Valued LogSumExp Approximation for Colour Morphology

    by Marvin Kahra, Michael Breuß, Andreas Kleefeld, Martin Welk

    Mathematical morphology is a part of image processing that uses a window that moves across the image to change certain pixels according to certain operations. The concepts of supremum and infimum play a crucial role here, but it proves challenging to define them generally for higher-dimensional data, such as colour representations. Numerous approaches have therefore been taken to solve this problem with certain compromises. In this paper we will analyse the construction of a new approach, which we have already presented experimentally in paper [Kahra, M., Breuß, M., Kleefeld, A., Welk, M., DGMM 2024, pp. 325-337]. This is based on a method by Burgeth and Kleefeld [Burgeth, B., Kleefeld, A., ISMM 2013, pp. 243-254], who regard the colours as symmetric $2\times2$ matrices and compare them by means of the Loewner order in a bi-cone through different suprema. However, we will replace the supremum with the LogExp approximation for the maximum instead. This allows us to transfer the associativity of the dilation from the one-dimensional case to the higher-dimensional case. In addition, we will investigate the minimality property and specify a relaxation to ensure that our approach is continuously dependent on the input data.


  • Open Access

    A First Approach to Quantum Logical Shape Classification Framework

    by Alexander Köhler, Marvin Kahra, Michael Breuß

    Quantum logic is a well-structured theory, which has recently received some attention because of its fundamental relation to quantum computing. However, the complex foundation of quantum logic borrowing concepts from different branches of mathematics as well as its peculiar settings have made it a non-trivial task to device suitable applications. This article aims to propose for the first time an approach to use quantum logic in image processing at hand of a process for shape classification. We show how to make use of the principal component analysis to realize quantum logical propositions. In this way we are able to assign a concrete meaning to the rather abstract quantum logical concepts, and we are able to compute a probability measure from the principal components. For shape classification we consider encrypting given point clouds of different objects by making use of specific distance histograms. This enables to initiate the principal component analysis. At hand of experiments, we explore the possibility to distinguish between different geometrical objects and discuss the results in terms of quantum logical interpretation.

  • Open Access

    An Approach to Colour Morphological Supremum Formation using the LogSumExp Approximation

    by Marvin Kahra, Michael Breuß, Andreas Kleefeld, Martin Welk

    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\times2$ 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.