Fast computation of sample entropy and approximate entropy in biomedicine

Authors:
Yu-Hsiang Pan;Yung-Hung Wang;Sheng-Fu Liang;Kuo-Tien Lee
Affiliations:
Department of Environmental Biology and Fisheries Science, National Taiwan Ocean University, 2 Pei-Ning Road, Keelung 20224, Taiwan;Society of Streams, R.O.C., 1F., No. 15, Alley 70, Lane 12, Sec. 3, Bade Rd., Taipei City 10558, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, Ta-Hsueh Road, Tainan, Taiwan, ROC;Department of Environmental Biology and Fisheries Science, National Taiwan Ocean University, 2 Pei-Ning Road, Keelung 20224, Taiwan
Venue:
Computer Methods and Programs in Biomedicine
Year:
2011

Citing 3
Cited 2

Multidimensional binary search trees used for associative searching

Communications of the ACM
Multiscale analysis of short term heart beat interval, arterial blood pressure, and instantaneous lung volume time series

Artificial Intelligence in Medicine
Fast computation of approximate entropy

Computer Methods and Programs in Biomedicine

An algorithm for on-line detection of high frequency oscillations related to epilepsy

Computer Methods and Programs in Biomedicine
Seizure detection in clinical EEG based on entropies and EMD

ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Both sample entropy and approximate entropy are measurements of complexity. The two methods have received a great deal of attention in the last few years, and have been successfully verified and applied to biomedical applications and many others. However, the algorithms proposed in the literature require O(N^2) execution time, which is not fast enough for online applications and for applications with long data sets. To accelerate computation, the authors of the present paper have developed a new algorithm that reduces the computational time to O(N^3^/^2)) using O(N) storage. As biomedical data are often measured with integer-type data, the computation time can be further reduced to O(N) using O(N) storage. The execution times of the experimental results with ECG, EEG, RR, and DNA signals show a significant improvement of more than 100 times when compared with the conventional O(N^2) method for N=80,000 (N=length of the signal). Furthermore, an adaptive version of the new algorithm has been developed to speed up the computation for short data length. Experimental results show an improvement of more than 10 times when compared with the conventional method for N4000.