Related papers: Color Perception: Opening up the Chromaticity Cone
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…
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…
In this note, a novel BCS-type formalism is constructed in the framework of a schematic QCD inspired quark model, having in mind the description of color symmetrical superconducting states. The physical properties of the BCS vacuum (average…
Color intensity projections (CIP) have been shown to improve the visualisation of greyscale angiography images by combining greyscale images into a single color image. A key property of the combined CIP image is the encoding of the arrival…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
We address problems associated with compactification near and on the light front. In perturbative scalar field theory we illustrate and clarify the relationships among three approaches: (1) quantization on a space-like surface close to a…
Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q, we can quickly identify the smallest color spanning object…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
We show that many topological and geometrical properties of complex projective space can be understood just by looking at a suitably constructed picture. The idea is to view CP^n as a set of flat tori parametrized by the positive octant of…
Fix a graph $G$ in which every edge is colored in some of $k\ge 2$ colors. Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected using any subset of $k - 1$ colors. CA-connectivity is an equivalence relation dividing the…
Light passing through scattering media will be strongly scattered and diffused into complex speckle pattern, which however contains almost all the spatial information and color information of the objects. Although various technologies have…
Color centers are versatile systems that generate quantum light, sense magnetic fields and produce spin-photon entanglement. We review how these properties have pushed the limits of fundamental knowledge in a variety of scientific…
In this paper, we investigate the strength of chromatic symmetric homology as a graph invariant. Chromatic symmetric homology is a lift of the chromatic symmetric function for graphs to a homological setting, and its Frobenius…
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…
We experimentally demonstrate the nonclassical photon number correlations expected in tripartite continuous variable states obtained by parametric processes. Our scheme involves a single nonlinear crystal, where two interlinked parametric…
Color transparency (CT) is an effect of suppression of nuclear shadowing of hard reactions, closely related to the color screening. A brief review of theoretical development and experimental search for CT, failed and successful, are…
In this paper we study the excitation spectrum of single- and multi-layer graphene beyond the Dirac cone approximation. The dynamical polarizability of graphene is computed using a full $\pi$-band tight-binding model, considering the…
Dual-energy computed tomography (CT) is to reconstruct images of an object from two projection datasets generated from two distinct x-ray source energy spectra. It can provide more accurate attenuation quantification than conventional CT…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
Understanding how humans perceive visual complexity is a key area of study in visual cognition. Previous approaches to modeling visual complexity assessments have often resulted in intricate, difficult-to-interpret algorithms that employ…