Near-optimal integration of orientation information across saccades

被引:83
|
作者
Ganmor, Elad [1 ]
Landy, Michael S. [1 ,2 ]
Simoncelli, Eero P. [1 ,2 ,3 ,4 ]
机构
[1] NYU, Ctr Neural Sci, New York, NY 10003 USA
[2] NYU, Dept Psychol, New York, NY 10003 USA
[3] NYU, Courant Inst Math Sci, New York, NY USA
[4] NYU, Howard Hughes Med Inst, New York, NY USA
来源
JOURNAL OF VISION | 2015年 / 15卷 / 16期
关键词
eye movements; cue integration; psychophysics; saccadic integration; EYE-MOVEMENTS; CUE COMBINATION; OBJECT RECOGNITION; VISUAL SPACE; PERCEPTION; CORTEX; DISCRIMINATION; IDENTIFICATION; DISPLACEMENT; FIXATION;
D O I
10.1167/15.16.8
中图分类号
R77 [眼科学];
学科分类号
100212 ;
摘要
We perceive a stable environment despite the fact that visual information is essentially acquired in a sequence of snapshots separated by saccadic eye movements. The resolution of these snapshots varies-high in the fovea and lower in the periphery-and thus the formation of a stable percept presumably relies on the fusion of information acquired at different resolutions. To test if, and to what extent, foveal and peripheral information are integrated, we examined human orientation-discrimination performance across saccadic eye movements. We found that humans perform best when an oriented target is visible both before (peripherally) and after a saccade (foveally), suggesting that humans integrate the two views. Integration relied on eye movements, as we found no evidence of integration when the target was artificially moved during stationary viewing. Perturbation analysis revealed that humans combine the two views using a weighted sum, with weights assigned based on the relative precision of foveal and peripheral representations, as predicted by ideal observer models. However, our subjects displayed a systematic overweighting of the fovea, relative to the ideal observer, indicating that human integration across saccades is slightly suboptimal.
引用
收藏
页数:12
相关论文
共 50 条
  • [31] Near-optimal continuous patrolling with teams of mobile information gathering agents
    Stranders, R.
    Munoz de Cote, E.
    Rogers, A.
    Jennings, N. R.
    ARTIFICIAL INTELLIGENCE, 2013, 195 : 63 - 105
  • [32] Near-Optimal Online Auctions
    Blum, Avrim
    Hartline, Jason D.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 1156 - 1163
  • [33] Near-optimal terrain collision
    Malaek, S. M.
    Abbasi, A.
    2006 IEEE AEROSPACE CONFERENCE, VOLS 1-9, 2006, : 2990 - +
  • [34] Near-optimal adaptive polygonization
    Seibold, W
    Joy, KI
    COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS, 1999, : 206 - 213
  • [35] Near-Optimal Light Spanners
    Chechik, Shiri
    Wulff-Nilsen, Christian
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (03)
  • [36] Near-optimal block alignments
    Tseng, Kuo-Tsung
    Yang, Chang-Biau
    Huang, Kuo-Si
    Peng, Yung-Hsing
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (03): : 789 - 795
  • [37] Near-optimal list colorings
    Molloy, M
    Reed, B
    RANDOM STRUCTURES & ALGORITHMS, 2000, 17 (3-4) : 376 - 402
  • [38] Near-optimal sequence alignment
    Vingron, M
    CURRENT OPINION IN STRUCTURAL BIOLOGY, 1996, 6 (03) : 346 - 352
  • [39] Optimal, near-optimal, and robust epidemic control
    Dylan H. Morris
    Fernando W. Rossine
    Joshua B. Plotkin
    Simon A. Levin
    Communications Physics, 4
  • [40] Optimal, near-optimal, and robust epidemic control
    Morris, Dylan H.
    Rossine, Fernando W.
    Plotkin, Joshua B.
    Levin, Simon A.
    COMMUNICATIONS PHYSICS, 2021, 4 (01)