ScanMatch: A novel method for comparing fixation sequences
ScanMatch: A novel method for comparing fixation sequences
复制标题
DOI：
10.3758/brm.42.3.692
复制
发表时间：
2010-08-01
影响因子：
5.4
通讯作者：
Gilchrist, Iain D.
中科院分区：
文献类型：
--
作者：
Cristino, Filipe;Mathot, Sebastiaan;Gilchrist, Iain D.
我们提出了一种基于生物信息学中使用的 Needleman-Wunsch 算法来比较眼跳序列的新方法来比较 DNA 序列。在所提出的方法中，扫视序列在空间和时间上进行分组，然后重新编码以创建保留注视位置、时间和顺序信息的字母序列。两个字母序列的比较是通过最大化从替换矩阵计算出的相似性得分来进行的，该替换矩阵提供所有字母对替换的得分和惩罚间隙。替换矩阵在由各个字母编码的每个位置之间提供了有意义的链接。该链接可以是距离，但也可以编码任何有用的维度，包括感知或语义空间。通过使用合成数据和行为数据，我们展示了该方法相对于现有方法的优势。 MATLAB 的 ScanMatch 工具箱可在线免费获取 (www.scanmatch.co.uk)。
We present a novel approach to comparing saccadic eye movement sequences based on the Needleman-Wunsch algorithm used in bioinformatics to compare DNA sequences. In the proposed method, the saccade sequence is spatially and temporally binned and then recoded to create a sequence of letters that retains fixation location, time, and order information. The comparison of two letter sequences is made by maximizing the similarity score computed from a substitution matrix that provides the score for all letter pair substitutions and a penalty gap. The substitution matrix provides a meaningful link between each location coded by the individual letters. This link could be distance but could also encode any useful dimension, including perceptual or semantic space. We show, by using synthetic and behavioral data, the benefits of this method over existing methods. The ScanMatch toolbox for MATLAB is freely available online (www.scanmatch.co.uk).