用于视觉注意分析的眼动轨迹扫描路径挖掘

Aoqi Li, Yingxue Zhang, Zhenzhong Chen
{"title":"用于视觉注意分析的眼动轨迹扫描路径挖掘","authors":"Aoqi Li, Yingxue Zhang, Zhenzhong Chen","doi":"10.1109/ICME.2017.8019507","DOIUrl":null,"url":null,"abstract":"Eye movement reflects the shift of overt visual attention. Eye movement trajectories from a group of observers can be expressed by a representative scanpath. The representative scan-path can work as a baseline for studies on scanpath prediction as well as provide useful knowledge about group behavior in psychological studies. In this paper, we propose a new framework to summarize a representative scanpath from individual scanpaths, taking into account the spatial distribution of scan-paths rather than simply treating them as strings of characters. It consists of three steps: extract areas of interest (AOI), remove outliers and summarize scanpaths. In the last step, we develop an algorithm termed Candidate-constrained DTW Barycenter Algorithm (CDBA) by imposing 3 constraints: (1) the components of the representative scanpath must be chosen from candidates (extracted AOIs); (2) the occurrence count of each AOI in the representative scanpath cannot exceed its maximum occurrence count in individual scanpaths; (3) any two contiguous AOIs in the representative scanpath must be contiguous in at least one individual scanpath. The experiments demonstrate that the proposed method outperforms other state-of-the-art scanpath mining methods.","PeriodicalId":330977,"journal":{"name":"2017 IEEE International Conference on Multimedia and Expo (ICME)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Scanpath mining of eye movement trajectories for visual attention analysis\",\"authors\":\"Aoqi Li, Yingxue Zhang, Zhenzhong Chen\",\"doi\":\"10.1109/ICME.2017.8019507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Eye movement reflects the shift of overt visual attention. Eye movement trajectories from a group of observers can be expressed by a representative scanpath. The representative scan-path can work as a baseline for studies on scanpath prediction as well as provide useful knowledge about group behavior in psychological studies. In this paper, we propose a new framework to summarize a representative scanpath from individual scanpaths, taking into account the spatial distribution of scan-paths rather than simply treating them as strings of characters. It consists of three steps: extract areas of interest (AOI), remove outliers and summarize scanpaths. In the last step, we develop an algorithm termed Candidate-constrained DTW Barycenter Algorithm (CDBA) by imposing 3 constraints: (1) the components of the representative scanpath must be chosen from candidates (extracted AOIs); (2) the occurrence count of each AOI in the representative scanpath cannot exceed its maximum occurrence count in individual scanpaths; (3) any two contiguous AOIs in the representative scanpath must be contiguous in at least one individual scanpath. The experiments demonstrate that the proposed method outperforms other state-of-the-art scanpath mining methods.\",\"PeriodicalId\":330977,\"journal\":{\"name\":\"2017 IEEE International Conference on Multimedia and Expo (ICME)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Multimedia and Expo (ICME)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2017.8019507\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Multimedia and Expo (ICME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2017.8019507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

眼球运动反映了显性视觉注意力的转移。一组观察者的眼动轨迹可以用代表性扫描路径表示。具有代表性的扫描路径可以作为扫描路径预测研究的基线,也可以为心理学研究中的群体行为提供有用的知识。在本文中,我们提出了一个新的框架,从单个扫描路径中总结具有代表性的扫描路径,考虑到扫描路径的空间分布,而不是简单地将它们视为字符串。它包括三个步骤:提取感兴趣区域(AOI),去除异常值和总结扫描路径。在最后一步,我们通过施加3个约束,开发了一种称为候选约束DTW重心算法(CDBA)的算法:(1)必须从候选(提取的aoi)中选择代表性扫描路径的组件;(2)代表性扫描路径中每个AOI的出现次数不能超过其在单个扫描路径中的最大出现次数;(3)代表性扫描路径中的任何两个连续aoi必须在至少一个单独的扫描路径中连续。实验表明,该方法优于其他先进的扫描路径挖掘方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scanpath mining of eye movement trajectories for visual attention analysis
Eye movement reflects the shift of overt visual attention. Eye movement trajectories from a group of observers can be expressed by a representative scanpath. The representative scan-path can work as a baseline for studies on scanpath prediction as well as provide useful knowledge about group behavior in psychological studies. In this paper, we propose a new framework to summarize a representative scanpath from individual scanpaths, taking into account the spatial distribution of scan-paths rather than simply treating them as strings of characters. It consists of three steps: extract areas of interest (AOI), remove outliers and summarize scanpaths. In the last step, we develop an algorithm termed Candidate-constrained DTW Barycenter Algorithm (CDBA) by imposing 3 constraints: (1) the components of the representative scanpath must be chosen from candidates (extracted AOIs); (2) the occurrence count of each AOI in the representative scanpath cannot exceed its maximum occurrence count in individual scanpaths; (3) any two contiguous AOIs in the representative scanpath must be contiguous in at least one individual scanpath. The experiments demonstrate that the proposed method outperforms other state-of-the-art scanpath mining methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信