Seizure source localization using a hybrid second order blind identification and extended rival penalized competitive learning algorithm

Localization of seizure sources prior to neurosurgery is crucial. In this paper, a new method is proposed to localize the seizure sources from multi-channel electroencephalogram (EEG) signals. Blind source separation based on second order blind identification (SOBI) is primarily applied to estimate the brain source signals in each window of the EEG signals. A new clustering method based on rival penalized competitive learning (RPCL) is then developed to cluster the rows of the estimated unmixing matrices in all the windows. The algorithm also includes pre and post-processing stages. By multiplying each cluster center to the EEG signals, the brain signal sources are approximated. According to a complexity value measure, the main seizure source signal is separated from the others. This signal is projected back to the electrodes’ space and is subjected to the dipole source localization using a single dipole model. The simulation results verify the accuracy of the system. In addition, correct localization of the seizure source is consistent with the clinical tests derived using the simultaneous intracranial recordings.     

Best harmony, unified RPCL and automated model selection for unsupervised and supervised learning on Gaussian mixtures, three-layer nets and ME-RBF-SVM models

After introducing the fundamentals of BYY system and harmony learning, which has been developed in past several years as a unified statistical framework for parameter learning, regularization and model selection, we systematically discuss this BYY harmony learning on systems with discrete inner-representations. First, we shown that one special case leads to unsupervised learning on Gaussian mixture. We show how harmony learning not only leads us to the EM algorithm for maximum likelihood (ML) learning and the corresponding extended KMEAN algorithms for Mahalanobis clustering with criteria for selecting the number of Gaussians or clusters, but also provides us two new regularization techniques and a unified scheme that includes the previous rival penalized competitive learning (RPCL) as well as its various variants and extensions that performs model selection automatically during parameter learning. Moreover, as a by-product, we also get a new approach for determining a set of 'supporting vectors' for Parzen window density estimation. Second, we shown that other special cases lead to three typical supervised learning models with several new results. On three layer net, we get (i) a new regularized ML learning, (ii) a new criterion for selecting the number of hidden units, and (iii) a family of EM-like algorithms that combines harmony learning with new techniques of regularization. On the original and alternative models of mixture-of-expert (ME) as well as radial basis function (RBF) nets, we get not only a new type of criteria for selecting the number of experts or basis functions but also a new type of the EM-like algorithms that combines regularization techniques and RPCL learning for parameter learning with either least complexity nature on the original ME model or automated model selection on the alternative ME model and RBF nets. Moreover, all the results for the alternative ME model are also applied to other two popular nonparametric statistical approaches, namely kernel regression and supporting vector machine. Particularly, not only we get an easily implemented approach for determining the smoothing parameter in kernel regression, but also we get an alternative approach for deciding the set of supporting vectors in supporting vector machine.     

Reduced renal plasma clearance does not explain increased plasma asymmetric dimethylarginine in hypertensive subjects with mild to moderate renal insufficiency

Plasma concentrations of the nitric oxide synthase inhibitor asymmetric dimethylarginine (ADMA) and symmetric dimethylarginine (SDMA) increase already in the early stages of renal insufficiency. There is no agreement as to whether reduced renal plasma clearance (RPCL) contributes to this increase. Therefore, we investigated the relationship between estimated glomerular filtration rate (eGFR), RPCL, and plasma ADMA and SDMA in essential hypertensive patients with mild to moderate renal insufficiency. In 171 patients who underwent renal angiography, we drew blood samples from the aorta and both renal veins and measured mean renal blood flow (MRBF) using the (133)Xe washout technique. RPCL was calculated using arteriovenous concentration differences and MRBF. After correction for potential confounders, reduced eGFR was associated with higher plasma ADMA and SDMA [standardized regression coefficient (β) = -0.22 (95% confidence intervals: -0.41, -0.04) and β = -0.66 (95% confidence intervals: -0.83, -0.49), respectively]. However, eGFR was not independently associated with RPCL of ADMA. Moreover, reduced RPCL of ADMA was not associated with higher plasma ADMA. Contrary to ADMA, reduced eGFR was indeed associated with lower RPCL of SDMA [β = 0.21 (95% confidence intervals: 0.02, 0.40)]. In conclusion, our findings indicate that RPCL of ADMA is independent of renal function in hypertensive patients with mild to moderate renal insufficiency. Unlike the case for SDMA, reduced RPCL of ADMA is of minor importance for the increase in plasma ADMA in these patients, which indicates that increased plasma ADMA in this population is not a direct consequence of the kidneys failing as a plasma ADMA-regulating organ.     

Pattern classification of phylogeny signals

In this paper we propose the minimum entropy clustering (MEC) method for clustering genes based on their phylogenetic signals. This entropy based method will cluster two genes together when their concatenation can decrease the entropy. An integral feature of MEC is that it chooses the number of clusters automatically, which is a major advantage over the other methods. Our simulation results show that this method is quite successful in clustering genes with a common phylogeny.     

An unsupervised hierarchical dynamic self-organizing approach to cancer class discovery and marker gene identification in microarray data

MOTIVATION: Current Self-Organizing Maps (SOMs) approaches to gene expression pattern clustering require the user to predefine the number of clusters likely to be expected. Hierarchical clustering methods used in this area do not provide unique partitioning of data. We describe an unsupervised dynamic hierarchical self-organizing approach, which suggests an appropriate number of clusters, to perform class discovery and marker gene identification in microarray data. In the process of class discovery, the proposed algorithm identifies corresponding sets of predictor genes that best distinguish one class from other classes. The approach integrates merits of hierarchical clustering with robustness against noise known from self-organizing approaches. RESULTS: The proposed algorithm applied to DNA microarray data sets of two types of cancers has demonstrated its ability to produce the most suitable number of clusters. Further, the corresponding marker genes identified through the unsupervised algorithm also have a strong biological relationship to the specific cancer class. The algorithm tested on leukemia microarray data, which contains three leukemia types, was able to determine three major and one minor cluster. Prediction models built for the four clusters indicate that the prediction strength for the smaller cluster is generally low, therefore labelled as uncertain cluster. Further analysis shows that the uncertain cluster can be subdivided further, and the subdivisions are related to two of the original clusters. Another test performed using colon cancer microarray data has automatically derived two clusters, which is consistent with the number of classes in data (cancerous and normal). AVAILABILITY: JAVA software of dynamic SOM tree algorithm is available upon request for academic use. SUPPLEMENTARY INFORMATION: A comparison of rectangular and hexagonal topologies for GSOM is available from http://www.mame.mu.oz.au/mechatronics/journalinfo/Hsu2003supp.pdf     

Noise reduction from genotyping microarrays using probe level information

Genomic copy number change is one of the important phenomenon observed in cancer and other genetic disorders. Recently oligonucleotide microarrays have been used to analyze changes in the copy number. Although high density microarrays provide genome wide useful data on copy number, they are often associated with substantial amount of experimental noise that could affect the performance of the analyses. We used the high density oligonucleotide genotyping microarrays in our experiments that uses redundant probe tiling approach for individual SNPs. We found that the noise in the genotyping microarray data is associated with several experimental steps during target preparation and devised an algorithm that takes into account those experimental parameters. Additionally, defective probes that do not hybridize well to the target and therefore could not be modified inherently were detected and omitted automatically by using the algorithm. When we applied the algorithm to actual datasets, we could reduce the noise substantially without compressing the dynamic range. Additionally, combinatorial use of our noise reduction algorithm and conventional breakpoint detection algorithm successfully detected a microamplification of c-myc which was overlooked in the raw data. The algorithm described here is freely available with the software upon request to all non-profit researchers.     

A graph-based clustering method applied to protein sequences

The number of amino acid sequences is increasing very rapidly in the protein databases like Swiss-Prot, Uniprot, PIR and others, but the structure of only some amino acid sequences are found in the Protein Data Bank. Thus, an important problem in genomics is automatically clustering homologous protein sequences when only sequence information is available. Here, we use graph theoretic techniques for clustering amino acid sequences. A similarity graph is defined and clusters in that graph correspond to connected subgraphs. Cluster analysis seeks grouping of amino acid sequences into subsets based on distance or similarity score between pairs of sequences. Our goal is to find disjoint subsets, called clusters, such that two criteria are satisfied: homogeneity: sequences in the same cluster are highly similar to each other; and separation: sequences in different clusters have low similarity to each other. We tested our method on several subsets of SCOP (Structural Classification of proteins) database, a gold standard for protein structure classification. The results show that for a given set of proteins the number of clusters we obtained is close to the superfamilies in that set; there are fewer singeltons; and the method correctly groups most remote homologs.     

Blind noise reduction for multisensory signals using ICA and subspace filtering, with application to EEG analysis

 In many applications of signal processing, especially in communications and biomedicine, preprocessing is necessary to remove noise from data recorded by multiple sensors. Typically, each sensor or electrode measures the noisy mixture of original source signals. In this paper a noise reduction technique using independent component analysis (ICA) and subspace filtering is presented. In this approach we apply subspace filtering not to the observed raw data but to a demixed version of these data obtained by ICA. Finite impulse response filters are employed whose vectors are parameters estimated based on signal subspace extraction. ICA allows us to filter independent components. After the noise is removed we reconstruct the enhanced independent components to obtain clean original signals; i.e., we project the data to sensor level. Simulations as well as real application results for EEG-signal noise elimination are included to show the validity and effectiveness of the proposed approach. Received: 6 November 2000 / Accepted in revised form: 12 November 2001     

Molecular dissection of a specific nuclear domain: the chromatin region of the ribosomal gene cluster in Xenopus laevis.

Molecular dissection of the nuclear domain corresponding to the ribosomal chromatin cluster was investigated. The experimental scheme was based on the ability of restriction enzymes to digest the whole genome without affecting this region (several megabases in length). Such a strategy involved the judicious choice of restriction enzymes, which is possible in Xenopus laevis, where the rDNA sequence is known and the repeated units are organized into one unique cluster. SalI, XhoI, and EcoRV digestion produced frequent cutting of the genome leaving the ribosomal cluster intact. Isolation of the rDNA cluster was confirmed by separation of the digested DNA by pulsed-field electrophoresis. When applied to purified nuclei, this approach allowed the isolation of the ribosomal chromatin cluster under very mild conditions: no cleavages (either enzymatic or mechanical) were detectable. Since the purification scheme depends only on the DNA sequence outside of the rDNA cluster, it permits the obtention of this domain in different functional states. Electron microscopic analysis demonstrated that the domain organization is substantially preserved and maintains its looped organization (the size and the full number of loops were preserved). This purification scheme provides a powerful tool for studying the structure-function relationships within the ribosomal nuclear domain.     

Data-based stochastic modeling reveals sources of activity bursts in single-cell TGF-β signaling

Cells sense their surrounding by employing intracellular signaling pathways that transmit hormonal signals from the cell membrane to the nucleus. TGF-β/SMAD signaling encodes various cell fates, controls tissue homeostasis and is deregulated in diseases such as cancer. The pathway shows strong heterogeneity at the single-cell level, but quantitative insights into mechanisms underlying fluctuations at various time scales are still missing, partly due to inefficiency in the calibration of stochastic models that mechanistically describe signaling processes. In this work we analyze single-cell TGF-β/SMAD signaling and show that it exhibits temporal stochastic bursts which are dose-dependent and whose number and magnitude correlate with cell migration. We propose a stochastic modeling approach to mechanistically describe these pathway fluctuations with high computational efficiency. Employing high-order numerical integration and fitting to burst statistics we enable efficient quantitative parameter estimation and discriminate models that assume noise in different reactions at the receptor level. This modeling approach suggests that stochasticity in the internalization of TGF-β receptors into endosomes plays a key role in the observed temporal bursting. Further, the model predicts the single-cell dynamics of TGF-β/SMAD signaling in untested conditions, e.g., successfully reflects memory effects of signaling noise and cellular sensitivity towards repeated stimulation. Taken together, our computational framework based on burst analysis, noise modeling and path computation scheme is a suitable tool for the data-based modeling of complex signaling pathways, capable of identifying the source of temporal noise.     

A new method for the extraction of fetal ECG from the dependent abdominal signals using blind source separation and adaptive noise cancellation techniques

Background

The electrocardiogram (ECG) is a diagnostic tool that records the electrical activity of the heart, and depicts it as a series of graph-like tracings, or waves. Being able to interpret these details allows diagnosis of a wide range of heart problems. Fetal electrocardiogram (FECG) extraction has an important impact in medical diagnostics during the mother pregnancy period. Since the observed FECG signals are often mixed with the maternal ECG (MECG) and the noise induced by the movement of electrodes or by mother motion, the separation process of the ECG signal sources from the observed data becomes quite complicated. One of its complexity is when the ECG sources are dependent, thus, in this paper we introduce a new approach of blind source separation (BSS) in the noisy context for both independent and dependent ECG signal source. This approach consist in denoising the observed ECG signals using a bilateral total variation (BTV) filter; then minimizing the Kullbak-Leibler divergence between copula densities to separate the FECG signal from the MECG one.

Results

We present simulation results illustrating the performance of our proposed method. We will consider many examples of independent/dependent source component signals. The results will be compared with those of the classical method called independent component analysis (ICA) under the same conditions. The accuracy of source estimation is evaluated through a criterion, called again the signal-to-noise-ratio (SNR). The first experiment shows that our proposed method gives accurate estimation of sources in the standard case of independent components, with performance around 27 dB in term of SNR. In the second experiment, we show the capability of the proposed algorithm to successfully separate two noisy mixtures of dependent source components - with classical criterion devoted to the independent case - fails, and that our method is able to deal with the dependent case with good performance.

Conclusions

In this work, we focus specifically on the separation of the ECG signal sources taken from skin two electrodes located on a pregnant woman’s body. The ECG separation is interpreted as a noisy linear BSS problem with instantaneous mixtures. Firstly, a denoising step is required to reduce the noise due to motion artifacts using a BTV filter as a very effective one-pass filter for denoising. Then, we use the Kullbak-Leibler divergence between copula densities to separate the fetal heart rate from the mother one, for both independent and dependent cases.

     

A "tagless" strategy for identification of stable protein complexes genome-wide by multidimensional orthogonal chromatographic separation and iTRAQ reagent tracking

Tandem affinity purification is the principal method for purifying and identifying stable protein complexes system-wide in whole cells. Although highly effective, this approach is laborious and impractical in organisms where genetic manipulation is not possible. Here, we propose a novel "tagless" strategy that combines multidimensional separation of endogenous complexes with mass spectrometric monitoring of their composition. In this procedure, putative protein complexes are identified based on the comigration of collections of polypeptides through multiple orthogonal separation steps. We present proof-of-principle evidence for the feasibility of key aspects of this strategy. A majority of Escherichia coli proteins are shown to remain in stable complexes during fractionation of a crude extract through three chromatographic steps. We also demonstrate that iTRAQ reagent-based tracking can quantify relative migration of polypeptides through chromatographic separation media. LC MALDI MS and MS/MS analysis of the iTRAQ-labeled peptides gave reliable relative quantification of 37 components of 13 known E. coli complexes: 95% of known complex components closely co-eluted and 57% were automatically grouped by a prototype computational clustering method. With further technological improvements in each step, we believe this strategy will dramatically improve the efficiency of the purification and identification of protein complexes in cells.     

Electro/magnetoencephalography beamforming with spatial restrictions based on sparsity

We present a source localization method for electroencephalographic (EEG) and magnetoencephalographic (MEG) data which is based on an estimate of the sparsity obtained through the eigencanceler (EIG), which is a spatial filter whose weights are constrained to lie in the noise subspace. The EIG provides rejection of directional interferences while minimizing noise contributions and maintaining specified beam pattern constraints. In our case, the EIG is used to estimate the sparsity of the signal as a function of the position, then we use this information to spatially restrict the neural sources to locations out of the sparsity maxima. As proof of the concept, we incorporate this restriction in the “classical” linearly constrained minimum variance (LCMV) source localization approach in order to enhance its performance. We present numerical examples to evaluate the proposed method using realistically simulated EEG/MEG data for different signal-to-noise (SNR) conditions and various levels of correlation between sources, as well as real EEG/MEG measurements of median nerve stimulation. Our results show that the proposed method has the potential of reducing the bias on the search of neural sources in the classical approach, as well as making it more effective in localizing correlated sources.     

A two step approach for semi-automated particle selection from low contrast cryo-electron micrographs

Over recent years advances in cryo-electron microscopy for the study of macromolecular structure have resulted in resolutions in the range 10-15 A becoming routine. With this drive for increased resolution comes the need to collect larger datasets, commonly >10,000 particle images. Manual selection of particles from micrographs is often difficult and with such large numbers of particles now involved it is also laborious and a common bottleneck. Automated methods do exist but are normally restricted to specific samples or data, i.e., spherical particles, no aggregation, high contrast, and low noise. A two step approach has been developed that remains general and can be applied to low contrast, high noise micrographs of small molecules. Specifically, application of the approach is presented using micrographs of Escherichia coli RNA polymerase, which due to low contrast and the relatively small size of the molecule prove difficult to pick manually. To test the automated approach, independent reconstructions of RNA polymerase were carried out using manual and automatically picked data. The two reconstructions are shown to be comparable and the reconstruction from the automatically picked dataset is at a higher resolution, due to an increase in the number of particles picked.     

Bayesian infinite mixture model based clustering of gene expression profiles

MOTIVATION: The biologic significance of results obtained through cluster analyses of gene expression data generated in microarray experiments have been demonstrated in many studies. In this article we focus on the development of a clustering procedure based on the concept of Bayesian model-averaging and a precise statistical model of expression data. RESULTS: We developed a clustering procedure based on the Bayesian infinite mixture model and applied it to clustering gene expression profiles. Clusters of genes with similar expression patterns are identified from the posterior distribution of clusterings defined implicitly by the stochastic data-generation model. The posterior distribution of clusterings is estimated by a Gibbs sampler. We summarized the posterior distribution of clusterings by calculating posterior pairwise probabilities of co-expression and used the complete linkage principle to create clusters. This approach has several advantages over usual clustering procedures. The analysis allows for incorporation of a reasonable probabilistic model for generating data. The method does not require specifying the number of clusters and resulting optimal clustering is obtained by averaging over models with all possible numbers of clusters. Expression profiles that are not similar to any other profile are automatically detected, the method incorporates experimental replicates, and it can be extended to accommodate missing data. This approach represents a qualitative shift in the model-based cluster analysis of expression data because it allows for incorporation of uncertainties involved in the model selection in the final assessment of confidence in similarities of expression profiles. We also demonstrated the importance of incorporating the information on experimental variability into the clustering model. AVAILABILITY: The MS Windows(TM) based program implementing the Gibbs sampler and supplemental material is available at http://homepages.uc.edu/~medvedm/BioinformaticsSupplement.htm CONTACT: medvedm@email.uc.edu     

Hypotheses generation as supervised link discovery with automated class labeling on large-scale biomedical concept networks

Computational approaches to generate hypotheses from biomedical literature have been studied intensively in recent years. Nevertheless, it still remains a challenge to automatically discover novel, cross-silo biomedical hypotheses from large-scale literature repositories. In order to address this challenge, we first model a biomedical literature repository as a comprehensive network of biomedical concepts and formulate hypotheses generation as a process of link discovery on the concept network. We extract the relevant information from the biomedical literature corpus and generate a concept network and concept-author map on a cluster using Map-Reduce frame-work. We extract a set of heterogeneous features such as random walk based features, neighborhood features and common author features. The potential number of links to consider for the possibility of link discovery is large in our concept network and to address the scalability problem, the features from a concept network are extracted using a cluster with Map-Reduce framework. We further model link discovery as a classification problem carried out on a training data set automatically extracted from two network snapshots taken in two consecutive time duration. A set of heterogeneous features, which cover both topological and semantic features derived from the concept network, have been studied with respect to their impacts on the accuracy of the proposed supervised link discovery process. A case study of hypotheses generation based on the proposed method has been presented in the paper.     

Brain structure and spatial sensitivity profile assessing by near‐infrared spectroscopy modeling based on 3D MRI data

The goal of this study is to prove that the light propagation in the head by used the 3‐D optical model from in vivo MRI data set can also provide significant characteristics on the spatial sensitivity of cerebral cortex folding geometry based on Monte Carlo simulation. Thus, we proposed a MRI based approach for 3‐D brain modeling of near‐infrared spectroscopy (NIRS). In the results, the spatial sensitivity profile of the cerebral cortex folding geometry and the arrangement of source‐detector separation have being necessarily considered for applications of functional NIRS. The optimal choice of source‐detector separation is suggested within 3–3.5 cm by the received intensity with different source‐detector separations and the ratio of received light from the gray and white matter layer is greater than 50%. Additionally, this study has demonstrated the capability of NIRS in not only assessing the functional but also detecting the structural change of the brain by taking advantage of the low scattering and absorption coefficients observed in CSF of sagittal view. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Nonequilibrium voltage fluctuations in biological membranes. I. General framework of charge transport in discrete systems and related voltage noise

This paper continues our work on the theory of nonequilibrium voltage noise generated by electric transport processes in membranes. Introducing the membrane voltage as a further variable, a system of kinetic equations linearized in voltage is derived by which generally the time-dependent behaviour of charge-transport processes under varying voltage can be discussed. Using these equations, the treatment of voltage noise can be based on the usual master equation approach to steady-state fluctuations of scalar quantities. Thus, a general theoretical approach to nonequilibrium voltage noise is presented, completing our approach to current fluctuations which had been developed some years ago. It is explicitly shown that at equilibrium the approach yields agreement with the Nyquist relation, while at nonequilibrium this relation is not valid. A further general property of voltage noise is the reduction of low-frequency noise with increasing number of transport units as a consequence of the interactions via the electric field. In a second paper, the approach will be applied for a number of special transport mechanisms, such as ionic channels, carriers or electrogenic pumps.     

Efficient computation of approximate gene clusters based on reference occurrences

Whole genome comparison based on the analysis of gene cluster conservation has become a popular approach in comparative genomics. While gene order and gene content as a whole randomize over time, it is observed that certain groups of genes which are often functionally related remain co-located across species. However, the conservation is usually not perfect which turns the identification of these structures, often referred to as approximate gene clusters, into a challenging task. In this article, we present an efficient set distance based approach that computes approximate gene clusters by means of reference occurrences. We show that it yields highly comparable results to the corresponding non-reference based approach, while its polynomial runtime allows for approximate gene cluster detection in parameter ranges that used to be feasible only with simpler, e.g., max-gap based, gene cluster models. To illustrate further the performance and predictive power of our algorithm, we compare it to a state-of-the art approach for max-gap gene cluster computation.