Results 1  10
of
633
RAIN REMOVAL IN VIDEO BY COMBINING TEMPORAL AND CHROMATIC PROPERTIES
"... Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that incorporates both temporal and chromatic properties of rain in video. The temporal property states that an image pixel is ne ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that incorporates both temporal and chromatic properties of rain in video. The temporal property states that an image pixel
Behavioral/Systems/Cognitive The Impact of Suppressive Surrounds on Chromatic Properties of Cortical Neurons
"... Stimulation of the suppressive surround of a cortical neuron affects the responsivity and tuning of the classical receptive field (CRF) on several stimulus dimensions. In V1 and V2 of macaques prepared for acute electrophysiological experiments, we explored the chromatic sensitivity of the surround ..."
Abstract
 Add to MetaCart
. This makes the relative sensitivity of V2 neurons to achromatic and isoluminant gratings mainly independent of the size of the grating. We also measured the chromatic properties of the CRF in the presence of differently colored surrounds. In neither V1 nor V2 did the surround alter the chromatic tuning
PROBLEMS AND RESULTS ON 3CHROMATIC HYPERGRAPHS AND SOME RELATED QUESTIONS
 COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 10. INFINITE AND FINITE SETS, KESZTHELY (HUNGARY)
, 1973
"... A hypergraph is a collection of sets. This paper deals with finite hypergraphs only. The sets in the hypergraph are called edges, the elements of these edges are points. The degree of a point is the number of edges containing it. The hypergraph is runiform if every edge has r points. A hypergraph i ..."
Abstract

Cited by 311 (0 self)
 Add to MetaCart
with chromatic number 2 were first investigated systematically by M i 11 e r (who used the term property B) in the case of infinite edges. There now is a large literature of this subject both for finite and infinite sets. The main idea behind our investigations is that being simple or being a clique imposes
Behavioral/Systems/Cognitive Chromatic Properties of Horizontal and Ganglion Cell Responses Follow a Dual Gradient in Cone Opsin Expression
"... In guinea pig retina, immunostaining reveals a dual gradient of opsins: cones expressing opsin sensitive to medium wavelengths (M) predominate in the upper retina, whereas cones expressing opsin sensitive to shorter wavelengths (S) predominate in the lower retina. Whether these gradients correspond ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In guinea pig retina, immunostaining reveals a dual gradient of opsins: cones expressing opsin sensitive to medium wavelengths (M) predominate in the upper retina, whereas cones expressing opsin sensitive to shorter wavelengths (S) predominate in the lower retina. Whether these gradients correspond to functional gradients in postreceptoral neurons is essentially unknown. Using monochromatic flashes, we measured the relative weights with which M, S, and rod signals contribute to horizontal cell responses. For a background that produced 4.76 log 10 photoisomerizations per rod per second (Rh*/rod/s), mean weights in superior retina were 52 % (M), 2 % (S), and 46% (rod). Mean weights in inferior retina were 9 % (M), 50 % (S), and 41 % (rod). In superior retina, cone opsin weights agreed quantitatively with relative pigment density estimates from immunostaining. In inferior retina, cone opsin weights agreed qualitatively with relative pigment density estimates, but quantitative comparison was impossible because individual cones coexpress both opsins to varying and unquantifiable degrees. We further characterized the functional gradients in horizontal and brisktransient ganglion cells using flickering stimuli produced by various mixtures of blue and green primary lights. Cone weights for both cell types resembled those obtained for horizontal cells using monochromatic flashes. Because the brisktransient ganglion cell is thought to mediate behavioral detection of luminance contrast, our results are consistent with the hypothesis that the dual gradient of cone opsins assists achromatic contrast detection against different spectral backgrounds. In our preparation, rod responses did not completely saturate, even at background light levels typical of outdoor sunlight (5.14 log 10 Rh*/rod/s). Key words: cone opsin dual gradient; horizontal cell; brisktransient ganglion cell; cone weights; light adaptation; spectral sensitivity
Chromatic mechanisms in striate cortex of macaque
 LeonGarcia A. Probability and Random Processes for Electrical Engineering
, 1990
"... We measured the responses of 305 neurons in striate cortex to moving sinusoidal gratings modulated in chromaticity and luminance about a fixed white point. Stimuli were represented in a 3dimensional color space defined by 2 chromatic axes and a third along which luminance varied. With rare exceptio ..."
Abstract

Cited by 122 (5 self)
 Add to MetaCart
exceptions the chromatic properties of cortical neurons were well described by a linear model in which the response of a cell is proportional to the sum (for complex cells, the rectified sum) of the signals from the 3 classes of cones. For each cell there is a vector passing through the white point along
D, Chromatic properties of generic planar configurations of points, Preprint math/GT0210051
"... Abstract. We study the Orchard relation defined in [3] for generic configurations of points in the plane (also called order types). We introduce infinitesimallyclose points and analyse the relation of this notion with the Orchard relation. The second part of the paper deals with monochromatic confi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We study the Orchard relation defined in [3] for generic configurations of points in the plane (also called order types). We introduce infinitesimallyclose points and analyse the relation of this notion with the Orchard relation. The second part of the paper deals with monochromatic configurations (for the Orchard relation). We give the complete list of all monochromatic configurations up to 7 points and present some constructions and families of monochromatic configurations. 1.
The strong perfect graph theorem
 ANNALS OF MATHEMATICS
, 2006
"... A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asse ..."
Abstract

Cited by 285 (23 self)
 Add to MetaCart
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961
On the chromatic number of geometric graphs
 Ars Combin
, 1980
"... Let S be a finite or infinite set in the Euclidean space 3E. We definte the graph G(S) on the vertexset S by joining x,y c S iff p(x,y) / = their distance / is 1. In this paper we investigate various chromatic properties and the dimension of h such graphs. Thus for example X e (IE) will be define ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Let S be a finite or infinite set in the Euclidean space 3E. We definte the graph G(S) on the vertexset S by joining x,y c S iff p(x,y) / = their distance / is 1. In this paper we investigate various chromatic properties and the dimension of h such graphs. Thus for example X e (IE
Chromatic Factors
, 2009
"... The chromatic polynomial P (G, λ) gives the number of proper colourings of a graph G in at most λ colours. If P (G, λ) = P (H1, λ)P (H2, λ) /P (Kr, λ), then G is said to have a chromatic factorisation of order r with chromatic factors H1 and H2. It is clear that, if 0 ≤ r ≤ 2, any H1 ̸ ∼ = Kr wit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
factorisation. This certificate shows in a sequence of six steps using some basic properties of chromatic polynomials that a graph G has a chromatic factorisation with one of the chromatic factors being H1. This certificate is one of the shortest known certificates of factorisation, excluding the trivial
Results 1  10
of
633