The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Concurrent processing of saccades in visual search
Open accessAbstract
We provide evidence that the saccadic system can simultaneously program two saccades to different goals. We presented subjects with simple visual search displays in which they were required to make a saccade to an odd-colored target embedded in an array of distractors. When there was strong competition between target and distractor stimuli (due to color priming from previous trials), subjects were more likely to make a saccade to a distractor. Such error saccades were often followed, after a very short inter-saccadic interval ( approximately 10-100 ms), by a second saccade to the target. The brevity of these inter-saccadic intervals suggests that the programming of the two saccades (one to a distractor and one to the target) overlapped in time. Using a saccade-contingent change in the search display, we show that new visual information presented during the initial saccade does not change the goal of the second saccade. This supports the idea that, by the end of the first saccade, programming of the second saccade is already well underway. We also elicited two-saccade responses (similar to those seen in search) using a double-step task, with the first saccade directed to the initial target step and the second saccade directed to the second target step. If the two saccades are programmed in parallel and programming of each saccade is triggered by one of the two target steps, the second saccade should occur at a relatively fixed time after the onset of the second target step, regardless of the timing of the initial saccade. This prediction was confirmed, supporting the idea that the two saccades are programmed in parallel. Finally, we observed that the shortest inter-saccadic intervals typically followed hypometric initial saccades, suggesting that the initial saccade may have been interrupted by the impending second saccade. Using predictions from physiological studies of interrupted saccades, we tested this hypothesis and found that the hypometric initial saccades did not appear to be interrupted in mid-flight. We discuss the significance of our findings for models of the saccadic system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Priming of pop-out: I. Role of features
Maljkovic, V., & Nakayama, K. (1994) · Memory & Cognition · doi:10.3758/bf03209251 · Cited by 1,107
Self-citationOur Eyes do Not Always Go Where we Want Them to Go: Capture of the Eyes by New Objects
Theeuwes, J., Kramer, A. F., Hahn, S., & Irwin, D. E. (1998) · Psychological Science · doi:10.1111/1467-9280.00071 · Cited by 646
Cited by
Neural Mechanisms for Interacting with a World Full of Action Choices
Cisek, P., & Kalaska, J. F. (2010) · Annual Review of Neuroscience · doi:10.1146/annurev.neuro.051508.135409 · Cited by 1,543
Ultra-rapid object detection with saccadic eye movements: Visual processing speed revisited
Kirchner, H., & Thorpe, S. J. (2006) · Vision Research · doi:10.1016/j.visres.2005.10.002 · Cited by 628
Eye movements: The past 25years
Kowler, E. (2011) · Vision Research · doi:10.1016/j.visres.2010.12.014 · Cited by 619
Visual memory and motor planning in a natural task
Hayhoe, M. M., Shrivastava, A., Mruczek, R., & Pelz, J. B. (2003) · Journal of Vision · doi:10.1167/3.1.6 · Cited by 567
Programming of endogenous and exogenous saccades: Evidence for a competitive integration model.
Godijn, R., & Theeuwes, J. (2002) · Journal of Experimental Psychology: Human Perception and Performance · doi:10.1037//0096-1523.28.5.1039 · Cited by 429
Metadata
- Authors
- McPeek, R. M., Skavenski, A. A., & Nakayama, K.
- Venue
- Vision Research
- Publisher
- Elsevier BV
- Published
- 2000-08
- Volume
- 40
- Issue
- 18
- Pages
- 2499-2516
- ISSN
- 0042-6989 (ISSN-L)
- OpenAlex
- W2117563204
- Cited by
- 238
- References
- 2
- FWCI
- 4.58
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Concurrent processing of saccades in visual search. https://app.cochat.ai/papers/10.1016/s0042-6989(00)00102-4
- The paper
- McPeek, R. M., Skavenski, A. A., & Nakayama, K. (2000). Concurrent processing of saccades in visual search. Vision Research. https://doi.org/10.1016/s0042-6989(00)00102-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.