No abstract

No abstract

Artificial neural network (ANN) based signal processing methods have been shown to have significant robustness in processing complex, degraded, noisy, and unstable signals. A novel approach to automated electromyogram (EMG) signal decomposition, using an ANN processing architecture, is presented in this paper. Due to the lack of a priori knowledge of motor unit action potential (MUAP) morphology, the EMG decomposition must be performed in an unsupervised manner. An ANN classifier, consisting of a multilayer perceptron neural network and employing a novel unsupervised training strategy, is proposed. The ANN learns repetitive appearances of MUAP waveforms from their suspected occurrences in a filtered EMG signal in an autoassociative learning task. The same training waveforms are fed into the trained ANN and the output of the ANN is fed back to its input, giving rise to a dynamic retrieval net classifier. For each waveform in the data, the network discovers a feature vector associated with that waveform. For each waveform, classification is achieved by comparing its feature vector with those of the other waveforms. Firing information of each MUAP is further used to refine the classification results of the ANN classifier. Then, individual MUAP waveform shapes are derived and their firing tables are created.

Discrete-time/discrete-state recurrent neural networks are analyzed from a dynamical Boolean systems point of view in order to devise new analytic and design methods for the class of both single and multilayer recurrent artificial neural networks. With the proposed dynamical Boolean systems analysis, we are able to formulate necessary and sufficient conditions for network stability which are more general than the well-known but restrictive conditions for the class of single layer networks: (1) symmetric weight matrix with (2) positive diagonal and (3) asynchronous update. In terms of design, we use a dynamical Boolean systems analysis to construct a high performance associative memory. With this Boolean memory, we can guarantee that all fundamental memories are stored, and also guarantee the size of the basin of attraction for each fundamental memory.

No abstract