Highly Efficient Compression Algorithms for Multichannel EEG

• Published in: IEEE transactions on neural systems and rehabilitation engineering Vol. 26; no. 5; pp. 957 - 968
• Main Authors: Shaw, Laxmi, Rahman, Daleef, Routray, Aurobinda
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.05.2018
• Subjects: Brain modeling; Compression algorithms; context-based; EEG; Electroencephalography; Entropy; entropy coder; Huffman coding; linear prediction; Lossless compression; MVAR; Predictive models
• ISSN: 1534-4320; 1558-0210; 1558-0210
• DOI: 10.1109/TNSRE.2018.2826559

The difficulty associated with processing and understanding the high dimensionality of electroencephalogram (EEG) data requires developing efficient and robust compression algorithms. In this paper, different lossless compression techniques of single and multichannel EEG data, including Huffman coding, arithmetic coding, Markov predictor, linear predictor, context-based error modeling, multivariate autoregression (MVAR), and a low complexity bivariate model have been examined and their performances have been compared. Furthermore, a high compression algorithm named general MVAR and a modified context-based error modeling for multichannel EEG have been proposed. The resulting compression algorithm produces a higher relative compression ratio of 70.64% on average compared with the existing methods, and in some cases, it goes up to 83.06%. The proposed methods are designed to compress a large amount of multichannel EEG data efficiently so that the data storage and transmission bandwidth can be effectively used. These methods have been validated using several experimental multichannel EEG recordings of different subjects and publicly available standard databases. The satisfactory parametric measures of these methods, namely percent-root-mean square distortion, peak signal-to-noise ratio, root-mean-square error, and cross correlation, show their superiority over the state-of-the-art compression methods.