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

• URL: http://arxiv.org/abs/2503.11329v1
• Date: Fri, 14 Mar 2025 11:57:34 GMT
• Title: Colour Morphological Distance Ordering based on the Log-Exp-Supremum
• Authors: Marvin Kahra, Michael Breuß,
• Abstract summary: This paper shows how to combine the theory of the log-exp-supremum of colour matrices with a well-known colour distance approach in the form of a pre-ordering.<n>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.
• Score: 0.1611401281366893
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Controllable-Continuous Color Editing in Diffusion Model via Color Mapping [73.62340517056619]
  We introduce a color mapping module that explicitly models the correspondence between the text embedding space and image RGB values.<n>Users can specify a target RGB range to generate images with continuous color variations within the desired range.<n> Experimental results demonstrate that our method performs well in terms of color continuity and controllability.
  arXiv  Detail & Related papers  (2025-09-17T07:12:51Z)
• StainPIDR: A Pathological Image Decouplingand Reconstruction Method for StainNormalization Based on Color VectorQuantization and Structure Restaining [4.222992359119992]
  Computer-aided diagnostic systems may deteriorate when facing color-variant pathological images.<n>We propose a stain normalization method called StainPIDR.<n>The code of StainPIDR will be publicly available later.
  arXiv  Detail & Related papers  (2025-06-22T02:54:20Z)
• Leveraging Semantic Attribute Binding for Free-Lunch Color Control in Diffusion Models [53.73253164099701]
  We introduce ColorWave, a training-free approach that achieves exact RGB-level color control in diffusion models without fine-tuning.<n>We demonstrate that ColorWave establishes a new paradigm for structured, color-consistent diffusion-based image synthesis.
  arXiv  Detail & Related papers  (2025-03-12T21:49:52Z)
• Matrix-Valued LogSumExp Approximation for Colour Morphology [0.13124513975412253]
  In this paper we will analyse the construction of a new approach to the concept of supremum and infimum. We will replace the supremum with the LogExp approximation for the maximum instead. In addition, we will investigate the minimality property and specify a relaxation to ensure that our approach is continuously dependent on the input data.
  arXiv  Detail & Related papers  (2024-11-15T12:30:24Z)
• Texture Discrimination via Hilbert Curve Path Based Information Quantifiers [0.0]
  This paper proposes a texture classification method that extracts data from images using the Hilbert curve. Three information theory quantifiers are then computed: permutation entropy, permutation complexity, and Fisher information measure.
  arXiv  Detail & Related papers  (2024-09-06T22:51:54Z)
• An Approach to Colour Morphological Supremum Formation using the LogSumExp Approximation [0.0]
  We present a novel approach to colour morphology extending upon previous work in the field based on the Loewner order. We apply this to the embedding of an RGB image in a field of symmetric $2times2$ matrices.
  arXiv  Detail & Related papers  (2023-12-21T12:32:34Z)
• Neural Color Operators for Sequential Image Retouching [62.99812889713773]
  We propose a novel image retouching method by modeling the retouching process as performing a sequence of newly introduced trainable neural color operators. The neural color operator mimics the behavior of traditional color operators and learns pixelwise color transformation while its strength is controlled by a scalar. Our method consistently achieves the best results compared with SOTA methods in both quantitative measures and visual qualities.
  arXiv  Detail & Related papers  (2022-07-17T05:33:19Z)
• Detecting Recolored Image by Spatial Correlation [60.08643417333974]
  Image recoloring is an emerging editing technique that can manipulate the color values of an image to give it a new style. In this paper, we explore a solution from the perspective of the spatial correlation, which exhibits the generic detection capability for both conventional and deep learning-based recoloring. Our method achieves the state-of-the-art detection accuracy on multiple benchmark datasets and exhibits well generalization for unknown types of recoloring methods.
  arXiv  Detail & Related papers  (2022-04-23T01:54:06Z)
• Multiscale Analysis for Improving Texture Classification [62.226224120400026]
  This paper employs the Gaussian-Laplacian pyramid to treat different spatial frequency bands of a texture separately. We aggregate features extracted from gray and color texture images using bio-inspired texture descriptors, information-theoretic measures, gray-level co-occurrence matrix features, and Haralick statistical features into a single feature vector.
  arXiv  Detail & Related papers  (2022-04-21T01:32:22Z)
• Quaternion Optimized Model with Sparse Regularization for Color Image Recovery [10.137095668835439]
  This paper is inspired by an appreciation of the fact that different signal types, including audio formats and images, possess structures that are inherently sparse in respect of their respective bases. Since color images can be processed as a whole in the quaternion domain, we depicted the sparsity of the color image in the quaternion discrete cosine transform (QDCT) domain. To achieve a more superior low-rank approximation, the quatenrion-based truncated nuclear norm (QTNN) is employed in the proposed model.
  arXiv  Detail & Related papers  (2022-04-19T03:07:12Z)
• Guided Colorization Using Mono-Color Image Pairs [6.729108277517129]
  monochrome images usually have better signal-to-noise ratio (SNR) and richer textures due to its higher quantum efficiency. We propose a mono-color image enhancement algorithm that colorizes the monochrome image with the color one. Experimental results show that, our algorithm can efficiently restore color images with higher SNR and richer details from the mono-color image pairs.
  arXiv  Detail & Related papers  (2021-08-17T07:00:28Z)
• Instance-aware Image Colorization [51.12040118366072]
  In this paper, we propose a method for achieving instance-aware colorization. Our network architecture leverages an off-the-shelf object detector to obtain cropped object images. We use a similar network to extract the full-image features and apply a fusion module to predict the final colors.
  arXiv  Detail & Related papers  (2020-05-21T17:59:23Z)
• Learning to Structure an Image with Few Colors [59.34619548026885]
  We propose a color quantization network, ColorCNN, which learns to structure the images from the classification loss in an end-to-end manner. With only a 1-bit color space (i.e., two colors), the proposed network achieves 82.1% top-1 accuracy on the CIFAR10 dataset. For applications, when encoded with PNG, the proposed color quantization shows superiority over other image compression methods in the extremely low bit-rate regime.
  arXiv  Detail & Related papers  (2020-03-17T17:56:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.