A fast box counting algorithm for determining the fractal dimension of sampled continuous functions

Author

Boshoff, Hendrik F V

Author_Institution

Dept. of Electr. & Electron. Eng., Stellenbosch Univ., South Africa

fYear

1992

fDate

9/11/1992 12:00:00 AM

Firstpage

43

Lastpage

48

Abstract

An adaptation of the box counting algorithm to samples of a continuous signal is given. An iterative scheme is combined with an exploitation of continuity to yield a fast method. This reduces the algorithm´s complexity from quadratic to linear. The method is applied to speech segments; in this context it is faster than morphological filtering and Hurst analysis, and has comparable performance. The new algorithm is also suitable to be parallelized. It is applied to calculation of the dimension of fricative phonemes and automatic segmentation of speech into periodic/noiselike segments. This dimension value may be used instead of zero crossing rate in some applications

Keywords

computational complexity; fractals; iterative methods; parallel algorithms; sampled data systems; speech recognition; complexity; continuity; fast box counting algorithm; fractal dimension; fricative phonemes; iterative scheme; performance; sampled continuous functions; speech segments; Clouds; Combustion; Filtering; Fractals; Histograms; Noise robustness; Optimization methods; Performance analysis; Speech analysis; Speech coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Signal Processing, 1992. COMSIG '92., Proceedings of the 1992 South African Symposium on

Conference_Location

Cape Town

Print_ISBN

0-7803-0807-7

Type

conf

DOI

10.1109/COMSIG.1992.274315

Filename

274315