Jalilifard Amir, Brigante Pizzolato Ednaldo
Annu Int Conf IEEE Eng Med Biol Soc. 2016 Aug;2016:820-824. doi: 10.1109/EMBC.2016.7590827.
Drowsy driving is a major cause of many traffic accidents. The aim of this work is to develop an automatic drowsiness detection system using an efficient k-nearest neighbors (K-NN) algorithm. First, the distribution of power in time-frequency space was obtained using short-time Fourier transform (STFT) and then, the mean value of power during time-segments of 0.5 second was calculated for each EEG subband. In addition, standard deviation (SD) and Shanon entropy related to each time-segment were computed from time-domain. Finally, 52 features were extracted. Random forest algorithm was applied over the extracted data, aiming to choose the most informative subset of features. A total of 11 features were selected in order to classify drowsiness and alertness. Kd-trees was used as the nearest neighbors search algorithm so as to have a fast classifier. Our experimental results show that drowsiness can be classified efficiently with 91% accuracy using the methods and materials proposed in this paper.
疲劳驾驶是许多交通事故的主要原因。这项工作的目的是使用高效的k近邻(K-NN)算法开发一种自动疲劳检测系统。首先,使用短时傅里叶变换(STFT)获得时频空间中的功率分布,然后,为每个脑电图子带计算0.5秒时间段内的功率平均值。此外,从时域计算与每个时间段相关的标准差(SD)和香农熵。最后,提取了52个特征。将随机森林算法应用于提取的数据,旨在选择最具信息性的特征子集。总共选择了11个特征来对疲劳和警觉进行分类。使用kd树作为最近邻搜索算法,以获得快速分类器。我们的实验结果表明,使用本文提出的方法和材料,可以以91%的准确率有效地对疲劳进行分类。