engleski

A Local Entropy-Based Algorithm for Information Content Extraction from Time-frequency Distributions of Noisy Signals

In this paper, an automatic adaptive method for identification and separation of the useful information content, from the background noise of time–frequency distributions (TFD) of multicomponent nonstationary signals, is presented. The method is based on an initial segmentation of the TFD information content by the K-means clustering algorithm, that partitions the initial data set in order to obtain K classes containing elements with similar amplitudes. It is shown that the local Rényi entropy (LRE) can accurately distinguish classes containing noise from classes with the useful information content, as a consequence of their basic structural differences in the time–frequency plane. Simulations are run to compare the performance of the proposed adaptive algorithm for blind separation of useful information from background noise (i.e. blind amplitude threshold) and non- adaptive (hard) amplitude TFD threshold procedures. Simulation results indicate that the proposed method performs better or closely to the best of five blindly chosen hard thresholds. The limitation of efficient hard-thresholding is the need of previous knowledge of the signal's structure and SNR or visual evaluation.

Time–frequency distributions ; Segmentation ; K-means ; Local Rényi entropy ; Threshold

nije evidentirano