Less is more: Simple stimuli provoke more variable search strategies.

2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Alasdair D F Clarke ◽  
Jessica Christie ◽  
Josephine Reuther ◽  
Amelia R. Hunt
Keyword(s):  
Line Segment ◽  
Search Strategies ◽  
Complex Objects ◽  
Search Behaviour ◽  
Line Segments ◽  
Surface Level ◽  
Efficient Search ◽  
Less Is More ◽  
Dramatic Shift

We measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable, and mostly inefficient, strategies with the line segments, to uniformly efficient search behaviour with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.

Visual search strategies in lab and life

2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Amelia R. Hunt ◽  
Alasdair D F Clarke
Keyword(s):  
Individual Differences ◽  
Visual Search ◽  
High Resolution ◽  
Search Efficiency ◽  
Complex Objects ◽  
Line Segments ◽  
Surface Level ◽  
Dramatic Shift ◽  
The Individual ◽  
Lines Of Evidence

To what extent can our eye movement be thought of as efficient, that is, targeting locations where high resolution is needed to differentiate objects? Previous research reported conflicting conclusions: people are near-optimal, random, or even counter-optimal, according to different lines of evidence. Researchers tend to use the simplest possible environments to measure search efficiency, assuming these will minimize the individual differences in experience that could introduce unnecessary variation in behaviour. Here we measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable strategies with the line segments, to uniformly efficient search with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.

Explanation for Neon Color Effect in Achromatic Line Segments on Chromatic Inducers Based on the Multiple Interpretation Hypothesis

2005 ◽  
Vol 101 (1) ◽  
pp. 267-282
Author(s):  
Seiyu Sohmiya
Keyword(s):  
Visual System ◽  
Line Segment ◽  
Color Contrast ◽  
Achromatic Color ◽  
Line Segments ◽  
Color Effect ◽  
Complementary Color ◽  
Multiple Interpretation ◽  
Color Induction ◽  
Simultaneous Color Contrast

In van Tuijl's neon configurations, an achromatic line segment on a blue inducer produces yellowish illusory color in the illusory area. This illusion has been explained based on the idea of the complementary color induced by the blue inducer. However, it is proposed here that this illusion can be also explained by introducing the assumption that the visual system unconsciously interprets an achromatic color as information that is constituted by transparent and nontransparent colors. If this explanation is correct, not only this illusion, but also the simultaneous color contrast illusion can be explained without using the idea of the complementary color induction.

ALPHA-REGULAR STICK UNKNOTS

2012 ◽  
Vol 21 (06) ◽  
pp. 1250059 ◽  
Author(s):  
CHRISTOPHER FRAYER ◽  
CHRISTOPHER SCHAFHAUSER
Keyword(s):  
Line Segment ◽  
Line Segments

Suppose Pn is a regular n-gon in ℝ2. An embedding f : Pn ↪ ℝ3 is called an α-regular stick knot provided the image of each side of Pn under f is a line segment of length 1 and any two consecutive line segments meet at an angle of α. The main result of this paper proves the existence of α-regular stick unknots for odd n ≥ 7 with α in the range [Formula: see text]. All knots constructed will have trivial knot type, and we will show that any non-trivial α-regular stick knot must have [Formula: see text].

A Duplicate Chinese Document Image Retrieval System Based on Line Segment Feature in Character Image Block

2011 ◽  
pp. 14-23
Author(s):  
Yung-Kuan Chan ◽  
Tung-Shou Chen ◽  
Yu-An Ho
Keyword(s):  
Image Retrieval ◽  
Line Segment ◽  
Document Image ◽  
Experimental Results ◽  
Document Images ◽  
Rapid Progress ◽  
Image Block ◽  
Line Segments ◽  
Image Retrieval System ◽  
On Line

With the rapid progress of digital image technology, the management of duplicate document images is also emphasized widely. As a result, this paper suggests a duplicate Chinese document image retrieval (DCDIR) system, which uses the ratio of the number of black pixels to that of white pixels on the scanned line segments in a character image block as the feature of the character image block. Experimental results indicate that the system can indeed effectively and quickly retrieve the desired duplicate Chinese document image from a database.

Plate and line segment processes

1978 ◽  
Vol 15 (03) ◽  
pp. 494-501 ◽  
Author(s):  
N. A. Fava ◽  
L. A. Santaló
Keyword(s):  
Line Segment ◽  
Integral Geometry ◽  
Random Variables ◽  
Random Processes ◽  
Line Segments ◽  
Expected Values

Random processes of convex plates and line segments imbedded in R 3 are considered in this paper, and the expected values of certain random variables associated with such processes are computed under a mean stationarity assumption, by resorting to some general formulas of integral geometry.

Planar Lattices

1975 ◽  
Vol 27 (3) ◽  
pp. 636-665 ◽  
Author(s):  
David Kelly ◽  
Ivan Rival
Keyword(s):  
Line Segment ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Straight Line Segment ◽  
Line Segments ◽  
Small Circle ◽  
Partially Ordered ◽  
Straight Line ◽  
Finite Partially Ordered Set ◽  
Planar Lattices

A finite partially ordered set (poset) P is customarily represented by drawing a small circle for each point, with a lower than b whenever a < b in P, and drawing a straight line segment from a to b whenever a is covered by b in P (see, for example, G. Birkhoff [2, p. 4]). A poset P is planar if such a diagram can be drawn for P in which none of the straight line segments intersect.

Circuit presentation and lattice stick number with exactly four z-sticks

2018 ◽  
Vol 27 (08) ◽  
pp. 1850046
Author(s):  
Hyoungjun Kim ◽  
Sungjong No
Keyword(s):  
Upper Bound ◽  
Line Segment ◽  
Disjoint Union ◽  
Lattice Plane ◽  
Cambridge Philos ◽  
Line Segments ◽  
Cubic Lattice ◽  
Straight Line ◽  
Two Component ◽  
Number Formula

The lattice stick number [Formula: see text] of a link [Formula: see text] is defined to be the minimal number of straight line segments required to construct a stick presentation of [Formula: see text] in the cubic lattice. Hong, No and Oh [Upper bound on lattice stick number of knots, Math. Proc. Cambridge Philos. Soc. 155 (2013) 173–179] found a general upper bound [Formula: see text]. A rational link can be represented by a lattice presentation with exactly 4 [Formula: see text]-sticks. An [Formula: see text]-circuit is the disjoint union of [Formula: see text] arcs in the lattice plane [Formula: see text]. An [Formula: see text]-circuit presentation is an embedding obtained from the [Formula: see text]-circuit by connecting each [Formula: see text] pair of vertices with one line segment above the circuit. By using a two-circuit presentation, we can easily find the lattice presentation with exactly four [Formula: see text]-sticks. In this paper, we show that an upper bound for the lattice stick number of rational [Formula: see text]-links realized with exactly four [Formula: see text]-sticks is [Formula: see text]. Furthermore, it is [Formula: see text] if [Formula: see text] is a two-component link.

INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS

1999 ◽  
Vol 09 (06) ◽  
pp. 553-575
Author(s):  
FABRIZIO D'AMORE ◽  
ROBERTO GIACCIO
Keyword(s):  
Fixed Point ◽  
Line Segment ◽  
Temporal Databases ◽  
Moving Window ◽  
Data Set ◽  
Access Methods ◽  
Line Segments ◽  
Practical Algorithms ◽  
Dynamic Setting ◽  
Infinite Slab

We consider some intersection problems on segments of [Formula: see text] in the partially dynamic setting called boundary update, where updates occur at the boundary of a given region. In particular, we maintain a set S of line segments under (boundary) insertions and deletions, such that, given a line segment ℓ either of fixed slope or originating from a fixed point and given a point p∈S∩ℓ, we can efficiently and orderly report all segments intersecting ℓ; insertions/deletions of segments occur at the boundaries of a vertical infinite slab. We provide practical algorithms requiring [Formula: see text] space, [Formula: see text] time per update and [Formula: see text] time per query, where k is the number of reported segments. Our results allow both modeling a moving window over a larger data set and answering segment intersection queries at an extra query cost of [Formula: see text]; also, they provide a methodology for designing access methods to temporal databases as well as a new kind of partially persistent lists.

Sign in / Sign up

Export Citation Format

Share Document