Biomedical subjects

Karen Egiazarian

Publications and source records attributed to Karen Egiazarian.

4 recordsLinked to original sources

PubMed2006

Determination of dominant simulated spindle frequency with different methods.

Accurate analysis of EEG sleep spindle frequency is challenging. The frequency content of true sleep spindles is not known. Therefore, simulated spindle activity was studied in the present work. Five types of simulated test signals were designed, all containing a dominant spindle represented by a 13-Hz sine wave as such or with a waxing and waning pattern accompanied by a secondary spindle activity in three test signals. Background EEG was included in four test signals, modeled either as small additional sinusoids across the spindle frequency range or as filtered Gaussian noise segments. The purpose of this study was to investigate how accurately the dominant spindle frequency of 13 Hz could be resolved with different methods in the presence of the interfering waveforms. A matching pursuit (MP) based approach, discrete Fourier transform (DFT) with Hanning windowing with and without zero padding, Hankel total least squares (HTLS) and wavelet methods were compared in the analyses. MP method provided best overall performance, followed closely by DFT with zero padding. Comparative studies like this are important to decide the method of choice in clinical sleep EEG analysis.

Algorithms↗

PubMed2006

Comparative study of morphological and time-frequency ECG descriptors for heartbeat classification.

The prompt and adequate detection of abnormal cardiac conditions by computer-assisted long-term monitoring systems depends greatly on the reliability of the implemented ECG automatic analysis technique, which has to discriminate between different types of heartbeats. In this paper, we present a comparative study of the heartbeat classification abilities of two techniques for extraction of characteristic heartbeat features from the ECG: (i) QRS pattern recognition method for computation of a large collection of morphological QRS descriptors; (ii) Matching Pursuits algorithm for calculation of expansion coefficients, which represent the time-frequency correlation of the heartbeats with extracted learning basic waveforms. The Kth nearest neighbour classification rule has been applied for assessment of the performances of the two ECG feature sets with the MIT-BIH arrhythmia database for QRS classification in five heartbeat types (normal beats, left and right bundle branch blocks, premature ventricular contractions and paced beats), as well as with five learning datasets-one general learning set (GLS, containing 424 heartbeats) and four local sets (GLS+about 0.5, 3, 6, 12 min from the beginning of the ECG recording). The achieved accuracies by the two methods are sufficiently high and do not show significant differences. Although the GLS was selected to comprise almost all types of appearing heartbeat waveforms in each file, the guaranteed accuracy (sensitivity between 90.7% and 99%, specificity between 95.5% and 99.9%) was reasonably improved when including patient-specific local learning set (sensitivity between 94.8% and 99.9%, specificity between 98.6% and 99.9%), with optimal size found to be about 3 min. The repeating waveforms, like normal beats, blocks, paced beats are better classified by the Matching Pursuits time-frequency descriptors, while the wide variety of bizarre premature ventricular contractions are better recognized by the morphological descriptors.

Algorithms↗

PubMed2005

A spatially adaptive nonparametric regression image deblurring.

We propose a novel nonparametric regression metthod for deblurring noisy images. The method is based on the local polynomial approximation (LPA) of the image and the paradigm of intersecting confidence intervals (ICI) that is applied to define the adaptive varying scales (window sizes) of the LPA estimators. The LPA-ICI algorithm is nonlinear and spatially adaptive with respect to smoothness and irregularities of the image corrupted by additive noise. Multiresolution wavelet algorithms produce estimates which are combined from different scale projections. In contrast to them, the proposed ICI algorithm gives a varying scale adaptive estimate defining a single best scale for each pixel. In the new algorithm, the actual filtering is performed in signal domain while frequency domain Fourier transform operations are applied only for calculation of convolutions. The regularized inverse and Wiener inverse filters serve as deblurring operators used jointly with the LPA-design directional kernel filters. Experiments demonstrate the state-of-art performance of the new estimators which visually and quantitatively outperform some of the best existing methods.

Algorithms↗

PubMed2003

An adjustable aperiodic model class of genomic interactions using continuous time Boolean networks (Boolean delay equations).

Following the complete sequencing of several genomes, interest has grown in the construction of genetic regulatory networks, which attempt to describe how different genes work together in both normal and abnormal cells. This interest has led to significant research in the behavior of abstract network models, with Boolean networks emerging as one particularly popular type. An important limitation of these networks is that their time evolution is necessarily periodic, motivating our interest in alternatives that are capable of a wider range of dynamic behavior. In this paper we examine one such class, that of continuous-time Boolean networks, a special case of the class of Boolean delay equations (BDEs) proposed for climatic and seismological modeling. In particular, we incorporate a biologically motivated refractory period into the dynamic behavior of these networks, which exhibit binary values like traditional Boolean networks, but which, unlike Boolean networks, evolve in continuous time. In this way, we are able to overcome both computational and theoretical limitations of the general class of BDEs while still achieving dynamics that are either aperiodic or effectively so, with periods many orders of magnitude longer than those of even large discrete time Boolean networks.

Computer Simulation↗