Fuzzy color model and clustering algorithm for color clustering problem

• URL: http://arxiv.org/abs/2407.06782v1
• Date: Tue, 9 Jul 2024 11:53:54 GMT
• Title: Fuzzy color model and clustering algorithm for color clustering problem
• Authors: Dae-Won Kim, Kwang H. Lee,
• Abstract summary: We have tried to model the inherent uncertainty and vagueness of color data using fuzzy color model. With the fuzzy color model, we developed a new fuzzy clustering algorithm for an efficient partition of color data.
• Score: 2.002741592555996
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The research interest of this paper is focused on the efficient clustering task for an arbitrary color data. In order to tackle this problem, we have tried to model the inherent uncertainty and vagueness of color data using fuzzy color model. By taking fuzzy approach to color modeling, we could make a soft decision for the vague regions between neighboring colors. The proposed fuzzy color model defined a three dimensional fuzzy color ball and color membership computation method with two inter-color distances. With the fuzzy color model, we developed a new fuzzy clustering algorithm for an efficient partition of color data. Each fuzzy cluster set has a cluster prototype which is represented by fuzzy color centroid.

Related papers

• On selection of centroids of fuzzy clusters for color classification [2.002741592555996]
  A novel fuzzy c-means algorithm is proposed for the color clustering problem. The proposed algorithm extracts dominant colors that are the most vivid and distinguishable colors. To obtain the dominant colors and their closest color points, we introduce reference colors and define a fuzzy membership model.
  arXiv  Detail & Related papers  (2024-07-09T11:59:31Z)
• Control Color: Multimodal Diffusion-based Interactive Image Colorization [81.68817300796644]
  Control Color (Ctrl Color) is a multi-modal colorization method that leverages the pre-trained Stable Diffusion (SD) model. We present an effective way to encode user strokes to enable precise local color manipulation. We also introduce a novel module based on self-attention and a content-guided deformable autoencoder to address the long-standing issues of color overflow and inaccurate coloring.
  arXiv  Detail & Related papers  (2024-02-16T17:51:13Z)
• UniGS: Unified Representation for Image Generation and Segmentation [105.08152635402858]
  We use a colormap to represent entity-level masks, addressing the challenge of varying entity numbers. Two novel modules, including the location-aware color palette and progressive dichotomy module, are proposed to support our mask representation.
  arXiv  Detail & Related papers  (2023-12-04T15:59:27Z)
• DARC: Distribution-Aware Re-Coloring Model for Generalizable Nucleus Segmentation [68.43628183890007]
  We argue that domain gaps can also be caused by different foreground (nucleus)-background ratios. First, we introduce a re-coloring method that relieves dramatic image color variations between different domains. Second, we propose a new instance normalization method that is robust to the variation in the foreground-background ratios.
  arXiv  Detail & Related papers  (2023-09-01T01:01:13Z)
• Hybrid Fuzzy-Crisp Clustering Algorithm: Theory and Experiments [0.0]
  We propose a hybrid fuzzy-crisp clustering algorithm based on a target function combining linear and quadratic terms of the membership function. In this algorithm, the membership of a data point to a cluster is automatically set to exactly zero if the data point is sufficiently'' far from the cluster center. The proposed algorithm is demonstrated to outperform the conventional methods on imbalanced datasets and can be competitive on more balanced datasets.
  arXiv  Detail & Related papers  (2023-03-25T05:27:26Z)
• Research on Efficient Fuzzy Clustering Method Based on Local Fuzzy Granular balls [67.33923111887933]
  In this paper, the data is fuzzy iterated using granular-balls, and the membership degree of data only considers the two granular-balls where it is located. The formed fuzzy granular-balls set can use more processing methods in the face of different data scenarios.
  arXiv  Detail & Related papers  (2023-03-07T01:52:55Z)
• BiSTNet: Semantic Image Prior Guided Bidirectional Temporal Feature Fusion for Deep Exemplar-based Video Colorization [70.14893481468525]
  We present an effective BiSTNet to explore colors of reference exemplars and utilize them to help video colorization. We first establish the semantic correspondence between each frame and the reference exemplars in deep feature space to explore color information from reference exemplars. We develop a mixed expert block to extract semantic information for modeling the object boundaries of frames so that the semantic image prior can better guide the colorization process.
  arXiv  Detail & Related papers  (2022-12-05T13:47:15Z)
• Color Counting for Fashion, Art, and Design [0.0]
  First step in color modelling is to estimate the number of colors in the item / object. We propose a novel color counting method based on cumulative color histogram. This work is the first of its kind that addresses the problem of color-counting machine.
  arXiv  Detail & Related papers  (2021-10-13T12:42:15Z)
• Color-complexity enabled exhaustive color-dots identification and spatial patterns testing in images [0.6299766708197881]
  We develop a new color-identification algorithm based on highly associative relations among the three color-coordinates: RGB or HSV. Our developments are illustrated in images obtained by mimicking chemical spraying via drone in Precision Agriculture.
  arXiv  Detail & Related papers  (2020-07-28T21:06:12Z)
• 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)
• Fair Correlation Clustering [18.00619071013106]
  We consider two variations of fairness constraint for the problem of correlation clustering where each node has a color. We show the effectiveness of our algorithm to generate fair clusters by empirical evaluation on real world data sets.
  arXiv  Detail & Related papers  (2020-02-10T02:59:17Z)

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.