相关论文: An incomplete taxonomy of self-assigned color spec…

The majority of existing color naming methods focuses on the eleven basic color terms of the English language. However, in many applications, different sets of color names are used for the accurate description of objects. Labeling data to…

Image colorization estimates RGB colors for grayscale images or video frames to improve their aesthetic and perceptual quality. Over the last decade, deep learning techniques for image colorization have significantly progressed,…

Color serves as a fundamental dimension of human visual perception and a primary means of communicating about objects and scenes. As vision-language models (VLMs) become increasingly prevalent, understanding whether they name colors like…

-This paper presents a semi automatic method used to segment color documents into different uniform color plans. The practical application is dedicated to administrative documents segmentation. In these documents, like in many other cases,…

We study screening of optical singularities in random optical fields with two widely different length scales. We call the speckle patterns generated by such fields speckled speckle, because the major speckle spots in the pattern are…

Measuring the colorfulness of a natural or virtual scene is critical for many applications in image processing field ranging from capturing to display. In this paper, we propose the first deep learning-based colorfulness estimation metric.…

Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex…

The list coloring problem is a variant of vertex coloring where a vertex may be colored only a color from a prescribed set. Several applications of vertex coloring are more appropriately modelled as instances of list coloring and thus we…

A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding…

Colour vision has long fascinated scientists, who have sought to understand both the physiology of the mechanics of colour vision and the psychophysics of colour perception. We consider representations of colour in anatomically constrained…

Optical singularities, which are positions within an electromagnetic field where certain field parameters become undefined, hold significant potential for applications in areas such as super-resolution microscopy, sensing, and…

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…

We consider the problem of finding a color scale which performs well when converted to a grayscale. We assume that each color is converted to a shade of gray with the same intensity as the color. We also assume that the color scales have a…

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…

There has been quite some activity and progress concerning spectral asymptotics of random operators that are defined on percolation subgraphs of different types of graphs. In this short survey we record some of these results and explain the…

In the field of scientometrics, the subject classification system of academic journals holds great importance. Accurate identification and classification of "multidisciplinary" journals are crucial in revealing the scientific structure and…

Teaching color science to Electrical Engineering and Computer Science (EECS) students is critical to preparing them for advanced topics such as graphics, visualization, imaging, Augmented/Virtual Reality. Color historically receive little…

In any computer vision task involving color images, a necessary step is classifying pixels according to color and segmenting the respective areas. However, the development of methods able to successfully complete this task has proven…

While many image colorization algorithms have recently shown the capability of producing plausible color versions from gray-scale photographs, they still suffer from the problems of context confusion and edge color bleeding. To address…