TY - JOUR
T1 - A spatial-temporal trajectory clustering algorithm for eye fixations identification
AU - Yu, Mingxin
AU - Lin, Yingzi
AU - Breugelmans, Jeffrey
AU - Wang, Xiangzhou
AU - Wang, Yu
AU - Gao, Guanglai
AU - Tang, Xiaoying
N1 - Publisher Copyright:
© 2016 - IOS Press and the authors. All rights reserved.
PY - 2016/3/1
Y1 - 2016/3/1
N2 - Eye movements mainly consist of fixations and saccades. The identification of eye fixations plays an important role in the process of eye-movement data research. At present, there is no standard method for identifying eye fixations. In this paper, eye movements are regarded as spatial-temporal trajectories. Hence, we present a spatial-temporal trajectory clustering algorithm for eye fixations identification. The main idea of the algorithm is based on Density-Based Spatial Clustering Algorithm with Noise (DBSCAN), which is commonly used in spatial clustering data. In order to apply DBSCAN to our spatial-temporal clustering data, we modified its original concept and algorithm. In addition, the optimum dispersion threshold (Eps) is derived automatically from the data sets with the aid of the 'gap statistic' theory. Using the confusion matrix measurement method, we compared the classification results obtained by our algorithm with four other expert algorithms for eye fixations identification show the proposed algorithm demonstrated an equal or better performance. Also, the robustness of our algorithm to additional noise in Points of Gaze (PoGs) data and changes in sampling rate has been verified.
AB - Eye movements mainly consist of fixations and saccades. The identification of eye fixations plays an important role in the process of eye-movement data research. At present, there is no standard method for identifying eye fixations. In this paper, eye movements are regarded as spatial-temporal trajectories. Hence, we present a spatial-temporal trajectory clustering algorithm for eye fixations identification. The main idea of the algorithm is based on Density-Based Spatial Clustering Algorithm with Noise (DBSCAN), which is commonly used in spatial clustering data. In order to apply DBSCAN to our spatial-temporal clustering data, we modified its original concept and algorithm. In addition, the optimum dispersion threshold (Eps) is derived automatically from the data sets with the aid of the 'gap statistic' theory. Using the confusion matrix measurement method, we compared the classification results obtained by our algorithm with four other expert algorithms for eye fixations identification show the proposed algorithm demonstrated an equal or better performance. Also, the robustness of our algorithm to additional noise in Points of Gaze (PoGs) data and changes in sampling rate has been verified.
KW - DBSCAN
KW - Eye fixations
KW - Optimum dispersion threshold
KW - Spatial-temporal trajectory clustering
UR - http://www.scopus.com/inward/record.url?scp=84960958051&partnerID=8YFLogxK
U2 - 10.3233/IDA-160810
DO - 10.3233/IDA-160810
M3 - Article
AN - SCOPUS:84960958051
SN - 1088-467X
VL - 20
SP - 377
EP - 393
JO - Intelligent Data Analysis
JF - Intelligent Data Analysis
IS - 2
ER -