中文
相关论文

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

200 篇论文

Targeted color-dots with varying shapes and sizes in images are first exhaustively identified, and then their multiscale 2D geometric patterns are extracted for testing spatial uniformness in a progressive fashion. Based on color theory in…

计算机视觉与模式识别 · 计算机科学 2021-06-09 Shuting Liao , Li-Yu Liu , Ting-An Chen , Kuang-Yu Chen , Fushing Hsieh

Underwater vision suffers from severe effects due to selective attenuation and scattering when light propagates through water. Such degradation not only affects the quality of underwater images but limits the ability of vision tasks.…

计算机视觉与模式识别 · 计算机科学 2018-01-16 Chongyi Li , Jichang Guo , Chunle Guo

When images are statistically described by a generative model we can use this information to develop optimum techniques for various image restoration problems as inpainting, super-resolution, image coloring, generative model inversion, etc.…

图像与视频处理 · 电气工程与系统科学 2020-06-17 Kalliopi Basioti , George V. Moustakides

We survey some principal results and open problems related to colorings of geometric and algebraic objects endowed with symmetries, concentrating the exposition on the maximal symmetry numbers of such objects.

组合数学 · 数学 2011-11-07 Taras Banakh

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

组合数学 · 数学 2010-11-18 Matthias Beck , Benjamin Braun

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

群论 · 数学 2021-11-16 Laszlo Babai

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

组合数学 · 数学 2020-07-21 Florian Lehner , Monika Pilśniak , Marcin Stawiski

A vertex colouring of a given graph $G$ can be considered as a random experiment. A discrete random variable $X$, corresponding to this random experiment, can be defined as the colour of a randomly chosen vertex of $G$ and a probability…

综合数学 · 数学 2017-07-04 N. K. Sudev , K. P. Chithra , Johan Kok

In gravitational lensing the average colors of the images are not identical to the average color of the source. The highly non-linear mapping of gravitational lensing does not preserve the color balance of the source, and this mapping is…

宇宙学与河外天体物理 · 物理学 2015-03-17 C. Alard

Symmetry is one of the significant visual properties inside an image plane, to identify the geometrically balanced structures through real-world objects. Existing symmetry detection methods rely on descriptors of the local image features…

计算机视觉与模式识别 · 计算机科学 2017-07-25 Mohamed Elawady , Christophe Ducottet , Olivier Alata , Cecile Barat , Philippe Colantoni

The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…

度量几何 · 数学 2009-02-23 Uwe Grimm , Michael Baake

Our sensory systems transform external signals into neural activity, thereby producing percepts. We are endowed with an intuitive notion of similarity between percepts, that need not reflect the proximity of the physical properties of the…

神经元与认知 · 定量生物学 2023-06-22 Nicolás Vattuone , Thomas Wachtler , Inés Samengo

Dominator coloring of a graph is a proper (vertex) coloring with the property that every vertex is either alone in its color class or adjacent to all vertices of at least one color class. A dominated coloring of a graph is a proper coloring…

组合数学 · 数学 2020-02-19 Sandi Klavžar , Mostafa Tavakoli

Let $G=G(n,m)$ be a random graph whose average degree $d=2m/n$ is below the $k$-colorability threshold. If we sample a $k$-coloring $\sigma$ of $G$ uniformly at random, what can we say about the correlations between the colors assigned to…

组合数学 · 数学 2015-01-27 Amin Coja-Oghlan , Charilaos Efthymiou , Nor Jaafari

Symmetry is an important composition feature by investigating similar sides inside an image plane. It has a crucial effect to recognize man-made or nature objects within the universe. Recent symmetry detection approaches used a smoothing…

计算机视觉与模式识别 · 计算机科学 2017-04-24 Mohamed Elawady , Olivier Alata , Christophe Ducottet , Cecile Barat , Philippe Colantoni

We use methods from Riemann geometry to investigate transformations between the color spaces of color-normal and color weak observers. The two main applications are the simulation of the perception of a color weak observer for a color…

计算机视觉与模式识别 · 计算机科学 2016-05-04 Satoshi Oshima , Rica Mochizuki , Reiner Lenz , Jinhui Chao

Symmetry is conventionally described in a contrariety manner that the system is either completely symmetric or completely asymmetric. Using group theoretical approach to overcome this dichotomous problem, we introduce the degree of symmetry…

量子物理 · 物理学 2016-05-04 Y. N. Fang , G. H. Dong , D. L. Zhou , C. P. Sun

In recent years, text-driven image editing has made significant progress. However, due to the inherent ambiguity and discreteness of natural language, color editing still faces challenges such as insufficient precision and difficulty in…

计算机视觉与模式识别 · 计算机科学 2025-09-18 Yuqi Yang , Dongliang Chang , Yuanchen Fang , Yi-Zhe SonG , Zhanyu Ma , Jun Guo

Color constancy (CC) describes the ability of the visual system to perceive an object as having a relatively constant color despite changes in lighting conditions. While CC and its limitations have been carefully characterized in humans, it…

计算机视觉与模式识别 · 计算机科学 2024-04-15 Markus R. Ernst , Francisco M. López , Arthur Aubret , Roland W. Fleming , Jochen Triesch

Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…

数据结构与算法 · 计算机科学 2016-03-24 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Vincenzo Roselli