Model Probability in Self-organising Maps

Growing models have been widely used for clustering or topology learning. Traditionally these models work on stationary environments, grow incrementally and adapt their nodes to a given distribution based on global parameters. In this paper, we present an enhanced unsupervised self-organising network for the modelling of visual objects. We first develop a framework for building non-rigid shapes using the growth mechanism of the self-organising maps, and then we define an optimal number of nodes without overfitting or underfitting the network based on the knowledge obtained from information-theoretic considerations. We present experimental results for hands and we quantitatively evaluate the matching capabilities of the proposed method with the topographic product.

Power line interference filtering on surface electromyography based on the stationary wavelet packet transform

Power line interference is one of the main problems in surface electromyogram signals (EMG) analysis. In this work, a new method based on the stationary wavelet packet transform is proposed to estimate and remove this kind of noise from EMG data records. The performance has been quantitatively evaluated with synthetic noisy signals, obtaining good results independently from the signal to noise ratio (SNR). For the analyzed cases, the obtained results show that the correlation coefficient is around 0.99, the energy respecting to the pure EMG signal is 98–104%, the SNR is between 16.64 and 20.40 dB and the mean absolute error (MAE) is in the range of −69.02 and −65.31 dB. It has been also applied on 18 real EMG signals, evaluating the percentage of energy respecting to the noisy signals. The proposed method adjusts the reduction level to the amplitude of each harmonic present in the analyzed noisy signals (synthetic and real), reducing the harmonics with no alteration of the desired signal.

An adaptive algorithm for clustering cumulative probability distribution functions using the Kolmogorov–Smirnov two-sample test

This paper proposes an adaptive algorithm for clustering cumulative probability distribution functions (c.p.d.f.) of a continuous random variable, observed in different populations, into the minimum homogeneous clusters, making no parametric assumptions about the c.p.d.f.’s. The distance function for clustering c.p.d.f.’s that is proposed is based on the Kolmogorov–Smirnov two sample statistic. This test is able to detect differences in position, dispersion or shape of the c.p.d.f.’s. In our context, this statistic allows us to cluster the recorded data with a homogeneity criterion based on the whole distribution of each data set, and to decide whether it is necessary to add more clusters or not. In this sense, the proposed algorithm is adaptive as it automatically increases the number of clusters only as necessary; therefore, there is no need to fix in advance the number of clusters. The output of the algorithm are the common c.p.d.f. of all observed data in the cluster (the centroid) and, for each cluster, the Kolmogorov–Smirnov statistic between the centroid and the most distant c.p.d.f. The proposed algorithm has been used for a large data set of solar global irradiation spectra distributions. The results obtained enable to reduce all the information of more than 270,000 c.p.d.f.’s in only 6 different clusters that correspond to 6 different c.p.d.f.’s.