Gaussian kernel adaptive filters with adaptive kernel bandwidth

2020 ◽  
Vol 166 ◽  
pp. 107270 ◽  
Author(s):  
Ji Zhao ◽  
Hongbin Zhang ◽  
J. Andrew Zhang
Keyword(s):  
Adaptive Filters ◽  
Gaussian Kernel ◽  
Adaptive Kernel

scholarly journals Estimation of neuronal firing rate using Bayesian Adaptive Kernel Smoother (BAKS)

2017 ◽  
Author(s):  
Nur Ahmadi ◽  
Timothy G. Constandinou ◽  
Christos-Savvas Bouganis
Keyword(s):  
Firing Rate ◽  
Spike Train ◽  
Prior Distribution ◽  
Kernel Smoothing ◽  
Neuronal Firing ◽  
Gaussian Kernel ◽  
Single Trial ◽  
Adaptive Kernel ◽  
Neuronal Firing Rate ◽  
Spike Train Data

AbstractNeurons use sequences of action potentials (spikes) to convey information across neuronal networks. In neurophysiology experiments, information about external stimuli or behavioral tasks has been frequently characterized in term of neuronal firing rate. The firing rate is conventionally estimated by averaging spiking responses across multiple similar experiments (or trials). However, there exist a number of applications in neuroscience research that require firing rate to be estimated on a single trial basis. Estimating firing rate from a single trial is a challenging problem and current state-of-the-art methods do not perform well. To address this issue, we develop a new method for estimating firing rate based on kernel smoothing technique that considers the bandwidth as a random variable with prior distribution that is adaptively updated under a Bayesian framework. By carefully selecting the prior distribution together with Gaussian kernel function, an analytical expression can be achieved for the kernel bandwidth. We refer to the proposed method as Bayesian Adaptive Kernel Smoother (BAKS). We evaluate the performance of BAKS using synthetic spike train data generated by biologically plausible models: inhomogeneous Gamma (IG) and inhomogeneous inverse Gaussian (IIG). We also apply BAKS to real spike train data from non-human primate (NHP) motor and visual cortex. We benchmark the proposed method against the established and previously reported methods. These include: optimized kernel smoother (OKS), variable kernel smoother (VKS), local polynomial fit (Locfit), and Bayesian adaptive regression splines (BARS). Results using both synthetic and real data demonstrate that the proposed method achieves better performance compared to competing methods. This suggests that the proposed method could be useful for understanding the encoding mechanism of neurons in cognitive-related tasks. The proposed method could also potentially improve the performance of brain-machine interface (BMI) decoder that relies on estimated firing rate as the input.

scholarly journals Performance evaluation of the maximum complex correntropy criterion with adaptive kernel width update

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Manoel B. L. Aquino ◽  
João P. F. Guimarães ◽  
Leandro L. S. Linhares ◽  
Aluísio I. R. Fontes ◽  
Allan M. Martins
Keyword(s):  
Free Parameter ◽  
Impulsive Noise ◽  
Gaussian Kernel ◽  
Kernel Width ◽  
Optimal Value ◽  
Gradient Solution ◽  
Adaptive Kernel ◽  
Gradient Based ◽  
Complex Valued ◽  
Steady State Performance

Abstract The complex correntropy is a recently defined similarity measure that extends the advantages of conventional correntropy to complex-valued data. As in the real-valued case, the maximum complex correntropy criterion (MCCC) employs a free parameter called kernel width, which affects the convergence rate, robustness, and steady-state performance of the method. However, determining the optimal value for such parameter is not always a trivial task. Within this context, several works have introduced adaptive kernel width algorithms to deal with this free parameter, but such solutions must be updated to manipulate complex-valued data. This work reviews and updates the most recent adaptive kernel width algorithms so that they become capable of dealing with complex-valued data using the complex correntropy. Besides that, a novel gradient-based solution is introduced to the Gaussian kernel and its respective convergence analysis. Simulations compare the performance of adaptive kernel width algorithms with different fixed kernel sizes in an impulsive noise environment. The results show that the iterative kernel adjustment improves the performance of the gradient solution for complex-valued data.

Helicopter main reduction planetary gear fault diagnosis method based on SVDD

2020 ◽  
Vol 64 (1-4) ◽  
pp. 137-145
Author(s):  
Yubin Xia ◽  
Dakai Liang ◽  
Guo Zheng ◽  
Jingling Wang ◽  
Jie Zeng
Keyword(s):  
Fault Diagnosis ◽  
Planetary Gear ◽  
Gaussian Kernel ◽  
Support Vector ◽  
Support Vector Data Description ◽  
Vector Data ◽  
Energy Characteristics ◽  
Gear Fault ◽  
Channel Information ◽  
Diagnosis Method

Aiming at the irregularity of the fault characteristics of the helicopter main reducer planetary gear, a fault diagnosis method based on support vector data description (SVDD) is proposed. The working condition of the helicopter is complex and changeable, and the fault characteristics of the planetary gear also show irregularity with the change of working conditions. It is impossible to diagnose the fault by the regularity of a single fault feature; so a method of SVDD based on Gaussian kernel function is used. By connecting the energy characteristics and fault characteristics of the helicopter main reducer running state signal and performing vector quantization, the planetary gear of the helicopter main reducer is characterized, and simultaneously couple the multi-channel information, which can accurately characterize the operational state of the planetary gear’s state.

Adaptive Filters with Codified Error LMS Algorithm

2006 ◽  
Vol 65 (6) ◽  
pp. 567-579 ◽  
Author(s):  
Jose Velazquez-Lopez ◽  
Juan Carlos Sanchez-Garcia ◽  
Hector Manuel Perez-Meana
Keyword(s):  
Adaptive Filters ◽  
Lms Algorithm

A Variable Step-Size for Sparse Nonlinear Adaptive Filters

2021 ◽  
Author(s):  
Alberto Carini ◽  
Markus V. S. Lima ◽  
Hamed Yazdanpanah ◽  
Simone Orcioni ◽  
Stefania Cecchi
Keyword(s):  
Adaptive Filters ◽  
Variable Step Size ◽  
Step Size ◽  
Variable Step

Realization of Enhanced LMS Filter Using Carry Skip Adder And Quantum Dot Cellular Automation In VLSI For Removing Impulse Noises In Medical Image

2019 ◽  
Vol 14 ◽  
Author(s):  
K.R. Shankarkumar ◽  
Gokul Kumar
Keyword(s):  
Adaptive Filtering ◽  
Adaptive Filters ◽  
Pass Band ◽  
Least Mean Square ◽  
Low Pass ◽  
Parallel Prefix ◽  
Loop Feedback ◽  
Band Pass ◽  
The Difference ◽  
Prefix Adder

: Filtering is an important step in the field of image processing to suppress the required parts or to remove any artifacts present in it. There are different types of filters like low pass, high pass, Band pass, IIR, FIR and adaptive filtering etc.., in these filters adaptive filters is an important filter because it is used to remove the noisy signal and images. Least Mean Square filter is a type of an adaptive filtering which is used to remove the noises present in the medical images. The working of LMS is based on the minimization of the difference between the error images using a closed loop feedback. Therefore presented technique called as Q-CSKA. Here the CSKA performs its operation in stages which is based on the nucleus stage. In the traditional CSKA the nucleus stage is depend on the parallel prefix adder in this work it is replaced by the QCA adder. The QCA adder utilizes the less area compared to PPA and it can be realized in Nanometer range also. For multiplexers, And OR Invert, OR and Invert logic is used to reduce the area and delay. Due to these advantages of the QCA, AOI-OAI logic the proposed method outperformed the LMS implementation in area, power, and accuracy and delay, this based five type image noise of medical pictures related to the best technique is out comes. It helps to medicinal practitioner to resolve the symptoms of patient with ease.

Sign in / Sign up

Export Citation Format

Share Document