A novel method for automated EMG decomposition and MUAP classification.

OBJECTIVE: This paper proposes a novel method for the extraction and classification of individual motor unit action potentials (MUAPs) from intramuscular electromyographic signals. METHODOLOGY: The proposed method automatically detects the number of template MUAP clusters and classifies them into normal, neuropathic or myopathic. It consists of three steps: (i) preprocessing of electromyogram (EMG) recordings, (ii) MUAP detection and clustering and (iii) MUAP classification. RESULTS: The approach has been validated using a dataset of EMG recordings and an annotated collection of MUAPs. The correct identification rate for MUAP clustering is 93, 95 and 92% for normal, myopathic and neuropathic, respectively. Ninety-one percent of the superimposed MUAPs were correctly identified. The obtained accuracy for MUAP classification is about 86%. CONCLUSION: The proposed method, apart from efficient EMG decomposition addresses automatic MUAP classification to neuropathic, myopathic or normal classes directly from raw EMG signals.

Mixture model analysis of DNA microarray images.

In this paper, we propose a new methodology for analysis of microarray images. First, a new gridding algorithm is proposed for determining the individual spots and their borders. Then, a Gaussian mixture model (GMM) approach is presented for the analysis of the individual spot images. The main advantages of the proposed methodology are modeling flexibility and adaptability to the data, which are well-known strengths of GMM. The maximum likelihood and maximum a posteriori approaches are used to estimate the GMM parameters via the expectation maximization algorithm. The proposed approach has the ability to detect and compensate for artifacts that might occur in microarray images. This is accomplished by a model-based criterion that selects the number of the mixture components. We present numerical experiments with artificial and real data where we compare the proposed approach with previous ones and existing software tools for microarray image analysis and demonstrate its advantages.

Characterization of clustered microcalcifications in digitized mammograms using neural networks and support vector machines.

OBJECTIVE: Detection and characterization of microcalcification clusters in mammograms is vital in daily clinical practice. The scope of this work is to present a novel computer-based automated method for the characterization of microcalcification clusters in digitized mammograms. METHODS AND MATERIAL: The proposed method has been implemented in three stages: (a) the cluster detection stage to identify clusters of microcalcifications, (b) the feature extraction stage to compute the important features of each cluster and (c) the classification stage, which provides with the final characterization. In the classification stage, a rule-based system, an artificial neural network (ANN) and a support vector machine (SVM) have been implemented and evaluated using receiver operating characteristic (ROC) analysis. The proposed method was evaluated using the Nijmegen and Mammographic Image Analysis Society (MIAS) mammographic databases. The original feature set was enhanced by the addition of four rule-based features. RESULTS AND CONCLUSIONS: In the case of Nijmegen dataset, the performance of the SVM was Az=0.79 and 0.77 for the original and enhanced feature set, respectively, while for the MIAS dataset the corresponding characterization scores were Az=0.81 and 0.80. Utilizing neural network classification methodology, the corresponding performance for the Nijmegen dataset was Az=0.70 and 0.76 while for the MIAS dataset it was Az=0.73 and 0.78. Although the obtained high classification performance can be successfully applied to microcalcification clusters characterization, further studies must be carried out for the clinical evaluation of the system using larger datasets. The use of additional features originating either from the image itself (such as cluster location and orientation) or from the patient data may further improve the diagnostic value of the system.

A spatially constrained mixture model for image segmentation.

Gaussian mixture models (GMMs) constitute a well-known type of probabilistic neural networks. One of their many successful applications is in image segmentation, where spatially constrained mixture models have been trained using the expectation-maximization (EM) framework. In this letter, we elaborate on this method and propose a new methodology for the M-step of the EM algorithm that is based on a novel constrained optimization formulation. Numerical experiments using simulated images illustrate the superior performance of our method in terms of the attained maximum value of the objective function and segmentation accuracy compared to previous implementations of this approach.

A sequential method for discovering probabilistic motifs in proteins.

OBJECTIVES: This paper proposes a greedy algorithm for learning a mixture of motifs model through likelihood maximization, in order to discover common substrings, known as motifs, from a given collection of related biosequences. METHODS: The approach sequentially adds a new motif component to a mixture model by performing a combined scheme of global and local search for appropriately initializing the component parameters. A hierarchical clustering scheme is also applied initially which leads to the identification of candidate motif models and speeds up the global searching procedure. RESULTS: The performance of the proposed algorithm has been studied in both artificial and real biological datasets. In comparison with the well-known MEME approach, the algorithm is advantageous since it identifies motifs with significant conservation and produces larger protein fingerprints. CONCLUSION: The proposed greedy algorithm constitutes a promising approach for discovering multiple probabilistic motifs in biological sequences. By using an effective incremental mixture modeling strategy, our technique manages to successfully overcome the limitation of the MEME scheme which erases motif occurrences each time a new motif is discovered.

An automatic microcalcification detection system based on a hybrid neural network classifier.

A hybrid intelligent system is presented for the identification of microcalcification clusters in digital mammograms. The proposed method is based on a three-step procedure: (a) preprocessing and segmentation, (b) regions of interest (ROI) specification, and (c) feature extraction and classification. The reduction of false positive cases is performed using an intelligent system containing two sub-systems: a rule-based and a neural network sub-system. In the first step of the classification schema 22 features are automatically computed which refer either to individual microcalcifications or to groups of them. Further reduction in the number of features is achieved through principal component analysis (PCA). The proposed methodology is tested using the Nijmegen and the Mammographic Image Analysis Society (MIAS) mammographic databases. Results are presented as the receiver operating characteristic (ROC) performance and are quantified by the area under the ROC curve (A(z)). In particular, the A(z) value for the Nijmegen dataset is 0.91 and for the MIAS is 0.92. The detection specificity of the two sets is 1.80 and 1.15 false positive clusters per image, at the sensitivity level higher than 0.90, respectively.

A knowledge-based technique for automated detection of ischaemic episodes in long duration electrocardiograms.

A novel method for the detection of ischaemic episodes in long duration ECGs is proposed. It includes noise handling, feature extraction, rule-based beat classification, sliding window classification and ischaemic episode identification, all integrated in a four-stage procedure. It can be executed in real time and is able to provide explanations for the diagnostic decisions obtained. The method was tested on the ESC ST-T database and high scores were obtained for both sensitivity and positive predictive accuracy (93.8% and 78.5% respectively using aggregate gross statistics, and 90.7% and 80.7% using aggregate average statistics).

Shared kernel models for class conditional density estimation.

We present probabilistic models which are suitable for class conditional density estimation and can be regarded as shared kernel models where sharing means that each kernel may contribute to the estimation of the conditional densities of an classes. We first propose a model that constitutes an adaptation of the classical radial basis function (RBF) network (with full sharing of kernels among classes) where the outputs represent class conditional densities. In the opposite direction is the approach of separate mixtures model where the density of each class is estimated using a separate mixture density (no sharing of kernels among classes). We present a general model that allows for the expression of intermediate cases where the degree of kernel sharing can be specified through an extra model parameter. This general model encompasses both the above mentioned models as special cases. In all proposed models the training process is treated as a maximum likelihood problem and expectation-maximization algorithms have been derived for adjusting the model parameters.

Neural-network methods for boundary value problems with irregular boundaries.

Partial differential equations (PDEs) with boundary conditions (Dirichlet or Neumann) defined on boundaries with simple geometry have been successfully treated using sigmoidal multilayer perceptrons in previous works. This article deals with the case of complex boundary geometry, where the boundary is determined by a number of points that belong to it and are closely located, so as to offer a reasonable representation. Two networks are employed: a multilayer perceptron and a radial basis function network. The later is used to account for the exact satisfaction of the boundary conditions. The method has been successfully tested on two-dimensional and three-dimensional PDEs and has yielded accurate results.

A reinforcement learning approach to online clustering.

A general technique is proposed for embedding online clustering algorithms based on competitive learning in a reinforcement learning framework. The basic idea is that the clustering system can be viewed as a reinforcement learning system that learns through reinforcements to follow the clustering strategy we wish to implement. In this sense, the reinforcement guided competitive learning (RGCL) algorithm is proposed that constitutes a reinforcement-based adaptation of learning vector quantization (LVQ) with enhanced clustering capabilities. In addition, we suggest extensions of RGCL and LVQ that are characterized by the property of sustained exploration and significantly improve the performance of those algorithms, as indicated by experimental tests on well-known data sets.

Artificial neural networks for solving ordinary and partial differential equations.

We present a method to solve initial and boundary value problems using artificial neural networks. A trial solution of the differential equation is written as a sum of two parts. The first part satisfies the initial/boundary conditions and contains no adjustable parameters. The second part is constructed so as not to affect the initial/boundary conditions. This part involves a feedforward neural network containing adjustable parameters (the weights). Hence by construction the initial/boundary conditions are satisfied and the network is trained to satisfy the differential equation. The applicability of this approach ranges from single ordinary differential equations (ODE's), to systems of coupled ODE's and also to partial differential equations (PDE's). In this article, we illustrate the method by solving a variety of model problems and present comparisons with solutions obtained using the Galekrkin finite element method for several cases of partial differential equations. With the advent of neuroprocessors and digital signal processors the method becomes particularly interesting due to the expected essential gains in the execution speed.

Group updates and multiscaling: an efficient neural network approach to combinatorial optimization.

A multiscale method is described in the context of binary Hopfield-type neural networks. The appropriateness of the proposed technique for solving several classes of optimization problems is established by means of the notion of group update which is introduced here and investigated in relation to the properties of multiscaling. The method has been tested in the solution of partitioning and covering problems, for which an original mapping to Hopfield-type neural networks has been developed. Experimental results indicate that the multiscale approach is very effective in exploring the state-space of the problem and providing feasible solutions of acceptable quality, while at the same it offers a significant acceleration.