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

Symmetry in biological and physical systems is a product of self organization driven by evolutionary processes, or mechanical systems under constraints. Symmetry based feature extrac-tion or representation by neural networks may unravel the…

The distortion varieties of a given projective variety are parametrized by duplicating coordinates and multiplying them with monomials. We study their degrees and defining equations. Exact formulas are obtained for the case of one-parameter…

One considers certain degenerations of the generic symmetric matrix over a field $k$ of characteristic zero and the main structures related to the determinant $f$ of the matrix, such as the ideal generated by its partial derivatives, the…

By introducing various actions involving color to geometrical objects, we represent a cube and simplex in four or fewer dimensions, the geometrical net of a cube and simplex in five or fewer dimensions, hyperprisms, truncated polytopes,…

Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive the laws of special relativity. In artificial intelligence, symmetry has…

The main feature of color Hom-algebras is that the identities defining the structures are twisted by even linear maps. The purpose of this paper is to introduce and give some constructions of admissible Hom-Novikov-Poisson color…

The classical Weisfeiler-Leman algorithm aka color refinement is fundamental for graph learning with kernels and neural networks. Originally developed for graph isomorphism testing, the algorithm iteratively refines vertex colors. On many…

Fr\'ed\'eric Meunier's question about a multicolored Sperner lemma is addressed, leaving the question of connectivity for the color hypergraphs of such a multicolored simplex. Sperner's lemma asserts the existence of a simplex using all the…

Despite nearly a decade of literature on style transfer, there is no undisputed definition of artistic style. State-of-the-art models produce impressive results but are difficult to interpret since, without a coherent definition of style,…

A harmonious coloring of a $k$-uniform hypergraph $H$ is a vertex coloring such that no two vertices in the same edge have the same color, and each $k$-element subset of colors appears on at most one edge. The harmonious number $h(H)$ is…

We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.

In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

A pseudoscopic (inverted depth) image made with spiral diffracting elements intermediated by a pinhole is explained by its symmetry properties. The whole process is made under common white light illumination and allows the projection of…

Using a new colored analogue of P-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algebra. This algebra has a basis consisting of formal sums of colored permutations…

Color propagation aims to extend local color edits to similar regions across the input image. Conventional approaches often rely on low-level visual cues such as color, texture, or lightness to measure pixel similarity, making it difficult…

The goal of computational color constancy is to preserve the perceptive colors of objects under different lighting conditions by removing the effect of color casts caused by the scene's illumination. With the rapid development of deep…

We propose a new algorithm for color transfer between images that have perceptually similar semantic structures. We aim to achieve a more accurate color transfer that leverages semantically-meaningful dense correspondence between images. To…

A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is…

A definition is given of seriate sets as being sets constituted out of structured collections of objects which are recursively internally self- similar. Fundamental (geometrical) objects of Dimension N are conceived to be constituted out of…