Search

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

To satisfy the requirement of quality control in printing and packaging industry, a sheet counting apparatus is developed, which adopts a line-scan camera to image the fringes of sheet stack and is able to provide a real-time and noncontact measurement of their quantity. With a brief introduction of the system architecture, our main work focuses on the sheet counting algorithms. The basic principle is to identify each sheet profile from the 1-D image with a robust ridge strength measurement. First, a multiscale bi-Gaussian ridge likelihood measurement and a ridge-valley descriptor are utilized to improve adjacent objects detection by increasing local contrast around sheet fringes. Then, a sheet recognition scheme, which integrates a peak detection algorithm and the ridge region criteria for verification, is proposed to discriminate true sheets from the obtained ridgeness measure. According to experiments and tests in real production lines, our apparatus can reach a very high measuring accuracy for printing papers or cards with a thickness not <0.2 mm. [ABSTRACT FROM PUBLISHER]

High quality scholarship requires technical excellence but also connects the work to the primary references in the field. In this way, the reader advances their knowledge and gains perspective. The TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING supports these goals by recognizing the best paper chosen by the Associate Editors and reviewers. The winning paper was selected from 140 papers published by TSM in 2015. The winner is “An Algorithm of Multi-Subpopulation Parameters With Hybrid Estimation of Distribution for Semiconductor Scheduling With Constrained Waiting Time” by Hung-Kai Wang, Chen-Fu Chien, and Mitsuo Gen published in the August 2015 issue of the IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING (10.1109/TSM.2015.2439054). I congratulate the authors on their selection. [ABSTRACT FROM AUTHOR]

Many challenges exist in the study of using orthotics, exoskeletons or exosuits as tools for rehabilitation and assistance of healthy people in daily activities due to the requirements of portability and safe interaction with the user and the environment. One approach to dealing with these challenges is to design a control system that can be deployed in a portable device to identify the relationships that exist between the gait variables and gait cycle for different locomotion modes. In order to estimate the knee and ankle angles in the sagittal plane for different locomotion modes, a novel multimodal feature-decoupled kinematic estimation system consisting of a multimodal locomotion classifier and an optimal joint angle estimator is proposed in this paper. The multi-source information output from different conventional primary models are fused by assigning the non-fixed weight. To improve the performance of the primary models, a data augmentation module based on the time-frequency domain analysis method is designed. The results show that the inclusion of the data augmentation module and multi-source information fusion modules has improved the classification accuracy to 98.56% and kinematic estimation performance (PCC) to 0.904 (walking), 0.956 (running), 0.899 (stair ascent), 0.851 (stair descent), respectively. The kinematic estimation quality is generally higher for faster speed (running) or proximal joint (knee) compared to other modes and ankle. The limitations and advantages of the proposed approach are discussed. Based on our findings, the multimodal kinematic estimation system has potential in facilitating the deployment for human-in-loop control of lower-limb intelligent assistive devices.

Electroencephalogram (EEG) signals are widely utilized in the field of cognitive workload decoding (CWD). However, when the recognition scenario is shifted from subject-dependent to subject-independent or spans a long period, the accuracy of CWD deteriorates significantly. Current solutions are either dependent on extensive training datasets or fail to maintain clear distinctions between categories, additionally lacking a robust feature extraction mechanism. In this paper, we tackle these issues by proposing a Bi-Classifier Joint Domain Adaptation (BCJDA) model for EEG-based cross-time and cross-subject CWD. Specifically, the model consists of a feature extractor, a domain discriminator, and a Bi-Classifier, containing two sets of adversarial processes for domain-wise alignment and class-wise alignment. In the adversarial domain adaptation, the feature extractor is forced to learn the common domain features deliberately. The Bi-Classifier also fosters the feature extractor to retain the category discrepancies of the unlabeled domain, so that its classification boundary is consistent with the labeled domain. Furthermore, different adversarial distance functions of the Bi-Classifier are adopted and evaluated in this model. We conduct classification experiments on a publicly available BCI competition dataset for recognizing low, medium, and high cognitive workload levels. The experimental results demonstrate that our proposed BCJDA model based on cross-gradient difference maximization achieves the best performance.

Sleep staging serves as a fundamental assessment for sleep quality measurement and sleep disorder diagnosis. Although current deep learning approaches have successfully integrated multimodal sleep signals, enhancing the accuracy of automatic sleep staging, certain challenges remain, as follows: 1) optimizing the utilization of multi-modal information complementarity, 2) effectively extracting both long- and short-range temporal features of sleep information, and 3) addressing the class imbalance problem in sleep data. To address these challenges, this paper proposes a two-stream encode-decoder network, named TSEDSleepNet, which is inspired by the depth sensitive attention and automatic multi-modal fusion (DSA2F) framework. In TSEDSleepNet, a two-stream encoder is used to extract the multiscale features of electrooculogram (EOG) and electroencephalogram (EEG) signals. And a self-attention mechanism is utilized to fuse the multiscale features, generating multi-modal saliency features. Subsequently, the coarser-scale construction module (CSCM) is adopted to extract and construct multi-resolution features from the multiscale features and the salient features. Thereafter, a Transformer module is applied to capture both long- and short-range temporal features from the multi-resolution features. Finally, the long- and short-range temporal features are restored with low-layer details and mapped to the predicted classification results. Additionally, the Lovász loss function is applied to alleviate the class imbalance problem in sleep datasets. Our proposed method was tested on the Sleep-EDF-39 and Sleep-EDF-153 datasets, and it achieved classification accuracies of 88.9% and 85.2% and Macro-F1 scores of 84.8% and 79.7%, respectively, thus outperforming conventional traditional baseline models. These results highlight the efficacy of the proposed method in fusing multi-modal information. This method has potential for application as an adjunct tool for diagnosing sleep disorders.

Physical therapists play a crucial role in guiding patients through effective and safe rehabilitation processes according to medical guidelines. However, due to the therapist-patient imbalance, it is neither economical nor feasible for therapists to provide guidance to every patient during recovery sessions. Automated assessment of physical rehabilitation can help with this problem, but accurately quantifying patients' training movements and providing meaningful feedback poses a challenge. In this paper, an Expert-knowledge-based Graph Convolutional approach is proposed to automate the assessment of the quality of physical rehabilitation exercises. This approach utilizes experts' knowledge to improve the spatial feature extraction ability of the Graph Convolutional module and a Gated pooling module for feature aggregation. Additionally, a Transformer module is employed to capture long-range temporal dependencies in the movements. The attention scores and weight matrix obtained through this approach can serve as interpretability tools to help therapists understand the assessment model and assist patients in improving their exercises. The effectiveness of the proposed method is verified on the KIMORE dataset, achieving state-of-the-art performance compared to existing models. Experimental results also illustrate the interpretability of the method in both spatial and temporal dimensions.

This study presents a novel high density surface electromyography (EMG) decomposition method, named as 2CFastICA, because it incorporates two key algorithms: kernel constrained FastICA and correlation constrained FastICA. The former focuses on overcoming the local convergence of FastICA without requiring the peel-off strategy used in the progressive FastICA peel-off (PFP) framework. The latter further refines the output of kernel constrained FastICA by correcting possible erroneous or missed spikes. The two constrained FastICA algorithms supplement each other to warrant the decomposition performance. The 2CFastICA method was validated using simulated surface EMG signals with different motor unit numbers and signal to noise ratios (SNRs). Two source validation was also performed by simultaneous high density surface EMG and intramuscular EMG recordings, showing a matching rate (MR) of (97.2 ± 3.5)% for 170 common motor units. In addition, a different form of two source validation was also conducted taking advantages of the high density surface EMG characteristics of patients with amyotrophic lateral sclerosis, showing a MR of (99.4 ± 0.9)% for 34 common motor units from interference and sparse datasets. Both simulation and experimental results indicate that 2CFastICA can achieve similar decomposition performance to PFP. However, the efficiency of decomposition can be greatly improved by 2CFastICA since the complex signal processing procedures associated with the peel-off strategy are not required any more. Along with this paper, we also provide the MATLAB open source code of 2CFastICA for high density surface EMG decomposition.

The olfactory system enables humans to smell different odors, which are closely related to emotions. The high temporal resolution and non-invasiveness of Electroencephalogram (EEG) make it suitable to objectively study human preferences for odors. Effectively learning the temporal dynamics and spatial information from EEG is crucial for detecting odor-induced emotional valence. In this paper, we propose a deep learning architecture called Temporal Attention with Spatial Autoencoder Network (TASA) for predicting odor-induced emotions using EEG. TASA consists of a filter-bank layer, a spatial encoder, a time segmentation layer, a Long Short-Term Memory (LSTM) module, a multi-head self-attention (MSA) layer, and a fully connected layer. We improve upon the previous work by utilizing a two-phase learning framework, using the autoencoder module to learn the spatial information among electrodes by reconstructing the given input with a latent representation in the spatial dimension, which aims to minimize information loss compared to spatial filtering with CNN. The second improvement is inspired by the continuous nature of the olfactory process; we propose to use LSTM-MSA in TASA to capture its temporal dynamics by learning the intercorrelation among the time segments of the EEG. TASA is evaluated on an existing olfactory EEG dataset and compared with several existing deep learning architectures to demonstrate its effectiveness in predicting olfactory-triggered emotional responses. Interpretability analyses with DeepLIFT also suggest that TASA learns spatial-spectral features that are relevant to olfactory-induced emotion recognition.

The existing surface electromyography-based pattern recognition system (sEMG-PRS) exhibits limited generalizability in practical applications. In this paper, we propose a stacked weighted random forest (SWRF) algorithm to enhance the long-term usability and user adaptability of sEMG-PRS. First, the weighted random forest (WRF) is proposed to address the issue of imbalanced performance in standard random forests (RF) caused by randomness in sampling and feature selection. Then, the stacking is employed to further enhance the generalizability of WRF. Specifically, RF is utilized as the base learner, while WRF serves as the meta-leaning layer algorithm. The SWRF is evaluated against classical classification algorithms in both online experiments and offline datasets. The offline experiments indicate that the SWRF achieves an average classification accuracy of 89.06%, outperforming RF, WRF, long short-term memory (LSTM), and support vector machine (SVM). The online experiments indicate that SWRF outperforms the aforementioned algorithms regarding long-term usability and user adaptability. We believe that our method has significant potential for practical application in sEMG-PRS.

Timely diagnosis of mild traumatic brain injury (mTBI) remains challenging due to the rapid recovery of acute symptoms and the absence of evidence of injury in static neuroimaging scans. Furthermore, while longitudinal tracking of mTBI is essential in understanding how the diseases progresses/regresses over time for enhancing personalized patient care, a standardized approach for this purpose is not yet available. Recent functional neuroimaging studies have provided evidence of brain function alterations following mTBI, suggesting mTBI-detection models can be built based on these changes. Most of these models, however, rely on manual feature engineering, but the optimal set of features for detecting mTBI may be unknown. Data-driven approaches, on the other hand, may uncover hidden relationships in an automated manner, making them suitable for the problem of mTBI detection. This paper presents a data-driven framework based on Siamese Convolutional Neural Network (SCNN) to detect mTBI and to monitor the recovery state from mTBI over time. The proposed framework is tested on the cortical images of Thy1-GCaMP6s mice, obtained via widefield calcium imaging, acquired in a longitudinal study. Results show that the proposed model achieves a classification accuracy of 96.5%. To track the state of the injured brain over time, a reference distance map is constructed, which together with the SCNN model, are employed to assess the recovery state in subsequent sessions after injury, revealing that the recovery progress varies among subjects. The promising results of this work suggest that a similar approach could be potentially applicable for monitoring recovery from mTBI, in humans.

Modeling the muscle response to functional electrical stimulation (FES) is an important step during model-based FES control system design. The Hammerstein structure is widely used in simulating this nonlinear biomechanical response. However, a fixed relationship cannot cope well with the time-varying property of muscles and muscle fatigue. In this paper, we proposed an adaptive Hammerstein model to predict ankle joint torque induced by electrical stimulation, which used variable forgetting factor recursive least squares (VFFRLS) method to update the model parameters. To validate the proposed model, ten healthy individuals were recruited for short-duration FES experiments, ten for long-duration FES experiments, and three stroke patients for both. The isometric ankle dorsiflexion torque induced by FES was measured, and then the test performance of the fixed-parameter Hammerstein model, the adaptive Hammerstein model based on fixed forgetting factor recursive least squares (FFFRLS) and the adaptive Hammerstein model based on VFFRLS was compared. The goodness of fit, root mean square error, peak error and success rate were applied to evaluate the accuracy and stability of the model. The results indicate a significant improvement in both the accuracy and stability of the proposed adaptive model compared to the fixed-parameter model and the adaptive model based on FFFRLS. The proposed adaptive model enhances the ability of the model to cope with muscle changes.

As an essential cognitive function, attention has been widely studied and various indices based on EEG have been proposed for its convenience and easy availability for real-time attention monitoring. Although existing indices based on spectral power of empirical frequency bands are able to describe the attentional state in some way, the reliability still needs to be improved. This paper proposed a subject-specific attention index based on the weighted spectral power. Unlike traditional indices, the ranges of frequency bands are not empirical but obtained from subject-specific change patterns of spectral power of electroencephalograph (EEG) to overcome the great inter-subject variance. In addition, the contribution of each frequency component in the frequency band is considered different. Specifically, the ratio of power spectral density (PSD) function in attentional and inattentional state is utilized to calculate the weight to enhance the effectiveness of the proposed index. The proposed subject-specific attention index based on the weighted spectral power is evaluated on two open datasets including EEG data of a total of 44 subjects. The results of the proposed index are compared with 3 traditional attention indices using various statistical analysis methods including significance tests and distribution variance measurements. According to the experimental results, the proposed index can describe the attentional state more accurately. The proposed index respectively achieves accuracies of 86.21% and 70.00% at the 1% significance level in both the t-test and Wilcoxon rank-sum test for two datasets, which obtains improvements of 41.38% and 20.00% compared to the best result of the traditional indices. These results indicate that the proposed index provides an efficient way to measure attentional state.

Machine vision and artificial intelligence hold promise across healthcare applications. In this paper, we focus on the emerging research direction of infant action recognition, and we specifically consider the task of reaching which is an important developmental milestone. We develop E-babyNet, a lightweight yet effective neural-network-based framework for infant action recognition that leverages the spatial and temporal correlation of bounding boxes of infants' hands and objects to reach for to determine the onset and offset of the reaching action. E-babyNet consists of two main layers based on two LSTM and a Bidirectional LSTM (BiLSTM) model, respectively. The first layer provides a pre-evaluation of the reaching action for each hand by providing onset and offset keyframes. Then, the biLSTM model merges the previous outputs to deliver an outcome of the reaching actions detection for each frame including the reaching hand. We evaluated our approach against four other lightweight structures using a dataset comprising 5,865 annotated images resulting in 16,337 bounding boxes from 375 distinctive infant reaching actions performed while sitting by different subjects in unconstrained (home/clinic) environments. Results illustrate the effectiveness of our approach and ability to provide reliable reaching action detection and offer onset and offset keyframes with a precision of one frame. Moreover, the biLSTM layer can handle the transition between reaching actions and help reduce false detections.

Electroencephalography (EEG) signals are the brain signals acquired using the non-invasive approach. Owing to the high portability and practicality, EEG signals have found extensive application in monitoring human physiological states across various domains. In recent years, deep learning methodologies have been explored to decode the intricate information embedded in EEG signals. However, since EEG signals are acquired from humans, it has issues with acquiring enormous amounts of data for training the deep learning models. Therefore, previous research has attempted to develop pre-trained models that could show significant performance improvement through fine-tuning when data are scarce. Nonetheless, existing pre-trained models often struggle with constraints, such as the necessity to operate within datasets of identical configurations or the need to distort the original data to apply the pre-trained model. In this paper, we proposed the domain-free transformer, called DFformer, for generalizing the EEG pre-trained model. In addition, we presented the pre-trained model based on DFformer, which is capable of seamless integration across diverse datasets without necessitating architectural modification or data distortion. The proposed model achieved competitive performance across motor imagery and sleep stage classification datasets. Notably, even when fine-tuned on datasets distinct from the pre-training phase, DFformer demonstrated marked performance enhancements. Hence, we demonstrate the potential of DFformer to overcome the conventional limitations in pre-trained model development, offering robust applicability across a spectrum of domains.

Robot-assisted motor training is applied for neurorehabilitation in stroke patients, using motor imagery (MI) as a representative paradigm of brain-computer interfaces to offer real-life assistance to individuals facing movement challenges. However, the effectiveness of training with MI may vary depending on the location of the stroke lesion, which should be considered. This paper introduces a multi-task electroencephalogram-based heterogeneous ensemble learning (MEEG-HEL) specifically designed for cross-subject training. In the proposed framework, common spatial patterns were used for feature extraction, and the features according to stroke lesions are shared and selected through sequential forward floating selection. The heterogeneous ensembles were used as classifiers. Nine patients with chronic ischemic stroke participated, engaging in MI and motor execution (ME) paradigms involving finger tapping. The classification criteria for the multi-task were established in two ways, taking into account the characteristics of stroke patients. In the cross-subject session, the first involved a direction recognition task for two-handed classification, achieving a performance of 0.7419 (±0.0811) in MI and 0.7061 (±0.1270) in ME. The second task focused on motor assessment for lesion location, resulting in a performance of 0.7457 (±0.1317) in MI and 0.6791 (±0.1253) in ME. Comparing the specific-subject session, except for ME on the motor assessment task, performance on both tasks was significantly higher than the cross-subject session. Furthermore, classification performance was similar to or statistically higher in cross-subject sessions compared to baseline models. The proposed MEEG-HEL holds promise in improving the practicality of neurorehabilitation in clinical settings and facilitating the detection of lesions.

Estimation of hand kinematics from surface electromyographic (sEMG) signals provides a non-invasive human-machine interface. This approach is usually subject-specific, so that the training on one individual does not generalise to different subjects. In this paper, we propose a method based on Bidirectional Encoder Representation from Transformers (BERT) structure to predict the movement of hands from the root mean square (RMS) feature of the sEMG signal following μ -law normalization. The method was tested for within-subject and cross-subject conditions. We trained the model with two hard sample mining methods, Gradient Harmonizing Mechanism (GHM) and Online Hard Sample Mining (OHEM). The proposed method was compared with classic approaches, including long short-term memory (LSTM) and Temporal Convolutional Network (TCN) as well as a recent method called Long Exposure Convolutional Memory Network (LE-ConvMN). Correlation coefficient (CC), normalized root mean square error (NRMSE) and time costs were used as performance metrics. Our method (sBERT-OHEM) achieved state-of-the-art performance in cross-subject evaluation as well as high performance in subject-specific tests on the Ninapro dataset. The above tests are based on the same randomly selected 10 subjects. Generally, in the cross-subject situation, with the increasing of the subjects' number, it unavoidably leads to the decline of the performance. While the performance of our method on 38 subjects was significantly higher than the other methods on 10 subjects in cross-subject conditions, which further verified the advantage of our methods.

Surface electromyography (sEMG) based gesture recognition has received broad attention and application in rehabilitation areas for its direct and fine-grained sensing ability. sEMG signals exhibit strong user dependence properties among users with different physiology, causing the inapplicability of the recognition model on new users. Domain adaptation is the most representative method to reduce the user gap with feature decoupling to acquire motion-related features. However, the existing domain adaptation method shows awful decoupling results when handling complex time-series physiological signals. Therefore, this paper proposes an Iterative Self-Training based Domain Adaptation method (STDA) to supervise the feature decoupling process with the pseudo-label generated by self-training and to explore cross-user sEMG gesture recognition. STDA mainly consists of two parts, discrepancy-based domain adaptation (DDA) and pseudo-label iterative update (PIU). DDA aligns existing users' data and new users' unlabeled data with a Gaussian kernel-based distance constraint. PIU Iteratively continuously updates pseudo-labels to generate more accurate labelled data on new users with category balance. Detailed experiments are performed on publicly available benchmark datasets, including the NinaPro dataset (DB-1 and DB-5) and the CapgMyo dataset (DB-a, DB-b, and DB-c). Experimental results show that the proposed method achieves significant performance improvement compared with existing sEMG gesture recognition and domain adaption methods.

Automated exercise assessment is of great importance for patients under rehabilitation exercise who require professional guidance. Among the existing approaches, the skeleton-based assessment model that classifies the correctness of the exercise has attracted much attention due to its relative ease of implementation and convenience in use. However, there are two problems with this approach. The first problem is its sensitivity to the orientation of the human skeleton. To solve this problem, we propose a novel rotation-invariant descriptor, the dot product matrix of the human skeleton, and prove mathematically that this descriptor discards only the orientation message that we do not expect while preserving all other useful information. Lack of feedback from the system is the second problem, because the exercisers do not know which parts of their exercises are incorrect. Therefore, we develop a visualization method for our system based on Gradient-Weighted Class Activation Mapping (Grad-CAM) and an quantitative metric called Overlap Ratio (OvR) to measure the quality of the visualization result. To demonstrate the effect of our method, we conduct experiments on two public datasets and a self-generated push-up dataset. The experimental results show that our rotation-invariant descriptor can achieve absolute robustness to orientation even under severe angle perturbations. In terms of accuracy and OvR, our method even outperforms previous works in most cases, indicating that the rotation-invariant descriptor helps the assessment model to extract more stable features. The visualization results are also informative to correct the movements; some examples are presented in this paper. The code of this paper and our push-up dataset are publicly available at https://github.com/Kelly510/RehabExerAssess.

With the development of brain-computer interfaces (BCI) technologies, EEG-based BCI applications have been deployed for medical purposes. Motor imagery (MI), applied to promote neural rehabilitation for stroke patients, is among the most common BCI paradigms that. The Electroencephalogram (EEG) signals, encompassing an extensive range of channels, render the training dataset a high-dimensional construct. This high dimensionality, inherent in such a dataset, tends to challenge traditional deep learning approaches, causing them to potentially disregard the intrinsic correlations amongst these channels. Such an oversight often culminates in erroneous data classification, presenting a significant drawback of these conventional methodologies. In our study, we propose a novel algorithmic structure of EEG channel-attention combined with Swin Transformer for motor pattern recognition in BCI rehabilitation. Effectively, the self-attention module from transformer architecture could captures temporal-spectral-spatial features hidden in EEG data. The experimental results verify that our proposed methods outperformed other state-of-art approaches with the average accuracy of 87.67%. It is implied that our method can extract high-level and latent connections among temporal-spectral features in contrast to traditional deep learning methods. This paper demonstrates that channel-attention combined with Swin Transformer methods has great potential for implementing high-performance motor pattern-based BCI systems.

Brain-Machine Interfaces (BMIs) assist paralyzed people to brain control (BC) the neuro-prosthesis continuously moving in space. During the BC process, the subject imagines the movement of the real limb and adapts the brain activity according to the sensory feedback. The neural adaptation in the closed-loop control results in complex and changing brain signals. Simultaneously, the decoder interprets the time-varying functional mapping between neural activity and continuous trajectory. It is crucial and challenging to accurately and adaptively track the mapping to help the subject accomplish the BC task with a stable performance. Existing Kalman Filter (KF) based decoders achieve continuous trajectory control by linearly interpreting neural firing observations into self-evolving prosthetic states. However, the linear neural-state mapping might not accurately reflect the movement intention of the subject. In this paper, we propose a novel method that allows subjects to achieve continuous brain control efficiently and stably. The proposed method incorporates a kernel reinforcement learning method into a state-observation model to decode the nonlinearly neural observation into a continuous trajectory state. The state transition function ensures the continuity of the prosthetic state. The kernel reinforcement learning allows the quick adaptation of the nonlinear neural-movement mapping during the BC process. The proposed method is tested in an online brain control reaching task for rats. Compared with KF, our method achieved more successful trials, faster response time, shorter inter-trial time, and remained stable over days. These results demonstrate that the proposed method is an efficient tool to assist subjects in brain control tasks.

Deep Convolutional Neural Networks (CNNs) have recently demonstrated impressive results in electroencephalogram (EEG) decoding for several Brain-Computer Interface (BCI) paradigms, including Motor-Imagery (MI). However, neurophysiological processes underpinning EEG signals vary across subjects causing covariate shifts in data distributions and hence hindering the generalization of deep models across subjects. In this paper, we aim to address the challenge of inter-subject variability in MI. To this end, we employ causal reasoning to characterize all possible distribution shifts in the MI task and propose a dynamic convolution framework to account for shifts caused by the inter-subject variability. Using publicly available MI datasets, we demonstrate improved generalization performance (up to 5%) across subjects in various MI tasks for four well-established deep architectures.

Brain-computer interfaces (BCIs) is promising in interacting with machines through electroencephalogram (EEG) signal. The compact end-to-end neural network model for generalized BCIs, EEGNet, has been implemented in hardware to get near sensor intelligence, but without enough efficiency. To utilize EEGNet in low-power wearable device for long-term use, this paper proposes an efficient EEGNet inference accelerator. Firstly, the EEGNet model is compressed by embedded channel selection, normalization merging, and product quantization. The customized accelerator based on the compressed model is then designed. The multilayer convolutions are achieved by reusing multiplying-accumulators and processing elements (PEs) to minimize area of logic circuits, and the weights and intermediate results are quantized to minimize memory sizes. The PEs are clock-gated to save power. Experimental results in FPGA on three datasets show the good generalizing ability of the proposed design across three BCI diagrams, which only consumes 3.31% area and 1.35% power compared to the one-to-one parallel design. The speedup factors of 1.4, 3.5, and 3.7 are achieved by embedded channel selection with negligible loss of accuracy (-0.80%). The presented accelerator is also synthesized in 65 nm CMOS low power (LP) process and consumes 0.23M gates, 24.4 ms/inference, 0.267 mJ/inference, which is 87.22% more efficient than the implementation of EEGNet in a RISC-V MCU realized in 40 nm CMOS LP process in terms of area, and 20.77% more efficient in terms of energy efficiency on BCIC-IV-2a dataset.

This paper presents a design method for frequency response masking (FRM)-based nonuniform filter bank with reduced effective wordlength. Instead of designing prototype filters separately, we propose to model the filter bank design problem as a nonlinear programming problem and jointly design the prototype filters in the FRM structure. Moreover, in this work, all the filters are designed directly in the finite wordlength space, such that they can be directly implemented using efficient fixed-point arithmetic without any quantization. By simultaneously considering all the subband constraints during optimization, the proposed method is able to guarantee the desirable stopband attenuation for all subbands and achieve optimal effective wordlength (EWL) for the coefficients, reducing the hardware complexity for very large-scale integration (VLSI) implementation. Experimental results show that the hardware complexity of filter banks can be reduced without sacrificing the audiogram compensation performance for hearing aid applications.

Extracting the Electrocardiogram (ECG) of a fetus from the ECG signal of the maternal abdomen is a challenging task due to different artifacts. The paper proposes a N-tap non-causal adaptive filter (NC-AF) that update the weight by considering the N number of past weights and N-1 number of the reference signal and error signal samples after the processing sample number n. Using the maternal abdominal signal as the primary signal and thorax signal as the reference input, the output e(n) is obtained from the mean of N number of errors. The filtering performance of NC-AF was evaluated using the Synthetic dataset and Daisy dataset with the metrics such as correlation coefficient ( γ), peak root mean square difference (PRD), the output signal to noise ratio (SNR), root mean square error (RMSE), and fetal R-peak detection accuracy (FRPDA). The NC-AF provides a maximum correlation coefficient, PRD, SNR, RMSE and FRPDA of 0.9851, 83.04%, 8.52 dB, 0.208 and 97.09% respectively with filter length N=38. The paper also proposes the architecture of NC-AF that can be implemented in hardware like FPGA. Further, the NC-AF was implemented on Virtex-7 FPGA and its performance is evaluated in terms of resource utilization, throughput, and power consumption. For filter length N=38 and wordlength L=24, the maximum performance of the filter can be attained with a power consumption of [Formula: see text] and a maximum clock frequency of 139.47 MHz.

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

This paper proposes an approach to mitigate adverse effects of the fault management of closed/ring grids with high shares of distributed generation (DG). The approach refers to conventional distance protection relays in particular. The rising share of DG, especially in distribution systems, can lead to overloadings and intolerable voltages. Closed-ring structures increase the grid capacity for DG due to more balanced load and voltages profiles. However, malfunctions of protection relays may occur because fault locating and selective fault clearing can be disturbed. This paper presents a distance protection algorithm for feeder relays that complies with the requirements of closed/ring grids with inter/infeeds. The proposed current comparison method (CCM) bases on the comparison of negative/sequence currents. It needs no voltage measurement and remains unaffected from inter/infeeds and fault resistances. Additionally, for relays located at the ring coupler, where the ring can be opened, a coupling relay method (CRM) is proposed. It locates unsymmetrical faults in closed/ring grids with inter/infeeds and enables fast and selective opening of the ring. This helps maintaining reliable power supply for customers in closed rings. Finally, the paper presents a grading strategy reducing the average fault clearing time. Lab tests prove the capability of both proposed algorithms. [ABSTRACT FROM AUTHOR]

For nearly a decade, quality-related fault detection algorithms have been widely used in industrial systems. However, the majority of these detection strategies rely on static assumptions of the operating environment. In this paper, taking the time series of variables into consideration, a dynamic kernel entropy component regression (DKECR) framework is proposed to address the instability of quality-related fault detection due to the existing dynamic characteristics. Compared with the typical kernel entropy component analysis method, the proposed method constructs the relationship between process states and quality states to further interpret the direct effect on the product taken by the fault. In the proposed approach, process measurements are converted to a lower-dimensional subspace with a specific angular structure that is more comprehensive than traditional subspace approaches. In addition, the angular statistics and their relevant thresholds are exploited to enhance the quality-related fault detection performance. Finally, the proposed method will be compared with three methods by means of a numerical example and two industrial scenarios to demonstrate its practicality and effectiveness. Note to Practitioners—This paper studies a quality-related fault detection problem for the dynamic nonlinear industrial system. Controlling and measuring the quality state is challenging for the high-level monitoring system of the manufacturing process due to the nonlinear dynamic feature in states. This paper proposes a new data-driven method based on the kernel entropy component analysis method to assess the correlation between the quality and fault in the industrial system, reducing unnecessary overhaul and maintenance. Based on the autoregressive moving average exogenous algorithm, the proposed method captures the dynamic interaction between the process states to decrease false alarms. In the experimental section, the DKECR method outperforms the compared approaches, which can provide stable fault detection results. Additionally, the unique angle structure of the proposed method can supply more information for engineers’ monitoring needs. [ABSTRACT FROM AUTHOR]

This paper addresses a UAV path planning problem for a team of cooperating heterogeneous vehicles composed of one unmanned aerial vehicle (UAV) and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobile actuators and scattered in a large area. To achieve multi-UGV communication and collaboration, the UAV, modeled as a Dubins vehicle, serves as a messenger to fly over the effective communication range of all UGVs to relay information. The curvature-constrained path planning of the messenger UAV is formulated as a Dubins Traveling Salesman Problem with Dynamic Neighborhood (DTSPDN) which is a complex optimization problem involving coupled variables and contains dynamic constraints. We design an effective memetic algorithm to find the shortest route that enables the messenger UAV to visit all moving UGVs. This algorithm combines the genetic algorithm procedure, two kinds of local search operators based on gradient search and uniform sampling respectively, and a gradient-based repair operator to repair the solutions violating dynamic constraints. During the evolutionary process, a special phenomenon may occur that changing some decision variables (i.e., visiting sequence and location) may not affect the evaluation function value, but may alter the feasible region of another decision variable (i.e., visiting time) due to the encounter constraint between the UAV and UGV. To track and utilize the change of the feasible region, a transformation procedure is proposed to change one solution to another with less visiting time by analyzing the encounter pattern between UAV and UGV. The computational results on random instances with different scales demonstrate that the proposed approach can effectively generate better curvature-constrained tours to encounter all moving UGVs when compared to other four competitive algorithms in the literature. Note to Practitioners—This paper studies an emerging path planning problem for a UAV which is used to provide communication service for multiple moving UGVs. These UGVs are required to execute tasks (e.g., firefighting, search and rescue) within a large area. Due to their limited communication capabilities, they may be unable to obtain necessary information from other UGVs. The UAV serves as a messenger to fly over the effective communication range of all moving UGVs to relay information. We propose a novel memetic algorithm to efficiently search for the shortest tour that enables the messenger UAV to visit all moving UGVs. The memetic algorithm combines the parallel global search virtue of genetic algorithm with efficient local search procedure to improve the generated tour. A gradient-based repair procedure is also employed to make sure that the planned tour can guide the UAV to sequentially encounter each moving UGV. Simulations exhibit that the proposed approach can effectively generate high-quality tours for messenger UAV to rapidly visit all UGVs, which assists UGVs to achieve collaboration in large area. In future work, the proposed memetic algorithm will be extended to plan tours for multiple messenger UAVs. [ABSTRACT FROM AUTHOR]

Visual inspection of long-term electroencephalography (EEG) is a tedious task for physicians in neurology. Based on bidirectional gated recurrent unit (Bi-GRU) neural network, an automatic seizure detection method is proposed in this paper to facilitate the diagnosis and treatment of epilepsy. Firstly, wavelet transforms are applied to EEG recordings for filtering pre-processing. Then the relative energies of signals in several particular frequency bands are calculated and inputted into Bi-GRU network. Afterwards, the outputs of Bi-GRU network are further processed by moving average filtering, threshold comparison and seizure merging to generate the discriminant results that the tested EEG belong to seizure or not. Evaluated on CHB-MIT scalp EEG database, the proposed seizure detection method obtained an average sensitivity of 93.89% and an average specificity of 98.49%. 124 out of 128 seizures were correctly detected and the achieved average false detection rate was 0.31 per hour on 867.14 h testing data. The results show the superiority of Bi-GRU network in seizure detection and the proposed detection method has a promising potential in the monitoring of long-term EEG.

Surface electromyogram pattern recognition (EMG-PR) requires time-consuming training and retraining procedures for long-term use, hindering the usability of myoelectric control. In this paper, we design a fabric myoelectric armband to reduce the electrode shifts. Furthermore, we propose a fully unsupervised adaptive approach called hybrid serial classifier (HSC) to eliminate the burden of retraining over multiply days. We investigated the performance of our approach with a dataset of ten types of forearm motion from ten male subjects over eight weeks (total ten days, including: from day 1 to day 7, day 14, day 28, day 56). The average inter-day classification accuracies of HSC without any new retraining data are 86.61% when trained exclusively with the first day's EMG data, and 94.77% when trained with other nine days' data. We compare our proposed HSC algorithm with linear discriminant analysis (LDA) without recalibration (BLDA) and supervised adaption LDA (ALDA) with just one trial of new retraining data. The inter-day classification accuracy of HSC is significantly higher than that of BLDA and ALDA. These results indicate that our novel armband sEMG device is feasible for long-term use in conjunction with the proposed HSC algorithm.

How to learn informative representations from Electromyography (EMG) signals is of vital importance for myoelectric control systems. Traditionally, hand-crafted features are extracted from individual EMG channels and combined together for pattern recognition. The spatial topological information between different channels can also be informative, which is seldom considered. This paper presents a radically novel approach to extract spatial structural information within diverse EMG channels based on the symmetric positive definite (SPD) manifold. The object is to learn non-Euclidean representations inside EMG signals for myoelectric pattern recognition. The performance is compared with two classical feature sets using accuracy and F1-score. The algorithm is tested on eleven gestures collected from ten subjects, and the best accuracy reaches 84.85%±5.15% with an improvement of 4.04%~20.25%, which outperforms the contrast method, and reaches a significant improvement with the Wilcoxon signed-rank test. Eleven gestures from three public databases involving Ninapro DB2, DB4, and DB5 are also evaluated, and better performance is observed. Furthermore, the computational cost is less than the contrast method, making it more suitable for low-cost systems. It shows the effectiveness of the presented approach and contributes a new way for myoelectric pattern recognition.

Targeted stimulation of nervous system has become an increasingly important research tool as well as therapeutic modality, and the stimulation signal acquisition based on the expected signal needs a closed-loop system. Due to the difficulty of biological experiments, the real-time simulation of neural activity is of great significance for the mechanism analysis and the performance improvement of neuromodulation techniques. This paper proposes a real-time hardware experimental platform for closed-loop electrophysiology. The platform integrates a neural computing module and a real-time control module on TMS320F28377D digital signal processors (DSP), and it reserves a programmable interface for users to call the required modules and set module parameters simultaneously. The platform has high compatibility and can be used for closed-loop electrophysiological experiments with different models, different control algorithms and different clamps. We implement the thalamocortical relay neural computing model and iteration improves proportional-integral algorithm on the platform for experimental verification in this paper. The neuron firing waveforms of the DSP platform and the MATLAB R2020b simulation waveforms are consistent. Under the same physiological time, the simulation speed of DSP platform is 3 times faster than that of the Intel Core i5-8400 CPU computer, and the neural firing rate of DSP platform is due to the real-time. This platform can be used as a tool to explore the working mechanism of the nervous system. It may promote the development of neuroscience, especially the field of closed-loop neuroscience.

This paper presents a spike sorting processor based on an accurate spike clustering algorithm. The proposed spike sorting algorithm employs an L2-normalized convolutional autoencoder to extract features from the input, where the autoencoder is trained using the proposed spike sorting-aware loss. In addition, we propose a similarity-based K-means clustering algorithm that conditionally updates the means by observing the cosine similarity. The modified K-means algorithm exhibits better convergence and enables online clustering with higher classification accuracy. We implement a spike sorting processor based on the proposed algorithm using an efficient time-multiplexed hardware architecture in a 40-nm CMOS process. Experimental results show that the processor consumes 224.75μW/mm 2 when processing 16 input channels at 7.68 MHz and 0.55 V. Our design achieves 95.54% clustering accuracy, outperforming prior spike sorting processor designs.

This paper tackles the problem of decomposing binary data using matrix factorization. We consider the family of mean-parametrized Bernoulli models, a class of generative models that are well suited for modeling binary data and enables interpretability of the factors. We factorize the Bernoulli parameter and consider an additional Beta prior on one of the factors to further improve the model’s expressive power. While similar models have been proposed in the literature, they only exploit the Beta prior as a proxy to ensure a valid Bernoulli parameter in a Bayesian setting; in practice it reduces to a uniform or uninformative prior. Besides, estimation in these models has focused on costly Bayesian inference. In this paper, we propose a simple yet very efficient majorization-minimization algorithm for maximum a posteriori estimation. Our approach leverages the Beta prior whose parameters can be tuned to improve performance in matrix completion tasks. Experiments conducted on three public binary datasets show that our approach offers an excellent trade-off between prediction performance, computational complexity, and interpretability. [ABSTRACT FROM AUTHOR]

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]

Unavoidably, the controlsystem of any permanent magnet synchronous motor (PMSM) is subjected to perturbations, e.g., motor nonidealities and inverter nonlinearities. To reject these perturbations, a new super-twisting (ST) control variant, called speed adaptive super-twisting (S-AST) control, is proposed in this paper. In the S-AST control, a proportional-integral (PI) and a ST controllers are merged using an adaptive law that is based on the motor speed measurement. This is done to reduce the chattering problems that the standard ST control presents. In addition, a mathematical design for the S-AST control is proposed, where the relationship between the chattering amplitude, the switching frequency and the system perturbations is shown. The main contribution in this paper is the application of the S-AST controller to reduce the total harmonic distortion (THDi) of the PMSM currents. By comparing the S-AST control against PI control, the THDi is reduced from 9.9% to 1.27%, in simulation, and the THDi is reduced from 22.79% to 1.56%, experimentally. These results demonstrate how the S-AST control is an excellent alternative to improve the waveform of the PMSM currents. [ABSTRACT FROM AUTHOR]

The ongoing coronavirus disease 2019 (COVID-19) is a pandemic causing millions of deaths, devastating social and economic disruptions. Testing individuals for severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), the pathogen of COVID-19, is critical for mitigating and containing COVID-19. Many countries are implementing group testing strategies against COVID-19 to improve testing capacity and efficiency while saving required workloads and consumables. A group of individuals’ nasopharyngeal/oropharyngeal (NP/OP) swab samples is mixed to conduct one test. However, existing group testing methods neglect the fact that mixing samples usually leads to substantial dilution of viral ribonucleic acid (RNA) of SARS-CoV-2, which seriously impacts the sensitivity of tests. In this paper, we aim to screen individuals infected with COVID-19 with as few tests as possible, under the premise that the sensitivity of tests is high enough. To achieve this goal, we propose an Adaptive Group Testing (AdaGT) method. By collecting information on the number of positive and negative samples that have been identified during the screening process, the AdaGT method can estimate the ratio of positive samples in real-time. Based on this ratio, the AdaGT algorithm adjusts its testing strategy adaptively between an individual testing strategy and a group testing strategy. The group size of the group testing strategy is carefully selected to guarantee that the sensitivity of each test is higher than a predetermined threshold and that this group contains at most one positive sample on average. Theoretical performance analysis on the AdaGT algorithm is provided and then validated in experiments. Experimental results also show that the AdaGT algorithm outperforms existing methods in terms of efficiency and sensitivity. Note to Practitioners—Real-time reverse transcription-polymerase chain reaction (rRT-PCR) tests provide scope for automation and are one of the most widely used laboratory methods for detecting the SARS-CoV-2 virus. This paper is motivated by the following challenges: (1) Many countries are experiencing an acute shortage of professionals and consumables for conducting rRT-PCR tests; (2) Group sizes of existing group testing methods against COVID-19 may not be optimal, which adversely impacts the efficiency of the screening of the SARS-CoV-2 virus; (3) Existing group testing methods do not consider the fact that the sensitivity of rRT-PCR tests usually decreases with the group size. The objective of this paper is to improve the efficiency and sensitivity of large-scale screening against COVID-19. For achieving this goal, we propose an Adaptive Group Testing (AdaGT) algorithm, which has the following advantages: (1) It can improve the efficiency for screening the SARS-CoV-2 virus, mainly by adaptively adjusting its testing strategy between an individual testing strategy and a group testing strategy based upon an estimated ratio of positive samples during the screening process; (2) It can guarantee a high sensitivity of the rRT-PCR tests by determining the group sizes of the group testing strategy based upon some constraints; (3) We derive an appropriate threshold for the estimated ratio of positive samples such that the AdaGT algorithm can achieve a minimum average number of rRT-PCR tests and can be directly employed in practical applications. [ABSTRACT FROM AUTHOR]

This paper focuses on similarity caching systems, in which a user request for an object $o$ that is not in the cache can be (partially) satisfied by a similar stored object $o'$ , at the cost of a loss of user utility. Similarity caching systems can be effectively employed in several application areas, like multimedia retrieval, recommender systems, genome study, and machine learning training/serving. However, despite their relevance, the behavior of such systems is far from being well understood. In this paper, we provide a first comprehensive analysis of similarity caching in the offline, adversarial, and stochastic settings. We show that similarity caching raises significant new challenges, for which we propose the first dynamic policies with some optimality guarantees. We evaluate the performance of our schemes under both synthetic and real request traces. [ABSTRACT FROM AUTHOR]

The problem of range estimation based on noisy measurements with phase ambiguity can be solved using signals across multiple frequencies by existing algorithms based on either the Chinese Remainder Theorem or lattice theory. The performances of these algorithms are constrained by the trade-off between SNR of measurements and required estimation accuracy. In this paper, we firstly propose an algorithm to find a set of wavelengths satisfying the conditions to apply the closed-form lattice algorithm from a given interval. Then we propose an enhanced lattice algorithm for range estimation based on existing lattice approaches. In the conventional lattice algorithm, the selection of an integer vector by the estimator often fails to be the ground truth because of noise. As a result, the true value can be a neighbouring lattice point of the estimated point where neighbours are defined in terms of a distance depending on the noise characteristics. In this paper, all neighbouring lattice points of the estimated point obtained by a conventional lattice algorithm are regarded as candidates for the new estimate. Then an efficient estimator is presented to choose one of those candidates to be the new estimate. The performance of the proposed algorithm, i.e. the successful probability of reconstruction, is derived mathematically. Additionally, a computation-reduced algorithm is presented to reduce the overhead of computation. The calculated probability and simulation results demonstrate the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Accompanied with the rapid increase of the demand for routine examination of leucorrhea, efficiency and accuracy become the primary task. However, in super depth of field (SDoF) system, the problem of automatic detection and localization of cells in leucorrhea micro-images is still a big challenge. The changing of the relative position between the cell center and focus plane of microscope lead to variable cell morphological structure in the two-dimensional image, which is an important reason for the low accuracy of current deep learning target detection algorithms. In this paper, an object detection method based on Retinanet in state of super depth of field is proposed, which can achieve high precision detecting of leucorrhea components by the SDoF feature aggregation module. Compared with the current mainstream algorithms, the mean average accuracy (mAP) index has been improved significantly, the mAP index is 82.7% for SDoF module and 83.0% for SDoF+ module, with an average increase of more than 10%. These improved features can significantly improve the efficiency and accuracy of the algorithm. The algorithm proposed in this paper can be integrated into the leucorrhea automatic detection system. [ABSTRACT FROM AUTHOR]

Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only recently. It was recently shown that the well-known MaxWeight algorithm achieves optimal scaling of mean queue lengths in steady state in the heavy-traffic regime, and is within a factor less than 2 of a universal lower bound. However, MaxWeight is not used in practice because of its high time complexity. In this paper, we study several low complexity algorithms and show that their heavy-traffic performance is identical to that of MaxWeight. We first present a negative result that picking a random schedule does not have optimal heavy-traffic scaling of queue lengths even under uniform traffic. We then show that if one picks the best among two matchings or modifies a random matching even a little, using the so-called flip operation, it leads to MaxWeight like heavy-traffic performance under uniform traffic. We then focus on the case of non-uniform traffic and show that a large class of low time complexity algorithms have the same heavy-traffic performance as MaxWeight, as long as it is ensured that a MaxWeight matching is picked often enough. We also briefly discuss the performance of these algorithms in the large scale heavy-traffic regime when the size of the switch increases simultaneously with the load. Finally, we perform empirical study on a new algorithm to compare its performance with some existing algorithms. [ABSTRACT FROM AUTHOR]

This paper describes a simple and reproducible method for universal evaluation of the performance of electrical impedance tomography (EIT) systems using reconstructed images. To address the issues where common electrical parameters are not directly related to the quality of EIT images, based on objective full reference (FR) image quality assessment, the method provides a visually distinguishable hot colormap and two new FR metrics, the global and the more specific 'region of interest'. A passive 16 electrode EIT system using an application specific integrated circuit front-end was used to evaluate the proposed method. The measured results show, both visually and in terms of the proposed FR metrics, the impact on recorded EIT images with different design parameters and non-idealities. The paper also compares the image results of a passive electrode system with a matched 'single variable' active electrode system and demonstrates the merit of an active electrode system for noise interference. A figure of merit based on the FR metrics is proposed.