Computational approaches to apply the String Edit Algorithm to create accurate visual scan paths

被引:0
作者
Fraga, Ricardo Palma [1 ]
Kang, Ziho [1 ]
机构
[1] Univ Oklahoma, Norman, OK 73019 USA
关键词
eye movement; thresholds; algorithms; scan path; eye tracking; gaze; EYE-MOVEMENTS; FIXATION; THRESHOLD;
D O I
10.16910/jemr.17.4.4
中图分类号
R77 [眼科学];
学科分类号
100212 ;
摘要
Eye movement detection algorithms (e.g., I-VT) require the selection of thresholds to identify eye fixations and saccadic movements from gaze data. The choice of threshold is important, as thresholds too low or large may fail to accurately identify eye fixations and saccades. An inaccurate threshold might also affect the resulting visual scan path, the time-ordered sequence of eye fixations and saccades, carried out by the participant. Commonly used approaches to evaluate threshold accuracy can be manually laborious, or require information about the expected visual scan paths of participants, which might not be available. To address this issue, we propose two different computational approaches, labeled as "between-participants comparisons" and "within-participants comparisons." The approaches were evaluated using the open-source Gazebase dataset, which contained a bullseyetarget tracking task, where participants were instructed to follow the movements of a bullseye-target. The predetermined path of the bullseye-target enabled us to evaluate our proposed approaches against the expected visual scan path. The approaches identified threshold values (220 degrees/s and 210 degrees/s) that were 83% similar to the expected visual scan path, outperforming a 30 degrees/s benchmark threshold (41.5%). These methods might assist researchers in identifying accurate threshold values for the IVT algorithm or potentially other eye movement detection algorithms.
引用
收藏
页数:19
相关论文
共 45 条
[1]   A comparison of scanpath comparison methods [J].
Anderson, Nicola C. ;
Anderson, Fraser ;
Kingstone, Alan ;
Bischof, Walter F. .
BEHAVIOR RESEARCH METHODS, 2015, 47 (04) :1377-1392
[2]   One algorithm to rule them all? An evaluation and discussion of ten eye movement event-detection algorithms [J].
Andersson, Richard ;
Larsson, Linnea ;
Holmqvist, Kenneth ;
Stridh, Martin ;
Nystrom, Marcus .
BEHAVIOR RESEARCH METHODS, 2017, 49 (02) :616-637
[3]  
Beelders TR, 2016, J EYE MOVEMENT RES, V9
[4]  
Blignaut P, 2009, J EYE MOVEMENT RES, V2
[5]   Fixation identification: The optimum threshold for a dispersion algorithm [J].
Blignaut, Pieter .
ATTENTION PERCEPTION & PSYCHOPHYSICS, 2009, 71 (04) :881-895
[6]   Defending Yarbus: Eye movements reveal observers' task [J].
Borji, Ali ;
Itti, Laurent .
JOURNAL OF VISION, 2014, 14 (03)
[7]   ScanMatch: A novel method for comparing fixation sequences [J].
Cristino, Filipe ;
Mathot, Sebastiaan ;
Theeuwes, Jan ;
Gilchrist, Iain D. .
BEHAVIOR RESEARCH METHODS, 2010, 42 (03) :692-700
[8]  
Davis AL, 2018, J TRANSP HEALTH, V10, P5, DOI [10.16910/jemr.10.5.11, 10.1016/j.jth.2018.08.007]
[9]   Top-down control of eye movements: Yarbus revisited [J].
DeAngelus, Marianne ;
Pelz, Jeff B. .
VISUAL COGNITION, 2009, 17 (6-7) :790-811
[10]   It depends on how you look at it: Scanpath comparison in multiple dimensions with MultiMatch, a vector-based approach [J].
Dewhurst, Richard ;
Nystrom, Marcus ;
Jarodzka, Halszka ;
Foulsham, Tom ;
Johansson, Roger ;
Holmqvist, Kenneth .
BEHAVIOR RESEARCH METHODS, 2012, 44 (04) :1079-1100