ZFZuren Feng

Zuren Feng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zuren Feng has a total of 38 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Performance of a Lip-Sync Imagery Model, New Combinations of Signals, a Supplemental Bond Graph Classifier, and Deep Formula Detection as an Extraction and Root Classifier for Electroencephalograms and Brain–Computer Interfaces

    by Ahmad Naebi, Zuren Feng

    Many current brain–computer interface (BCI) applications depend on the quick processing of brain signals. Most researchers strive to create new methods for future implementation and enhance existing models to discover an optimal feature set that can operate independently. This study focuses on four key concepts that will be used to complete future works. The first concept is related to potential future communication models, whereas the others aim to enhance previous models or methodologies. The four concepts are as follows. First, we suggest a new communication imagery model as a substitute for a speech imager that relies on a mental task approach. As speech imagery is intricate, one cannot imagine the sounds of every character in every language. Our study proposes a new mental task model for lip-sync imagery that can be employed in all languages. Any character in any language can be used with this mental task model. In this study, we utilized two lip-sync movements to indicate two sounds, characters, or letters. Second, we considered innovative hybrid signals. Choosing an unsuitable frequency range can lead to ineffective feature extractions. Therefore, the selection of an appropriate frequency range is crucial for processing. The ultimate goal of this method is to accurately discover distinct frequencies of brain imagery activities. The restricted frequency range combination presents an initial proposal for generating fragmented, continuous frequencies. The first model assesses two 4 Hz intervals as filter banks. The primary objective is to discover new combinations of signals at 8 Hz by selecting filter banks with a 4 Hz scale from the frequency range of 4 Hz to 40 Hz. This approach facilitates the acquisition of efficient and clearly defined features by reducing similar patterns and enhancing distinctive patterns of brain activity. Third, we introduce a new linear bond graph classifier as a supplement to a linear support vector machine (SVM) when handling noisy data. The performance of the linear support vector machine (SVM) significantly declines under high-noise conditions. To complement the linear support vector machine (SVM) in noisy-data situations, we introduce a new linear bond graph classifier. Fourth, this paper presents a deep-learning model for formula recognition that converts the first-layer data into a formula extraction model. The primary goal is to decrease the noise in the formula coefficients of the subsequent layers. The output of the final layer comprises coefficients chosen by different functions at various levels. The classifier then extracts the root interval for each formula, and a diagnosis is established based on these intervals. The final goal of the last idea is to explain the main brain imagery activity formula using a combination formula for similar and distinctive brain imagery activities. The results of implementing all of the proposed methods are reported. The results range between 55% and 98%. The lowest result is 55% for the deep detection formula, and the highest result is 98% for new combinations of signals.


  • Open Access

    Performance of Lip-sync instead of Speech Imagery, New Combination Signals, Supplement Bond Graph Classifier and Deep Formula Detection as Confidents Extraction and Roots Detection Classifier for EEG and BCI

    by Ahmad Naebi, Zuren Feng

    Nowadays, brain signal processing is performed rapidly in various brain-computer interface (BCI) applications. Most researchers focus on developing new methods for the future or improving the basic implemented models to identify the optimum standalone feature set. Our research focuses on four ideas. One of them introduces future communication models, and the others are for improving old models or methods. These are: 1) new communication imagery model instead of speech imager using the mental task: Due to speech imagery is very difficult, and it is impossible to imagine sound for all of the characters in all of the languages. Our research introduces a new mental task model for all languages that call Lip-sync imagery. This model can use for all characters in all languages. This paper implemented two lip-sync for two sounds, characters or letters. 2) New combination Signals: Selecting an inopportune frequency domain can lead to inefficient feature extraction. Therefore, domain selection is so important for processing. This combination of limited frequency ranges proposes a preliminary for creating Fragmentary Continuous frequency. For the first model, two s intervals of 4 Hz as filter banks were examined and tested. The primary purpose is to identify the combination of filter banks with 4Hz (scale of each filter bank) from the 4Hz to 40Hz frequency domain as new combination signals (8Hz) to obtain well and efficient features using increasing distinctive patterns and decreasing similar patterns of brain activities.3) new supplement bond graph classifier for SVM classifier: When SVM linear uses in very noisy, the performance is decreased. But we introduce a new bond graph linear classifier to supplement SVM linear in noisy data. 4) a deep formula recognition model: it converts the data of the first layer into a formula model (formula extraction model). The main goal is to reduce the noise in the subsequent layers for the coefficients of the formulas. The output of the last layer is the coefficients selected by different functions in different layers. Finally, the classifier extracts the root interval of the formulas, and the diagnosis does based on the root interval. For all of the ideas achieved the results of implementing methods. The results are between 55% to 98%. Less result is 55% for the deep detection formula, and the highest result is 98% for new combination signals.


  • Open Access

    A Sliding Mode Control Algorithm with Elementary Compensation for Input Matrix Uncertainty in Affine Systems

    by Ruizhi Sha, Zuren Feng

    This paper aims to develop a sliding mode control (SMC) approach with elementary compensation for input matrix uncertainty in affine systems. As a multiplicative uncertainty regarding the control inputs, input matrix uncertainty adversely modifies the control effort and even further causes the instability of systems. To solve this issue, a sliding mode control algorithm is developed based on a two-step design strategy. The first step is to design a general sliding mode controller for the system without input matrix uncertainty. In the second step, a control term is specially designed to compensate for input matrix uncertainty. In order to realize the elementary compensation for input matrix uncertainty, this term is obtained by solving a nonlinear vector equation which is derived from the Lyapunov function inequality. Theorems and lemmas based on the convex cone theory are proposed to guarantee the existence and uniqueness of the solution to the vector equation. Additionally, an algorithmic process is proposed to solve the vector equation efficiently. In the simulation part, the proposed controller is applied to two systems with different structures and compared with two state-of-the-art SMC algorithms. The comprehensive simulation results demonstrate that the proposed method is able to provide the closed-loop system with a competitive performance in terms of convergence level, overshoot reduction and chattering suppression.


  • Open Access

    A Chattering-Reduction Sliding Mode Control Algorithm for Affine Systems With Input Matrix Uncertainty

    by Zu-Ren Feng, Rui-Zhi Sha, Zhi-Gang Ren

    This paper aims to develop a chattering-reduction sliding mode control (SMC) approach for affine systems with input matrix uncertainty. Input matrix uncertainty poses adverse effects on systems, such as aggravating the chattering effect, and even causing instability for systems. To solve this problem, a two-step controller design method is proposed in this paper. In the first step, a general sliding mode controller is designed for the system without input matrix uncertainty. To suppress the effect of input matrix uncertainty, in the second step, a control term is specially developed to compensate for input matrix uncertainty. This term is obtained by solving a nonlinear equation, in which the directional characteristics of the control vector in the first step are integrated into the control term. By adding up the control terms obtained from the above two steps, a refined controller is obtained whose control gain is significantly reduced, especially facing with large input matrix uncertainty. In addition, the efficacy of the designed controller is verified in the simulation of a nonlinear plant. Upon drawing a comparison of the proposed method with a state-of-the-art SMC algorithm, it is learnt that the proposed controller is able to provide the closed-loop system with a more desired performance in which the amplitude of chattering is greatly reduced.


  • An Efficient Adaptive Differential Grouping Algorithm for Large-Scale Black-Box Optimization

    by An Chen, Zhigang Ren, Wenhua Guo, Yongsheng Liang, Zuren Feng

    Decomposition plays a significant role in cooperative coevolution, which shows great potential in large-scale black-box optimization (LSBO). However, current learning-based decomposition algorithms require many fitness evaluations (FEs) to detect variable interdependencies and encounter the difficulty of threshold setting. To address these issues, this study proposes an efficient adaptive differential grouping (EADG) algorithm. Instead of homogeneously tackling different types of LSBO instances, EADG first identifies the instance type by detecting the interdependencies of a few pairs of variable subsets. Only if the instance is partially separable dose EADG further engage with it by converting its decomposition process into a search process in a binary tree. This facilitates the systematic reutilization of evaluated solutions so that half the interdependencies can be directly deduced without extra FEs. To promote the decomposition accuracy, EADG specially designs a normalized interdependency indicator that can adaptively generate a decomposition threshold according to its ordinal distribution. Theoretical analysis and experimental results show that EADG outperforms current popular decomposition algorithms. Further tests indicate that it can help cooperative coevolution achieve highly competitive optimization performance.


  • Open Access

    Dimension Reduction Using New Bond Graph Algorithm and Deep Learning Pooling on EEG Signals for BCI

    by Ahmad Naebi, Zuren Feng, Farhoud Hosseinpour, Gahder Abdollahi

    One of the main challenges in studying brain signals is the large size of the data due to the use of many electrodes and the time-consuming sampling. Choosing the right dimensional reduction method can lead to a reduction in the data processing time. Evolutionary algorithms are one of the methods used to reduce the dimensions in the field of EEG brain signals, which have shown better performance than other common methods. In this article, (1) a new Bond Graph algorithm (BGA) is introduced that has demonstrated better performance on eight benchmark functions compared to genetic algorithm and particle swarm optimization. Our algorithm has fast convergence and does not get stuck in local optimums. (2) Reductions of features, electrodes, and the frequency range have been evaluated simultaneously for brain signals (left-handed and right-handed). BGA and other algorithms are used to reduce features. (3) Feature extraction and feature selection (with algorithms) for time domain, frequency domain, wavelet coefficients, and autoregression have been studied as well as electrode reduction and frequency interval reduction. (4) First, the features/properties (algorithms) are reduced, the electrodes are reduced, and the frequency range is reduced, which is followed by the construction of new signals based on the proposed formulas. Then, a Common Spatial Pattern is used to remove noise and feature extraction and is classified by a classifier. (5) A separate study with a deep sampling method has been implemented as feature selection in several layers with functions and different window sizes. This part is also associated with reducing the feature and reducing the frequency range. All items expressed in data set IIa from BCI competition IV (the left hand and right hand) have been evaluated between one and three channels, with better results for similar cases (in close proximity). Our method demonstrated an increased accuracy by 5 to 8% and an increased kappa by 5%.


  • Open Access

    SAFS: Object Tracking Algorithm Based on Self-Adaptive Feature Selection

    by Wenhua Guo, Jiabao Gao, Yanbin Tian, Fan Yu, Zuren Feng

    Object tracking is one of the most challenging problems in the field of computer vision. In challenging object tracking scenarios such as illumination variation, occlusion, motion blur and fast motion, existing algorithms can present decreased performances. To make better use of the various features of the image, we propose an object tracking method based on the self-adaptive feature selection (SAFS) algorithm, which can select the most distinguishable feature sub-template to guide the tracking task. The similarity of each feature sub-template can be calculated by the histogram of the features. Then, the distinguishability of the feature sub-template can be measured by their similarity matrix based on the maximum a posteriori (MAP). The selection task of the feature sub-template is transformed into the classification task between feature vectors by the above process and adopt modified Jeffreys’ entropy as the discriminant metric for classification, which can complete the update of the sub-template. Experiments with the eight video sequences in the Visual Tracker Benchmark dataset evaluate the comprehensive performance of SAFS and compare them with five baselines. Experimental results demonstrate that SAFS can overcome the difficulties caused by scene changes and achieve robust object tracking.


  • Open Access

    Two-Stage Robust Optimization for the Orienteering Problem with Stochastic Weights

    by Ke Shang, Felix T. S. Chan, Stephen Karungaru, Kenji Terada, Zuren Feng, Liangjun Ke

    In this paper, the two-stage orienteering problem with stochastic weights is studied, where the first-stage problem is to plan a path under the uncertain environment and the second-stage problem is a recourse action to make sure that the length constraint is satisfied after the uncertainty is realized. First, we explain the recourse model proposed by Evers et al. (2014) and point out that this model is very complex. Then, we introduce a new recourse model which is much simpler with less variables and less constraints. Based on these two recourse models, we introduce two different two-stage robust models for the orienteering problem with stochastic weights. We theoretically prove that the two-stage robust models are equivalent to their corresponding static robust models under the box uncertainty set, which indicates that the two-stage robust models can be solved by using common mathematical programming solvers (e.g., IBM CPLEX optimizer). Furthermore, we prove that the two two-stage robust models are equivalent to each other even though they are based on different recourse models, which indicates that we can use a much simpler model instead of a complex model for practical use. A case study is presented by comparing the two-stage robust models with a one-stage robust model for the orienteering problem with stochastic weights. The numerical results of the comparative studies show the effectiveness and superiority of the proposed two-stage robust models for dealing with the two-stage orienteering problem with stochastic weights.


  • Open Access

    Adaptive Noise Reduction for Sound Event Detection Using Subband-Weighted NMF

    by Qing Zhou, Zuren Feng, Emmanouil Benetos

    Sound event detection in real-world environments suffers from the interference of non-stationary and time-varying noise. This paper presents an adaptive noise reduction method for sound event detection based on non-negative matrix factorization (NMF). First, a scheme for noise dictionary learning from the input noisy signal is employed by the technique of robust NMF, which supports adaptation to noise variations. The estimated noise dictionary is used to develop a supervised source separation framework in combination with a pre-trained event dictionary. Second, to improve the separation quality, we extend the basic NMF model to a weighted form, with the aim of varying the relative importance of the different components when separating a target sound event from noise. With properly designed weights, the separation process is forced to rely more on those dominant event components, whereas the noise gets greatly suppressed. The proposed method is evaluated on a dataset of the rare sound event detection task of the DCASE 2017 challenge, and achieves comparable results to the top-ranking system based on convolutional recurrent neural networks (CRNNs). The proposed weighted NMF method shows an excellent noise reduction ability, and achieves an improvement of an F-score by 5%, compared to the unweighted approach.


  • Route-reduction-based dynamic programming for large-scale satellite range scheduling problem

    by Zhenbao Liu, Zuren Feng, Zhigang Ren

    Satellites offer many services through communication with stations, such as tracking, navigation, telecommand uplink, earth observation, etc. How to coordinate these services is referred to as the satellite range scheduling problem (SRSP). In the research, it is found that only the resources (referring to time slots of stations) requested by more than one satellite simultaneously influence scheduling results. These resources are called critical resources and selected as scheduling elements, which makes some jobs optimally served in advance and the problem be decomposable into a multi-stage decision process, so dynamic programming is suitable to be employed. For large-scale SRSPs, a route-reduction-based dynamic programming (RR-DP) is presented, wherein a multi-level route reduction strategy is adopted to alleviate ‘the curse of dimensionality’. Experimental results reveal that RR-DP can find optimal solutions for small-to-medium sized problems and outperforms state-of-the-art methods for large-scale problems.