scholarly journals No evidence for motion dazzle in an evolutionary citizen science game

2019 ◽  
Author(s):  
Anna E. Hughes ◽  
David Griffiths ◽  
Jolyon Troscianko ◽  
Laura A. Kelley

AbstractThe motion dazzle hypothesis posits that high contrast geometric patterns can cause difficulties in tracking a moving target, and has been argued to explain the patterning of animals such as zebras. Research to date has only tested a small number of patterns, offering equivocal support for the hypothesis. Here, we take a genetic programming approach to allow patterns to evolve based on their fitness (time taken to capture) and thus find the optimal strategy for providing protection when moving. Our ‘Dazzle Bug’ citizen science game tested over 1.5 million targets in a touch screen game at a popular visitor attraction. Surprisingly, we found that targets lost pattern elements during evolution and became closely background matching. Modelling results suggested that targets with lower motion energy were harder to catch. Our results indicate that low contrast, featureless targets offer the greatest protection against capture when in motion, challenging the motion dazzle hypothesis.

2021 ◽  
Vol 288 (1942) ◽  
pp. 20202823
Author(s):  
Anna E. Hughes ◽  
David Griffiths ◽  
Jolyon Troscianko ◽  
Laura A. Kelley

The motion dazzle hypothesis posits that high contrast geometric patterns can cause difficulties in tracking a moving target and has been argued to explain the patterning of animals such as zebras. Research to date has only tested a small number of patterns, offering equivocal support for the hypothesis. Here, we take a genetic programming approach to allow patterns to evolve based on their fitness (time taken to capture) and thus find the optimal strategy for providing protection when moving. Our ‘Dazzle Bug’ citizen science game tested over 1.5 million targets in a touch screen game at a popular visitor attraction. Surprisingly, we found that targets lost pattern elements during evolution and became closely background matching. Modelling results suggested that targets with lower motion energy were harder to catch. Our results indicate that low contrast, featureless targets offer the greatest protection against capture when in motion, challenging the motion dazzle hypothesis.


2013 ◽  
Vol 9 (6) ◽  
pp. 20130811 ◽  
Author(s):  
Roger D. Santer

Motion dazzle describes high-contrast patterns (e.g. zigzags on snakes and dazzle paint on World War I ships) that do not conceal an object, but inhibit an observer's perception of its motion. However, there is limited evidence for this phenomenon. Locusts have a pair of descending contralateral movement detector (DCMD) neurons which respond to predator-like looming objects and trigger escape responses. Within the network providing input to a DCMD, separate channels are excited when moving edges cause areas of the visual field to brighten or darken, respectively, and these stimuli interact antagonistically. When a looming square has an upper half and lower half that are both darker than background, it elicits a stronger DCMD response than the upper half does alone. However, when a looming square has a darker-than-background upper half and a brighter-than-background lower half, it elicits a weaker DCMD response than its upper half does alone. This effect allows high-contrast patterns to weaken and delay DCMD response parameters implicated in escape decisions, and is analogous to motion dazzle. However, the motion dazzle effect does not provide the best means of motion camouflage, because uniform bright squares, or low-contrast squares, elicit weaker DCMD responses than high-contrast, half dark, half bright squares.


Author(s):  
Russell L. Steere ◽  
Eric F. Erbe ◽  
J. Michael Moseley

We have designed and built an electronic device which compares the resistance of a defined area of vacuum evaporated material with a variable resistor. When the two resistances are matched, the device automatically disconnects the primary side of the substrate transformer and stops further evaporation.This approach to controlled evaporation in conjunction with the modified guns and evaporation source permits reliably reproducible multiple Pt shadow films from a single Pt wrapped carbon point source. The reproducibility from consecutive C point sources is also reliable. Furthermore, the device we have developed permits us to select a predetermined resistance so that low contrast high-resolution shadows, heavy high contrast shadows, or any grade in between can be selected at will. The reproducibility and quality of results are demonstrated in Figures 1-4 which represent evaporations at various settings of the variable resistor.


Author(s):  
María Carmen Sánchez-González ◽  
Raquel García-Oliver ◽  
José-María Sánchez-González ◽  
María-José Bautista-Llamas ◽  
José-Jesús Jiménez-Rejano ◽  
...  

In our work, we determined the value of visual acuity (VA) with ETDRS charts (Early Treatment Diabetic Retinopathy Study). The purpose of the study was to determine the measurement reliabilities, calculating the correlation coefficient interclass (ICC), the value of the error associated with the measure (SEM), and the minimal detectable change (MDC). Forty healthy subjects took part. The mean age was 23.5 ± 3.1 (19 to 26) years. Visual acuities were measured with ETDRS charts (96% ETDRS chart nº 2140) and (10% SLOAN Contrast Eye Test chart nº 2153). The measurements were made (at 4 m) under four conditions: Firstly, photopic conditions with high contrast (HC) and low contrast (LC) and after 15 min of visual rest, mesopic conditions with high and low contrast. Under photopic conditions and high contrast, the ICC = 0.866 and decreased to 0.580 when the luminosity and contrast decreased. The % MDC in the four conditions was always less than 10%. It was minor under photopic conditions and HC (5.83) and maximum in mesopic conditions and LC (9.70). Our results conclude a high reliability of the ETDRS test, which is higher in photopic and high contrast conditions and lower when the luminosity and contrast decreases.


2008 ◽  
Vol 20 (7) ◽  
pp. 1847-1872 ◽  
Author(s):  
Mark C. W. van Rossum ◽  
Matthijs A. A. van der Meer ◽  
Dengke Xiao ◽  
Mike W. Oram

Neurons in the visual cortex receive a large amount of input from recurrent connections, yet the functional role of these connections remains unclear. Here we explore networks with strong recurrence in a computational model and show that short-term depression of the synapses in the recurrent loops implements an adaptive filter. This allows the visual system to respond reliably to deteriorated stimuli yet quickly to high-quality stimuli. For low-contrast stimuli, the model predicts long response latencies, whereas latencies are short for high-contrast stimuli. This is consistent with physiological data showing that in higher visual areas, latencies can increase more than 100 ms at low contrast compared to high contrast. Moreover, when presented with briefly flashed stimuli, the model predicts stereotypical responses that outlast the stimulus, again consistent with physiological findings. The adaptive properties of the model suggest that the abundant recurrent connections found in visual cortex serve to adapt the network's time constant in accordance with the stimulus and normalizes neuronal signals such that processing is as fast as possible while maintaining reliability.


2016 ◽  
Vol 24 (1) ◽  
pp. 143-182 ◽  
Author(s):  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
Mark Johnston

In the computer vision and pattern recognition fields, image classification represents an important yet difficult task. It is a challenge to build effective computer models to replicate the remarkable ability of the human visual system, which relies on only one or a few instances to learn a completely new class or an object of a class. Recently we proposed two genetic programming (GP) methods, one-shot GP and compound-GP, that aim to evolve a program for the task of binary classification in images. The two methods are designed to use only one or a few instances per class to evolve the model. In this study, we investigate these two methods in terms of performance, robustness, and complexity of the evolved programs. We use ten data sets that vary in difficulty to evaluate these two methods. We also compare them with two other GP and six non-GP methods. The results show that one-shot GP and compound-GP outperform or achieve results comparable to competitor methods. Moreover, the features extracted by these two methods improve the performance of other classifiers with handcrafted features and those extracted by a recently developed GP-based method in most cases.


2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.


Sign in / Sign up

Export Citation Format

Share Document