111 research outputs found

    Extraction of the atrial activity from the ECG based on independent component analysis with prior knowledge of the source kurtosis signs

    Get PDF
    In this work it will be shown that a contrast for independent component analysis based on prior knowledge of the source kurtosis signs (ica-sks) is able to extract atrial activity from the electrocardiogram when a constrained updating is introduced. A spectral concentration measure is used, only allowing signal pair updates when spectral concentration augments. This strategy proves to be valid for independent source extraction with priors on the spectral concentration. Moreover, the method is computationally attractive with a very low complexity compared to the recently proposed methods based on spatiotemporal extraction of the atrial fibrillation signal

    Atrial signal extraction in atrial fibrillation ECGs exploiting spatial constraints

    Get PDF
    International audienceThe accuracy in the extraction of the atrial activity (AA) from electrocardiogram (ECG) signals recorded during atrial fibrillation (AF) episodes plays an important role in the analysis and characterization of atrial arrhhythmias. The present contribution puts forward a new method for AA signal automatic extraction based on a blind source separation (BSS) formulation that exploits spatial information about the AA during the T-Q segments. This prior knowledge is used to optimize the spectral content of the AA signal estimated by BSS on the full ECG recording. The comparative performance of the method is evaluated on real data recorded from AF sufferers. The AA extraction quality of the proposed technique is comparable to that of previous algorithms, but is achieved at a reduced cost and without manual selection of parameters

    Optimal Step-Size Constant Modulus Algorithm

    Get PDF
    International audienceThe step size leading to the global minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a third-degree polynomial. The resulting optimal step-size CMA (OS-CMA) is compared with other CM-based iterative techniques in terms of performance-versus-complexity trade-off

    Exploiting independence for co-channel interference cancellation and symbol detection in multiuser digital communications

    Full text link
    In the blind equalization of multi-input multi-output (MIMO) fi-nite impulse response communication channels, co-channel inter-ference (CCI) is typically cancelled by exploiting the properties of digital modulations, such as their finite alphabet (FA). This contri-bution takes advantage of the mutual independence of the users’ signals through the application of independent component ana-lysis (ICA). We demonstrate that ICA-based CCI suppression re-markably improves an FA-based approach. In addition, proposed ICA-assisted minimum mean square error receivers are shown to enhance the conventional detection capabilities of MIMO equal-ization methods relying on channel identification. The particular structure of the MIMO model yields a simplified detection scheme with improved performance at a reduced computational cost. 1

    Block Term Decomposition of ECG Recordings for Atrial Fibrillation Analysis: Temporal and Inter-Patient Variability

    Get PDF
    International audienceResponsible for 25% of strokes and 1/3 of hospitalizations due to cardiac related disturbances, atrial fibrillation (AF) is the most common sustained cardiac arrhythmia in clinical practice, considered as the last great frontier of cardiac electrophysiology. Its mechanisms are not completely understood, and a precise analysis of the atrial activity (AA) signal in electrocardiogram (ECG) recordings is necessary to better understand this challenging cardiac condition. Recently, the block term decomposition (BTD) has been proposed as a powerful tool to noninvasively extract AA in AF ECG signals. However, this tensor factorization technique was performed only in short ECG recordings and illustrated in single patients. To assess its performance and variability through different subjects, BTD is applied to a population of 10 AF patients in this paper. Also, its time variability is evaluated by means of long segments of AF ECG with varying observation window size. Experimental results show the consistency of BTD as an AA extraction tool, outperforming two well-known matrix-based methods in most of the observed cases for long and short AF ECG recordings

    Löwner-Based Tensor Decomposition for Blind Source Separation in Atrial Fibrillation ECGs

    Get PDF
    International audienceThe estimation of the atrial activity (AA) signal in electrocardiogram (ECG) recordings is an important step in the noninvasive analysis of atrial fibrillation (AF), the most common sustained cardiac arrhythmia in clinical practice. Recently, this blind source separation (BSS) problem has been formulated as a tensor factorization, based on the block term decomposition (BTD) of a data tensor built from Hankel matrices of the observed ECG. However, this tensor factorization technique was precisely assessed only in segments with long R-R intervals and with the AA well defined in the TQ segment, where ventricular activity (VA) is absent. Due to the chaotic nature of AA in AF, segments with disorganized or weak AA and with short R-R intervals are quite more common in persistent AF, posing some difficulties to the BSS methods to extract the AA signal, regarding performance and computational cost. In this paper, the BTD built from Löwner matrices is proposed as a method to separate VA from AA in these challenging scenarios. Experimental results obtained in a population of 10 patients show that the Löwner-based BTD outperforms the Hankel-based BTD and two well-known matrix-based methods in terms of atrial signal estimation quality and computational cost

    Cram\'er-Rao Bounds for Complex-Valued Independent Component Extraction: Determined and Piecewise Determined Mixing Models

    Full text link
    This paper presents Cram\'er-Rao Lower Bound (CRLB) for the complex-valued Blind Source Extraction (BSE) problem based on the assumption that the target signal is independent of the other signals. Two instantaneous mixing models are considered. First, we consider the standard determined mixing model used in Independent Component Analysis (ICA) where the mixing matrix is square and non-singular and the number of the latent sources is the same as that of the observed signals. The CRLB for Independent Component Extraction (ICE) where the mixing matrix is re-parameterized in order to extract only one independent target source is computed. The target source is assumed to be non-Gaussian or non-circular Gaussian while the other signals (background) are circular Gaussian or non-Gaussian. The results confirm some previous observations known for the real domain and bring new results for the complex domain. Also, the CRLB for ICE is shown to coincide with that for ICA when the non-Gaussianity of background is taken into account. %unless the assumed sources' distributions are misspecified. Second, we extend the CRLB analysis to piecewise determined mixing models. Here, the observed signals are assumed to obey the determined mixing model within short blocks where the mixing matrices can be varying from block to block. However, either the mixing vector or the separating vector corresponding to the target source is assumed to be constant across the blocks. The CRLBs for the parameters of these models bring new performance bounds for the BSE problem.Comment: 25 pages, 8 figure

    Fusion Methods for Biosignal Analysis: Theory and Applications

    Get PDF
    Salazar Afanador, A.; Zarzoso, V.; Rosa-Zurera, M.; Vergara DomĂ­nguez, L. (2017). Fusion Methods for Biosignal Analysis: Theory and Applications. Computational Intelligence and Neuroscience. (1):1-2. doi:10.1155/2017/7152546S12

    Detection of channel variations to improve channel estimation methods

    Get PDF
    “The final publication is available at Springer via http://dx.doi.org/[10.1007/s00034-014-9767-8]”[Abstract] In current digital communication systems, channel information is typically acquired by supervised approaches that use pilot symbols included in the transmit frames. Given that pilot symbols do not convey user data, they penalize throughput spectral efficiency, and transmit energy consumption of the system. Unsupervised channel estimation algorithms could be used to mitigate the aforementioned drawbacks although they present higher computational complexity than that offered by supervised ones. This paper proposes a simple decision method suitable for slowly varying channels to determine whether the channel has suffered a significant variation, which requires to estimate the matrix of the recently changed channel. Otherwise, a previous estimate is used to recover the transmitted symbols. The main advantage of this method is that the decision criterion is only based on information acquired during the time frame synchronization, which is carried out at the receiver. We show that the proposed criterion provides a considerable improvement of computational complexity for both supervised and unsupervised methods, without incurring in a penalization in terms of symbol error ratio. Specifically, we consider systems that make use of the popular Alamouti code. Performance evaluation is accomplished by means of simulated channels as well as making use of indoor wireless channels measured using a testbed
    • …
    corecore