相关论文: Color Homography

The Luther condition states that if the spectral sensitivity responses of a camera are a linear transform from the color matching functions of the human visual system, the camera is colorimetric. Previous work proposed to solve for a filter…

We study the approximability of an existing framework for clustering edge-colored hypergraphs, which is closely related to chromatic correlation clustering and is motivated by machine learning and data mining applications where the goal is…

A beam of light, reflected at a planar interface, does not follow perfectly the ray optics prediction. Diffractive corrections lead to beam shifts; either the reflected beam is displaced (spatial shift) and/or travels in a different…

A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…

Hyperspectral imaging aims at providing information on both the spatial and the spectral distribution of light, with high resolution. However, state-of-the-art protocols are characterized by an intrinsic trade-off imposing to sacrifice…

Image forensics, aiming to ensure the authenticity of the image, has made great progress in dealing with common image manipulation such as copy-move, splicing, and inpainting in the past decades. However, only a few researchers pay…

We present the Colorization Transformer, a novel approach for diverse high fidelity image colorization based on self-attention. Given a grayscale image, the colorization proceeds in three steps. We first use a conditional autoregressive…

In this paper, we investigate the effect of color space selection on detectability and discriminability of colored objects under various conditions. 20 color spaces from the literature are evaluated on a large dataset of simulated and real…

In this paper we address the problem of matching two images with two different resolutions: a high-resolution image and a low-resolution one. The difference in resolution between the two images is not known and without loss of generality…

Local features e.g. SIFT and its affine and learned variants provide region-to-region rather than point-to-point correspondences. This has recently been exploited to create new minimal solvers for classical problems such as homography,…

Advances in multimodal characterization methods fuel a generation of increasing immense hyper-dimensional datasets. Color mapping is employed for conveying higher dimensional data in two-dimensional (2D) representations for human…

Color symmetry implies that the colors of geometrical objects are assigned according to their symmetry properties. It is defined by associating the elements of the symmetry group with a color permutation. I use this concept for generative…

Two systems are homometric if they are indistinguishable by diffraction. We first make a distinction between Bragg and diffuse scattering homometry, and show that in the last case, coherent diffraction can allow the diffraction diagrams to…

Projection mapping (PM) is a technique that enhances the appearance of real-world surfaces using projected images, enabling multiple people to view augmentations simultaneously, thereby facilitating communication and collaboration. However,…

Image prediction methods often struggle on tasks that require changing the positions of objects, such as video prediction, producing blurry images that average over the many positions that objects might occupy. In this paper, we propose a…

Ptychography is a technique widely used in microscopy for achieving high-resolution imaging. This method relies on computational processing of images gathered from diffraction patterns produced by several partial illuminations of a sample.…

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…

The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investigate the asymmetric coloring number of graphs that are…

We present an algorithm for holographic shaping of partially coherent light, bridging the gap between traditional coherent and geometric optical approaches. The description of partially coherent light relies on a mode expansion formalism,…

The human tri-color vision process may be characterized as follows: 1. A requirement of three scalar quantities to fully define a color (for example, intensity, hue, and purity), with 2. These scalar measures linear in the intensity of the…