Chromatic Vasarely effect
نویسندگان
چکیده
Vasarely's 'nested-squares' illusion is the perception of a glowing "X" along the diagonals of concentric squares with a luminance gradient. We present here the chromatic Vasarely effect, where the concentric angles have a chromatic gradient, under iso-brightness conditions. The strength of the effect was tested psychophysically by two measures, the length and the color of the illusory folds. The color of the illusory fold is perceived as the complementary color of the color of the nested-squares (or angles). The experimental results show that a large repertoire of stimuli with different colors and angles yielded significantly perceived colors. The results show that the strength of the perceived illusory fold (of both the length and the chroma) is significantly larger at sharper angles of the stimuli. The chromatic first-order adaptation computational model predicts most of the above results.
منابع مشابه
Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملDoes the chromatic Mach bands effect exist?
The achromatic Mach bands effect is a well-known visual illusion, discovered over a hundred years ago. This effect has been investigated thoroughly, mainly for its brightness aspect. The existence of Chromatic Mach bands, however, has been disputed. In recent years it has been reported that Chromatic Mach bands are not perceived under controlled iso-luminance conditions. However, here we show t...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Vision Research
دوره 50 شماره
صفحات -
تاریخ انتشار 2010