A ballistocardiograph records the mechanical activity of the heart. We present a novel algorithm for the detection of individual heart beats and beat-to-beat interval lengths in ballistocardiograms (BCGs) from healthy subjects. An automatic training step based on unsupervised learning techniques is used to extract the shape of a single heart beat from the BCG. Using the learned parameters, the occurrence of individual heart beats in the signal is detected. A final refinement step improves the accuracy of the estimated beat-to-beat interval lengths. Compared to many existing algorithms, the new approach offers heart rate estimates on a beat-to-beat basis. The agreement of the proposed algorithm with an ECG reference has been evaluated. A relative beat-to-beat interval error of 1.79% with a coverage of 95.94% was achieved on recordings from 16 subjects.

No abstract

In this paper we present denoising algorithms for enhancing noisy signals based on Local ICA (LICA), Delayed AMUSE (dAMUSE) and Kernel PCA (KPCA). The algorithm LICA relies on applying ICA locally to clusters of signals embedded in a high-dimensional feature space of delayed coordinates. The components resembling the signals can be detected by various criteria like estimators of kurtosis or the variance of autocorrelations depending on the statistical nature of the signal. The algorithm proposed can be applied favorably to the problem of denoising multi-dimensional data. Another projective subspace denoising method using delayed coordinates has been proposed recently with the algorithm dAMUSE. It combines the solution of blind source separation problems with denoising efforts in an elegant way and proofs to be very efficient and fast. Finally, KPCA represents a non-linear projective subspace method that is well suited for denoising also. Besides illustrative applications to toy examples and images, we provide an application of all algorithms considered to the analysis of protein NMR spectra. r

Ballistocardiography is a technique in which the mechanical activity of the heart is recorded. We present a novel algorithm for the detection of individual heart beats in ballistocardiograms (BCGs). In a training step, unsupervised learning techniques are used to identify the shape of a single heart beat in the BCG. The learned parameters are combined with so-called "heart valve components" to detect the occurrence of individual heart beats in the signal. A refinement step improves the accuracy of the estimated beat-to-beat interval lengths. Compared to other algorithms this new approach offers heart rate estimates on a beat-to-beat basis and is designed to cope with arrhythmias. The proposed algorithm has been evaluated in laboratory and home settings for its agreement with an ECG reference. A beat-to-beat interval error of 14.16 ms with a coverage of 96.87% was achieved. Averaged over 10 s long epochs, the mean heart rate error was 0.39 bpm.

Hybridizing sparse component analysis with genetic algorithms for microarray analysis, Neurocomputing (2008), doi:10.1016/j.neucom.2007.09.017 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting galley proof before it is published in its final citable form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. A c c e p t e d m a n u s c r i p t AbstractNonnegative Matrix Factorization (NMF) has proven to be a useful tool for the analysis of nonnegative multivariate data. However, it is known not to lead to unique results when applied to Blind Source Separation (BSS) problems. In this paper we present an extension of NMF capable of solving the BSS problem when the underlying sources are sufficiently sparse. In contrast to most well-established BSS methods, the devised algorithm is capable of solving the BSS problem in cases where the underlying sources are not independent or uncorrelated. As the proposed fitness function is discontinuous and possesses many local minima, we use a genetic algorithm for its minimization. Finally, we apply the devised algorithm to real world microarray data.

No abstract

No abstract

No abstract