Related papers: Analytical Equations to the Chromaticity Cone: Alg…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
Image colorization is a well-known problem in computer vision. However, due to the ill-posed nature of the task, image colorization is inherently challenging. Though several attempts have been made by researchers to make the colorization…
Many colour maps provided by vendors have highly uneven perceptual contrast over their range. It is not uncommon for colour maps to have perceptual flat spots that can hide a feature as large as one tenth of the total data range. Colour…
We present an index structure, called the color-index, to boost the evaluation of acyclic conjunctive queries (ACQs) over binary schemas. The color-index is based on the color refinement algorithm, a widely used subroutine for graph…
Computational Colour Constancy (CCC) consists of estimating the colour of one or more illuminants in a scene and using them to remove unwanted chromatic distortions. Much research has focused on illuminant estimation for CCC on single…
Homographies -- a mathematical formalism for relating image points across different camera viewpoints -- are at the foundations of geometric methods in computer vision and are used in geometric camera calibration, image registration, and…
Various simulation methods of color appearance for dichromats or anomalous trichromats have been proposed over the years. To further improve the performance of the simulation model and extend the application range to both dichromats or…
In this paper, we show that a simple coloring scheme can improve, both theoretically and empirically, the expressive power of Message Passing Neural Networks(MPNNs). More specifically, we introduce a graph neural network called Colored…
An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Meta-optics have rapidly become a major research field within the optics and photonics community, strongly driven by the seemingly limitless opportunities made possible by controlling optical wavefronts through interaction with arrays of…
A new scheme has been proposed to solve the B.E. condenstates in terms of Green's function approach. It has been shown that the radial wave function of two interacting atoms, moving in a common harmonic oscillator potential modified by an…
Graph workloads pose a particularly challenging problem for query optimizers. They typically feature large queries made up of entirely many-to-many joins with complex correlations. This puts significant stress on traditional cardinality…
Color Appearance Models are biological networks that consist of a cascade of linear+nonlinear layers that modify the linear measurements at the retinal photo-receptors leading to an internal (nonlinear) representation of color that…
We study a class of edge-coloured graphs, including the chamber systems of buildings and other geometries such as affine planes, from which we build coherent configurations (also known as non-commutative association schemes). The condition…
Geometric representations of cycles in quandle homology theory are given in terms of colored knot diagrams. Abstract knot diagrams are generalized to diagrams with exceptional points which, when colored, correspond to degenerate cycles.…
The chromatic number related to a colouring of facets of certain classes of generalised associahedra is studied. The exact values are obtained for permutohedra, associahedra and simple permutoassociahedra, while lower and upper bounds are…
Representations of color Hom-Lie algebras are reviewed, and it is shown that there exist a series of coboundary operators. We also introduce the notion of a color omni-Hom-Lie algebra associated to a vector space and an even invertible…
Intrinsic image decomposition is a severely under-constrained problem. User interactions can help to reduce the ambiguity of the decomposition considerably. The traditional way of user interaction is to draw scribbles that indicate regions…
This paper presents an algorithm that transforms color visual images, like photographs or paintings, into tactile graphics. In the algorithm, the edges of objects are detected and colors of the objects are estimated. Then, the edges and the…