CARDIE: clustering algorithm on relevant descriptors for image enhancement

• URL: http://arxiv.org/abs/2509.06116v1
• Date: Sun, 07 Sep 2025 15:55:55 GMT
• Title: CARDIE: clustering algorithm on relevant descriptors for image enhancement
• Authors: Giulia Bonino, Luca Alberto Rizzo,
• Abstract summary: CARDIE is an unsupervised algorithm that clusters images based on their color and luminosity content.<n>We demonstrate that CARDIE produces clusters more relevant to image enhancement than those derived from semantic image attributes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Automatic image clustering is a cornerstone of computer vision, yet its application to image enhancement remains limited, primarily due to the difficulty of defining clusters that are meaningful for this specific task. To address this issue, we introduce CARDIE, an unsupervised algorithm that clusters images based on their color and luminosity content. In addition, we introduce a method to quantify the impact of image enhancement algorithms on luminance distribution and local variance. Using this method, we demonstrate that CARDIE produces clusters more relevant to image enhancement than those derived from semantic image attributes. Furthermore, we demonstrate that CARDIE clusters can be leveraged to resample image enhancement datasets, leading to improved performance for tone mapping and denoising algorithms. To encourage adoption and ensure reproducibility, we publicly release CARDIE code on our GitHub.

Related papers

• Hierarchical Semantic Alignment for Image Clustering [59.277605709780524]
  We propose a hierarChical semAntic alignmEnt method for image clustering, dubbed CAE, which improves cluster- ing performance in a training-free manner.<n>We first select relevant nouns from WordNet and descriptions from caption datasets to construct a semantic space aligned with image features.<n>Then, we align image features with selected nouns and captions via optimal transport to obtain a more discriminative semantic space.
  arXiv  Detail & Related papers  (2025-11-30T14:14:51Z)
• Self-Enhanced Image Clustering with Cross-Modal Semantic Consistency [57.961869351897384]
  We propose a framework based on cross-modal semantic consistency for efficient image clustering.<n>Our framework first builds a strong foundation via Cross-Modal Semantic Consistency.<n>In the first stage, we train lightweight clustering heads to align with the rich semantics of the pre-trained model.<n>In the second stage, we introduce a Self-Enhanced fine-tuning strategy.
  arXiv  Detail & Related papers  (2025-08-02T08:12:57Z)
• Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering [59.24638672786966]
  Hyperspectral image (HSI) clustering assigns similar pixels to the same class without any annotations.<n>Existing graph neural networks (GNNs) cannot fully exploit the spectral information of the input HSI.<n>We propose a structural-spectral graph convolutional operator (SSGCO) tailored for graph-structured HSI superpixels.
  arXiv  Detail & Related papers  (2025-06-11T16:41:34Z)
• Dual Advancement of Representation Learning and Clustering for Sparse and Noisy Images [14.836487514037994]
  Sparse and noisy images (SNIs) pose significant challenges for effective representation learning and clustering. We propose Dual Advancement of Representation Learning and Clustering (DARLC) to enhance the representations derived from masked image modeling. Our framework offers a comprehensive approach that improves the learning of representations by enhancing their local perceptibility, distinctiveness, and the understanding of relational semantics.
  arXiv  Detail & Related papers  (2024-09-03T10:52:27Z)
• Local Clustering for Lung Cancer Image Classification via Sparse Solution Technique [1.07793546088014]
  We view images as the vertices in a weighted graph and the similarity between a pair of images as the edges in the graph.<n>Our approach is significantly more efficient and either favorable or equally effective compared with other state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-07-11T18:18:32Z)
• Active Generation for Image Classification [45.93535669217115]
  We propose to address the efficiency of image generation by focusing on the specific needs and characteristics of the model. With a central tenet of active learning, our method, named ActGen, takes a training-aware approach to image generation.
  arXiv  Detail & Related papers  (2024-03-11T08:45:31Z)
• Grid Jigsaw Representation with CLIP: A New Perspective on Image Clustering [33.05984601411495]
  We propose a new perspective on image clustering, the pretrain-based Grid Jigsaw Representation (pGJR)<n>Inspired by human jigsaw puzzle processing, we modify the traditional jigsaw learning to gain a more sequential and incremental understanding of image structure.<n>Our experiments demonstrate that using the pretrained model as a feature extractor can accelerate the convergence of clustering.
  arXiv  Detail & Related papers  (2023-10-27T03:07:05Z)
• Image as Set of Points [60.30495338399321]
  Context clusters (CoCs) view an image as a set of unorganized points and extract features via simplified clustering algorithm. Our CoCs are convolution- and attention-free, and only rely on clustering algorithm for spatial interaction.
  arXiv  Detail & Related papers  (2023-03-02T18:56:39Z)
• Semantic-Enhanced Image Clustering [6.218389227248297]
  We propose to investigate the task of image clustering with the help of a visual-language pre-training model. How to map images to a proper semantic space and how to cluster images from both image and semantic spaces are two key problems. We propose a method to map the given images to a proper semantic space first and efficient methods to generate pseudo-labels according to the relationships between images and semantics.
  arXiv  Detail & Related papers  (2022-08-21T09:04:21Z)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)
• Unsupervised Person Re-identification via Softened Similarity Learning [122.70472387837542]
  Person re-identification (re-ID) is an important topic in computer vision. This paper studies the unsupervised setting of re-ID, which does not require any labeled information. Experiments on two image-based and video-based datasets demonstrate state-of-the-art performance.
  arXiv  Detail & Related papers  (2020-04-07T17:16:41Z)

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.