Identifying fixations and saccades in eye-tracking protocols
ETRA '00 Proceedings of the 2000 symposium on Eye tracking research & applications
Eye Tracking Methodology: Theory and Practice
Eye Tracking Methodology: Theory and Practice
Fixation-identification in dynamic scenes: comparing an automated algorithm to manual coding
Proceedings of the 5th symposium on Applied perception in graphics and visualization
On spatiochromatic visual sensitivity and peripheral color LOD management
ACM Transactions on Applied Perception (TAP)
Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems
Real time eye movement identification protocol
CHI '10 Extended Abstracts on Human Factors in Computing Systems
Analysing EOG signal features for the discrimination of eye movements with wearable devices
Proceedings of the 1st international workshop on pervasive eye tracking & mobile eye-based interaction
Proceedings of the 13th international conference on Ubiquitous computing
Wearable eye tracking for mental health monitoring
Computer Communications
Proceedings of the 2012 ACM Conference on Ubiquitous Computing
Real-time 3D gaze analysis in mobile applications
Proceedings of the 2013 Conference on Eye Tracking South Africa
| Hi-index | 0.00 |
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a foundation for the eye tracking researchers to communicate about the performance validity of various eye movement classification algorithms. The paper concentrates on the five algorithms in particular: Velocity Threshold Identification (I-VT), Dispersion Threshold Identification (I-DT), Minimum Spanning Tree Identification (MST), Hidden Markov Model Identification (I-HMM) and Kalman Filter Identification (I-KF). The paper presents an evaluation of the classification performance of each algorithm in the case when values of the input parameters are varied. Advantages provided by the new scores are discussed. Discussion on what is the "best" classification algorithm is provided for several applications. General recommendations for the selection of the input parameters for each algorithm are provided.