相关论文: Wrong Colored Vermeer: Color-Symmetric Image Disto…

It is proved that 1) the indicator function of some onefold or multifold independent set in a regular graph is a perfect coloring if and only if the set attain the Delsarte--Hoffman bound; 2) each transversal in a uniform regular hypergraph…

In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…

We introduce the concept of a fiber bundle color space, which acts according to the psychophysiological rules of trichromacy perception of colors by a human. The image resides in the fiber bundle base space and the fiber color space…

In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored…

\noindent In our contribution to this volume we deal with \emph{discrete} symmetries: these are symmetries based upon groups with a discrete set of elements (generally a set of elements that can be enumerated by the positive integers). In…

It is argued that a dual symmetry is needed to naturally explain experimental limits on color confinement. Since color is an exact symmetry the only possibility is that this symmetry be a dual symmetry, related to non trivial spatial…

One method to obtain a proper vertex coloring of graphs using a reasonable number of colors is to start from any arbitrary proper coloring and then repeat some local re-coloring techniques to reduce the number of color classes. The Grundy…

A symmetrical model of color vision, the decoding model as a new version of zone model, was introduced. The model adopts new continuous-valued logic and works in a way very similar to the way a 3-8 decoder in a numerical circuit works. By…

Arslan, Altoum, and Zaarour introduced an inversion statistic for generalized symmetric groups. In this work, we study the distribution of this statistic over colored permutations, including derangements and involutions. By establishing a…

A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges…

Image colorization is the process of colorizing grayscale images or recoloring an already-color image. This image manipulation can be used for grayscale satellite, medical and historical images making them more expressive. With the help of…

Advances in multimodal characterization methods fuel a generation of increasing immense hyper-dimensional datasets. Color mapping is employed for conveying higher dimensional data in two-dimensional (2D) representations for human…

This note presents an extension to the neural artistic style transfer algorithm (Gatys et al.). The original algorithm transforms an image to have the style of another given image. For example, a photograph can be transformed to have the…

Color transfer between images uses the statistics information of image effectively. We present a novel approach of local color transfer between images based on the simple statistics and locally linear embedding. A sketching interface is…

In trichromats, color vision entails the projection of an infinite-dimensional space (the one containing all possible electromagnetic power spectra) onto the 3-dimensional space that modulates the activity of the three types of cones. This…

Modeling subtractive color mixture (e.g., the way that paints mix) is difficult when working with colors described only by three-dimensional color space values, such as RGB. Although RGB values are sufficient to describe a specific color…

We explain how deformation theories of geometric objects such as complex structures, Poisson structures and holomorphic bundle structures lead to differential Gerstenhaber or Poisson algebras. We use homological perturbation theory to…

Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must…

Image vectorization is a process to convert a raster image into a scalable vector graphic format. Objective is to effectively remove the pixelization effect while representing boundaries of image by scaleable parameterized curves. We…

Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…