We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Context-based lossless and near-lossless compression of EEG signals

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Memon, N. ; Dept. of Comput. Sci., Polytech. Univ., Brooklyn, NY, USA ; Kong, X. ; Cinkler, J.

We study compression techniques for electroencephalograph (EEG) signals. A variety of lossless compression techniques, including compress, gzip, bzip, shorten, and several predictive coding methods, are investigated and compared. The methods range from simple dictionary based approaches to more sophisticated context modeling techniques. It is seen that compression ratios obtained by lossless compression are limited even with sophisticated context based bias cancellation and activity based conditional coding. Though lossy compression can yield significantly higher compression ratios while potentially preserving diagnostic accuracy, it is not usually employed due to legal concerns. Hence, we investigate a near lossless compression technique that gives quantitative bounds on the errors introduced during compression. It is observed that such a technique gives significantly higher compression ratios (up to 3-bit/sample saving with less than 1% error). Compression results are reported for EEG's recorded under various clinical conditions.

Published in:

Information Technology in Biomedicine, IEEE Transactions on  (Volume:3 ,  Issue: 3 )