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

Image inpainting is the task of reconstructing missing or damaged parts of an image in a way that seamlessly blends with the surrounding content. With the advent of advanced generative models, especially diffusion models and generative…

Light interreflections occurring in a concave object generate a color gradient which is characteristic of the object's spectral reflectance. In this paper, we use this property in order to estimate the spectral reflectance of matte,…

We present a method for compositing virtual objects into a photograph such that the object colors appear to have been processed by the photo's camera imaging pipeline. Compositing in such a camera-aware manner is essential for high realism,…

A result of Spencer states that every collection of $n$ sets over a universe of size $n$ has a coloring of the ground set with $\{-1,+1\}$ of discrepancy $O(\sqrt{n})$. A geometric generalization of this result was given by Gluskin (see…

Let $G = (V,E)$ be a finite simple graph. Recall that a proper coloring of $G$ is a mapping $\varphi: V\to\{1,\ldots,k\}$ such that every color class induces an independent set. Such a $\varphi$ is called a semi-matching coloring if the…

Symmetries are a key concept to connect mathematical elegance with physical insight. We consider measurement assemblages in quantum mechanics and show how their symmetry can be described by means of the so-called discrete bundles. It turns…

Color theme or color palette can deeply influence the quality and the feeling of a photograph or a graphical design. Although color palettes may come from different sources such as online crowd-sourcing, photographs and graphical designs,…

Image inpainting is the task of filling-in missing regions of a damaged or incomplete image. In this work we tackle this problem not only by using the available visual data but also by incorporating image semantics through the use of…

People's associations between colors and concepts influence their ability to interpret the meanings of colors in information visualizations. Previous work has suggested such effects are limited to concepts that have strong, specific…

Color Refinement, also known as Naive Vertex Classification, is a classical method to distinguish graphs by iteratively computing a coloring of their vertices. While it is mainly used as an imperfect way to test for isomorphism, the…

The project has carried out the re-optimization of image coloring in accordance with the existing Autocolorization direction model DDColor. For the experiments on the existing weights of DDColor, we found that it has limitations in some…

Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

We state a number of related questions on the structure of perfect matchings. Those questions are inspired by and directly connected to Quantum Physics. In particular, they concern the constructability of general quantum states using modern…

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…

A constrained colouring or, more specifically, an $(\alpha,\beta)$-colouring of a hypergraph $H$, is an assignment of colours to its vertices such that no edge of $H$ contains less than $\alpha$ or more than $\beta$ vertices with different…

Graph colorings is a fundamental topic in graph theory that require an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring…

This paper tests the ability of a machine vision system with a monochrome camera to differentiate colored objects. The system is designed to autonomously and continuously sort colored objects of which the user specifies the desired…

We prove a homological stability theorem for certain complements of symmetric spaces. This is a variant of a conjecture by Vakil and Matchett Wood for subspaces of $\mathrm{Sym}^n(X)$ where $X$ is an open manifold admitting a boundary. To…

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The…