Coordinate-Descent Adaptation over Hamiltonian Multi-Agent Networks.

The incremental least-mean-square (ILMS) algorithm is a useful method to perform distributed adaptation and learning in Hamiltonian networks. To implement the ILMS algorithm, each node needs to receive the local estimate of the previous node on the cycle path to update its own local estimate. However, in some practical situations, perfect data exchange may not be possible among the nodes. In this paper, we develop a new version of ILMS algorithm, wherein in its adaptation step, only a random subset of the coordinates of update vector is available. We draw a comparison between the proposed coordinate-descent incremental LMS (CD-ILMS) algorithm and the ILMS algorithm in terms of convergence rate and computational complexity. Employing the energy conservation relation approach, we derive closed-form expressions to describe the learning curves in terms of excess mean-square-error (EMSE) and mean-square deviation (MSD). We show that, the CD-ILMS algorithm has the same steady-state error performance compared with the ILMS algorithm. However, the CD-ILMS algorithm has a faster convergence rate. Numerical examples are given to verify the efficiency of the CD-ILMS algorithm and the accuracy of theoretical analysis.

Probability mapping based artifact detection and removal from single-channel EEG signals for brain-computer interface applications.

BACKGROUND: Different types of artifacts in the electroencephalogram (EEG) signals can considerably reduce the performance of the later-stage EEG analysis algorithms for making decisions, such as those for brain-computer interfacing (BCI) classification. In this paper, we address the problem of artifact detection and removal from single-channel EEG signals. NEW METHOD: We propose a novel approach that maps the probability of an EEG epoch to be artifactual based on four different statistical measures: entropy (a measure of uncertainty), kurtosis (a measure of peakedness), skewness (a measure of asymmetry), and periodic waveform index (a measure of periodicity). Then, a stationary wavelet transform based artifact removal is proposed that employs a particular probability threshold provided by the user. RESULTS: We have executed our experiments with both synthetic and real EEG data. It is observed that the proposed method exhibits a superior performance for suppressing the artifact contaminated from EEG with minimum distortion. Moreover, evaluation of the algorithm using EEG dataset for BCI experiments reveals that artifact removal can considerably improve the BCI output in both event-related potential and motor-imagery based BCI applications. COMPARISON WITH EXISTING METHODS: The proposed algorithm has been applied to both real and synthesized data testing and compared with other state-of-the-art automated artifact removal methods. Its superior performance is verified in terms of various performance metrics including computational complexity for justifying its use in BCI-like real-time applications. CONCLUSION: Our work is expected to be useful for future research EEG signal processing and eventually to develop more accurate real-time EEG-based BCI applications.

Partial Diffusion Kalman Filtering for Distributed State Estimation in Multiagent Networks.

Many problems in multiagent networks can be solved through distributed learning (state estimation) of linear dynamical systems. In this paper, we develop a partial-diffusion Kalman filtering (PDKF) algorithm, as a fully distributed solution for state estimation in the multiagent networks with limited communication resources. In the PDKF algorithm, every agent (node) is allowed to share only a subset of its intermediate estimate vectors with its neighbors at each iteration, reducing the amount of internode communications. We analyze the stability of the PDKF algorithm and show that the algorithm is stable and convergent in both mean and mean-square senses. We also derive a closed-form expression for the steady-state mean-square deviation criterion. Furthermore, we show theoretically and by numerical examples that the PDKF algorithm provides a trade-off between the estimation performance and the communication cost that is extremely profitable.

A distributed algorithm for demand-side management: Selling back to the grid.

Demand side energy consumption scheduling is a well-known issue in the smart grid research area. However, there is lack of a comprehensive method to manage the demand side and consumer behavior in order to obtain an optimum solution. The method needs to address several aspects, including the scale-free requirement and distributed nature of the problem, consideration of renewable resources, allowing consumers to sell electricity back to the main grid, and adaptivity to a local change in the solution point. In addition, the model should allow compensation to consumers and ensurance of certain satisfaction levels. To tackle these issues, this paper proposes a novel autonomous demand side management technique which minimizes consumer utility costs and maximizes consumer comfort levels in a fully distributed manner. The technique uses a new logarithmic cost function and allows consumers to sell excess electricity (e.g. from renewable resources) back to the grid in order to reduce their electric utility bill. To develop the proposed scheme, we first formulate the problem as a constrained convex minimization problem. Then, it is converted to an unconstrained version using the segmentation-based penalty method. At each consumer location, we deploy an adaptive diffusion approach to obtain the solution in a distributed fashion. The use of adaptive diffusion makes it possible for consumers to find the optimum energy consumption schedule with a small number of information exchanges. Moreover, the proposed method is able to track drifts resulting from changes in the price parameters and consumer preferences. Simulations and numerical results show that our framework can reduce the total load demand peaks, lower the consumer utility bill, and improve the consumer comfort level.

Methods for artifact detection and removal from scalp EEG: A review.

Electroencephalography (EEG) is the most popular brain activity recording technique used in wide range of applications. One of the commonly faced problems in EEG recordings is the presence of artifacts that come from sources other than brain and contaminate the acquired signals significantly. Therefore, much research over the past 15 years has focused on identifying ways for handling such artifacts in the preprocessing stage. However, this is still an active area of research as no single existing artifact detection/removal method is complete or universal. This article presents an extensive review of the existing state-of-the-art artifact detection and removal methods from scalp EEG for all potential EEG-based applications and analyses the pros and cons of each method. First, a general overview of the different artifact types that are found in scalp EEG and their effect on particular applications are presented. In addition, the methods are compared based on their ability to remove certain types of artifacts and their suitability in relevant applications (only functional comparison is provided not performance evaluation of methods). Finally, the future direction and expected challenges of current research is discussed. Therefore, this review is expected to be helpful for interested researchers who will develop and/or apply artifact handling algorithm/technique in future for their applications as well as for those willing to improve the existing algorithms or propose a new solution in this particular area of research.

A 16-Channel Nonparametric Spike Detection ASIC Based on EC-PC Decomposition.

In extracellular neural recording experiments, detecting neural spikes is an important step for reliable information decoding. A successful implementation in integrated circuits can achieve substantial data volume reduction, potentially enabling a wireless operation and closed-loop system. In this paper, we report a 16-channel neural spike detection chip based on a customized spike detection method named as exponential component-polynomial component (EC-PC) algorithm. This algorithm features a reliable prediction of spikes by applying a probability threshold. The chip takes raw data as input and outputs three data streams simultaneously: field potentials, band-pass filtered neural data, and spiking probability maps. The algorithm parameters are on-chip configured automatically based on input data, which avoids manual parameter tuning. The chip has been tested with both in vivo experiments for functional verification and bench-top experiments for quantitative performance assessment. The system has a total power consumption of 1.36 mW and occupies an area of 6.71 mm (2) for 16 channels. When tested on synthesized datasets with spikes and noise segments extracted from in vivo preparations and scaled according to required precisions, the chip outperforms other detectors. A credit card sized prototype board is developed to provide power and data management through a USB port.

A Wavelet-Based Artifact Reduction From Scalp EEG for Epileptic Seizure Detection.

This paper presents a method to reduce artifacts from scalp EEG recordings to facilitate seizure diagnosis/detection for epilepsy patients. The proposed method is primarily based on stationary wavelet transform and takes the spectral band of seizure activities (i.e., 0.5-29 Hz) into account to separate artifacts from seizures. Different artifact templates have been simulated to mimic the most commonly appeared artifacts in real EEG recordings. The algorithm is applied on three sets of synthesized data including fully simulated, semi-simulated, and real data to evaluate both the artifact removal performance and seizure detection performance. The EEG features responsible for the detection of seizures from nonseizure epochs have been found to be easily distinguishable after artifacts are removed, and consequently, the false alarms in seizure detection are reduced. Results from an extensive experiment with these datasets prove the efficacy of the proposed algorithm, which makes it possible to use it for artifact removal in epilepsy diagnosis as well as other applications regarding neuroscience studies.

On the robustness of EC-PC spike detection method for online neural recording.

BACKGROUND: Online spike detection is an important step to compress neural data and perform real-time neural information decoding. An unsupervised, automatic, yet robust signal processing is strongly desired, thus it can support a wide range of applications. We have developed a novel spike detection algorithm called "exponential component-polynomial component" (EC-PC) spike detection. NEW METHOD: We firstly evaluate the robustness of the EC-PC spike detector under different firing rates and SNRs. Secondly, we show that the detection Precision can be quantitatively derived without requiring additional user input parameters. We have realized the algorithm (including training) into a 0.13 µm CMOS chip, where an unsupervised, nonparametric operation has been demonstrated. RESULTS: Both simulated data and real data are used to evaluate the method under different firing rates (FRs), SNRs. The results show that the EC-PC spike detector is the most robust in comparison with some popular detectors. Moreover, the EC-PC detector can track changes in the background noise due to the ability to re-estimate the neural data distribution. COMPARISON WITH EXISTING METHODS: Both real and synthesized data have been used for testing the proposed algorithm in comparison with other methods, including the absolute thresholding detector (AT), median absolute deviation detector (MAD), nonlinear energy operator detector (NEO), and continuous wavelet detector (CWD). Comparative testing results reveals that the EP-PC detection algorithm performs better than the other algorithms regardless of recording conditions. CONCLUSION: The EC-PC spike detector can be considered as an unsupervised and robust online spike detection. It is also suitable for hardware implementation.

Artifact characterization and removal for in vivo neural recording.

BACKGROUND: In vivo neural recordings are often corrupted by different artifacts, especially in a less-constrained recording environment. Due to limited understanding of the artifacts appeared in the in vivo neural data, it is more challenging to identify artifacts from neural signal components compared with other applications. The objective of this work is to analyze artifact characteristics and to develop an algorithm for automatic artifact detection and removal without distorting the signals of interest. NEW METHOD: The proposed algorithm for artifact detection and removal is based on the stationary wavelet transform with selected frequency bands of neural signals. The selection of frequency bands is based on the spectrum characteristics of in vivo neural data. Further, to make the proposed algorithm robust under different recording conditions, a modified universal-threshold value is proposed. RESULTS: Extensive simulations have been performed to evaluate the performance of the proposed algorithm in terms of both amount of artifact removal and amount of distortion to neural signals. The quantitative results reveal that the algorithm is quite robust for different artifact types and artifact-to-signal ratio. COMPARISON WITH EXISTING METHODS: Both real and synthesized data have been used for testing the proposed algorithm in comparison with other artifact removal algorithms (e.g., ICA, wICA, wCCA, EMD-ICA, and EMD-CCA) found in the literature. Comparative testing results suggest that the proposed algorithm performs better than the available algorithms. CONCLUSION: Our work is expected to be useful for future research on in vivo neural signal processing and eventually to develop a real-time neural interface for advanced neuroscience and behavioral experiments.

A bio-inspired cooperative algorithm for distributed source localization with mobile nodes.

In this paper we propose an algorithm for distributed optimization in mobile nodes. Compared with many published works, an important consideration here is that the nodes do not know the cost function beforehand. Instead of decision-making based on linear combination of the neighbor estimates, the proposed algorithm relies on information-rich nodes that are iteratively identified. To quickly find these nodes, the algorithm adopts a larger step size during the initial iterations. The proposed algorithm can be used in many different applications, such as distributed odor source localization and mobile robots. Comparative simulation results are presented to support the proposed algorithm.