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

Local convergence has emerged as a fundamental tool for analyzing sparse random graph models. We introduce a new notion of local convergence, color convergence, based on the Weisfeiler-Leman algorithm. Color convergence fully characterizes…

The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree…

In this paper, we introduce group convolutional neural networks (GCNNs) equivariant to color variation. GCNNs have been designed for a variety of geometric transformations from 2D and 3D rotation groups, to semi-groups such as scale.…

Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…

A popular method for enhancing images involves learning the style of a professional photo editor using pairs of training images comprised of the original input with the editor-enhanced version. When manipulating images, many editing tools…

We show that the combinatorial matter of graph coloring is, in fact, quantum in the sense of satisfying the sum over all the possible intermediate state properties of a path integral. In our case, the topological field theory (TFT) with…

Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…

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…

We investigate the concept of symmetry and its role in problem solving. This paper first defines precisely the elements that constitute a "problem" and its "solution," and gives several examples to illustrate these definitions. Given…

Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over…

A three-polar, cf. T. Gregor, J. Halu\v{s}ka, Lexicographical ordering and field operations in the complex plane. Stud. Mat. 41(2014), 123--133., $HSV-RGB$ Colour space $\triangle$ was introduced and studied. It was equipped with operations…

The chromaticity diagram associated with the CIE 1931 color matching functions is shown to be slightly non-convex. While having no impact on practical colorimetric computations, the non-convexity does have a significant impact on the shape…

We suggest a new color distance based on two observations. First, perceptual color differences were designed to be used to compare very similar colors. They do not capture human perception for medium and large color differences well.…

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…

We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by…

We present a simple primary colour editing method for consumer product images. We show that by using colour correction and colour blending, we can automate the pain-staking colour editing task and save time for consumer colour preference…

Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric symmetries in a drawing. In this paper, we design and…

Szlam's Lemma began life as a way of getting upper bounds on the chromatic numbers of distance graphs in normed vector spaces. Now analogs are available in a variety of hypergraph settings, but the method always involves a shrewdly chosen…

A red-white coloring of a nontrivial connected graph $G$ is an assignment of red and white colors to the vertices of~$G$. Associated with each vertex $v$ of $G$ of diameter $d$ is a $d$-vector, called the code of $v$, whose $i$th coordinate…

Image composition in image editing involves merging a foreground image with a background image to create a composite. Inconsistent lighting conditions between the foreground and background often result in unrealistic composites. Image…