Related papers: Analytical Equations to the Chromaticity Cone: Alg…
Although it seems counter-intuitive, categorical colours do not exist as external physical entities but are very much the product of our brains. Our cortical machinery segments the world and associate objects to specific colour terms, which…
To interpret the meanings of colors in visualizations of categorical information, people must determine how distinct colors correspond to different concepts. This process is easier when assignments between colors and concepts in…
Chromatic effects are usually associated with refractive optics, so reflective telescopes are assumed to be free from them. We show that all-reflective optics still bears significant levels of such perturbations, which is especially…
Both the higher energy and the initial state colored partons contribute to making exact calculations in QCD color space more important at the LHC than at its predecessors. This is applicable whether the method of assessing QCD is fixed…
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two currently known algorithms for verifying c-colourability of graphs…
This paper takes an information visualization perspective to visual representations in the general SOM paradigm. This involves viewing SOM-based visualizations through the eyes of Bertin's and Tufte's theories on data graphics. The regular…
We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…
Aspects of the theory of characteristic modes, based on their variational formulation, are presented and an explicit form of a related functional, involving only currents in a spatial domain, is derived. The new formulation leads to deeper…
In this work recent advances in conditional adversarial networks are investigated to develop an end-to-end architecture based on Convolutional Neural Networks (CNNs) to directly map realistic colours to an input greyscale image. Observing…
A method for the determination of the projection geometry of highly magnifying cone beam micro computed tomography systems based on few rotating fiducial markers of unknown position within the field of view is derived. By employing the…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
Recently, Van Hoeve proposed an algorithm for graph coloring based on an integer flow formulation on decision diagrams for stable sets. We prove that the solution to the linear flow relaxation on exact decision diagrams determines the…
We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…
This paper shows how a recent reformulation of the basics of classical geometry and trigonometry reveals a three-fold symmetry between Euclidean and non-Euclidean (relativistic) planar geometries. We apply this chromogeometry to look at…
Color transparency is a prediction of perturbative QCD. Yet detailed calculations have been lacking, and aspects of the required factorization have been controversial. We report on the first complete calculations entirely within a…
We apply the Lie algebraic method to reflecting optical systems with plane-symmetric freeform mirrors. Using analytical ray-tracing equations we construct an optical map. The expansion of this map gives us the aberration coefficients in…
In this paper, we propose a numerical strategy to define a multiscale analysis for color and multicomponent images based on the representation of data on a graph. Our approach consists in computing the graph of an image using the…
Edge-coloring problems with forbidden patterns are decision problems asking to find an edge-coloring of the input graph which avoids a homomorphism from a fixed forbidden family of edge-colored graphs. In the precolored version of these…
Deep networks have shown impressive performance in the image restoration tasks, such as image colorization. However, we find that previous approaches rely on the digital representation from single color model with a specific mapping…
A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. The model is called RCOP if this coloring is given by the edge and vertex…