Marvin Kahra

Mr. Marvin Kahra


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2021
Verified
Book Chapter
Closed access
PDF file
MKMarvin Kahra
Marvin Kahra
VSVivek Sridhar
Vivek Sridhar
MBMichael Breuß
Michael Breuß

9 January 2023 in Journal of Mathematical Imaging and Vision
Verified
Journal Article
Open access
PDF file
MKMarvin Kahra
Marvin Kahra
MBMichael Breuß
Michael Breuß
The basic filters in mathematical morphology are dilation and erosion. They are defined by a structuring element that is usually shifted pixel-wise over an image, together with a comparison process that takes place within the corresponding mask. This comparison is made in the grey value case by means of maximum or minimum formation. Hence, there is easy access to max-plus algebra and, by means of an algebra change, also to the theory of linear algebra. We show that an approximation of the maximum function forms a commutative semifield (with respect to multiplication) and corresponds to the maximum again in the limit case. In this way, we demonstrate a novel access to the logarithmic connection between the Fourier transform and the slope transformation. In addition, we prove that the dilation by means of a fast Fourier transform depends only on the size of the structuring element used. Moreover, we derive a bound above which the Fourier approximation yields results that are exact in terms of grey value quantisation.


15 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
MKMarvin Kahra
Marvin Kahra
MBMichael Breuß
Michael Breuß
AKAndreas Kleefeld
Andreas Kleefeld
MWMartin Welk
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.

19 September 2025 in Journal of Mathematical Imaging and Vision
Verified
Journal Article
Open access
PDF file
MKMarvin Kahra
Marvin Kahra
MBMichael Breuß
Michael Breuß
AKAndreas Kleefeld
Andreas Kleefeld
MWMartin Welk
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.

14 March 2025 in arXiv
Verified
Preprint
Open access
PDF file
MKMarvin Kahra
Marvin Kahra
MBMichael Breuß
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.