Quantized kernel least mean square(QKLMS) algorithm is an effective nonlinear adaptive online learning algorithm with good performance in constraining the growth of network size through the use of quantization for inp...Quantized kernel least mean square(QKLMS) algorithm is an effective nonlinear adaptive online learning algorithm with good performance in constraining the growth of network size through the use of quantization for input space. It can serve as a powerful tool to perform complex computing for network service and application. With the purpose of compressing the input to further improve learning performance, this article proposes a novel QKLMS with entropy-guided learning, called EQ-KLMS. Under the consecutive square entropy learning framework, the basic idea of entropy-guided learning technique is to measure the uncertainty of the input vectors used for QKLMS, and delete those data with larger uncertainty, which are insignificant or easy to cause learning errors. Then, the dataset is compressed. Consequently, by using square entropy, the learning performance of proposed EQ-KLMS is improved with high precision and low computational cost. The proposed EQ-KLMS is validated using a weather-related dataset, and the results demonstrate the desirable performance of our scheme.展开更多
The state of charge(SOC)estimation of lithium-ion battery is an important function in the battery management system(BMS)of electric vehicles.The long short term memory(LSTM)model can be employed for SOC estimation,whi...The state of charge(SOC)estimation of lithium-ion battery is an important function in the battery management system(BMS)of electric vehicles.The long short term memory(LSTM)model can be employed for SOC estimation,which is capable of estimating the future changing states of a nonlinear system.Since the BMS usually works under complicated operating conditions,i.e the real measurement data used for model training may be corrupted by non-Gaussian noise,and thus the performance of the original LSTM with the mean square error(MSE)loss may deteriorate.Therefore,a novel LSTM with mixture kernel mean p-power error(MKMPE)loss,called MKMPE-LSTM,is developed by using the MKMPE loss to replace the MSE as the learning criterion in LSTM framework,which can achieve robust SOC estimation under the measurement data contaminated with non-Gaussian noises(or outliers)because of the MKMPE containing the p-order moments of the error distribution.In addition,a meta-heuristic algorithm,called heap-based-optimizer(HBO),is employed to optimize the hyper-parameters(mainly including learning rate,number of hidden layer neuron and value of p in MKMPE)of the proposed MKMPE-LSTM model to further improve its flexibility and generalization performance,and a novel hybrid model(HBO-MKMPE-LSTM)is established for SOC estimation under non-Gaussian noise cases.Finally,several tests are performed under various cases through a benchmark to evaluate the performance of the proposed HBO-MKMPE-LSTM model,and the results demonstrate that the proposed hybrid method can provide a good robustness and accuracy under different non-Gaussian measurement noises,and the SOC estimation results in terms of mean square error(MSE),root MSE(RMSE),mean absolute relative error(MARE),and determination coefficient R2are less than 0.05%,3%,3%,and above 99.8%at 25℃,respectively.展开更多
Considering that the prediction accuracy of the traditional traffic flow forecasting model is low,based on kernel adaptive filter(KAF)algorithm,kernel least mean square(KLMS)algorithm and fixed-budget kernel recursive...Considering that the prediction accuracy of the traditional traffic flow forecasting model is low,based on kernel adaptive filter(KAF)algorithm,kernel least mean square(KLMS)algorithm and fixed-budget kernel recursive least-square(FB-KRLS)algorithm are presented for online adaptive prediction.The computational complexity of the KLMS algorithm is low and does not require additional solution paradigm constraints,but its regularization process can solve the problem of regularization performance degradation in high-dimensional data processing.To reduce the computational complexity,the sparse criterion is introduced into the KLMS algorithm.To further improve forecasting accuracy,FB-KRLS algorithm is proposed.It is an online learning method with fixed memory budget,and it is capable of recursively learning a nonlinear mapping and changing over time.In contrast to a previous approximate linear dependence(ALD)based technique,the purpose of the presented algorithm is not to prune the oldest data point in every time instant but it aims to prune the least significant data point,thus suppressing the growth of kernel matrix.In order to verify the validity of the proposed methods,they are applied to one-step and multi-step predictions of traffic flow in Beijing.Under the same conditions,they are compared with online adaptive ALD-KRLS method and other kernel learning methods.Experimental results show that the proposed KAF algorithms can improve the prediction accuracy,and its online learning ability meets the actual requirements of traffic flow and contributes to real-time online forecasting of traffic flow.展开更多
With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued no...With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square（LMS） algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error（MSE） performance among of complex kernel LMS（KLMS） methods according to the specified kernel bandwidth and the length of dictionary.展开更多
The continuous stirred tank reactor(CSTR)is one of the typical chemical processes.Aiming at its strong nonlinear characteristics,a quantized kernel least mean square(QKLMS)algorithm is proposed.The QKLMS algorithm is ...The continuous stirred tank reactor(CSTR)is one of the typical chemical processes.Aiming at its strong nonlinear characteristics,a quantized kernel least mean square(QKLMS)algorithm is proposed.The QKLMS algorithm is based on a simple online vector quantization technology instead of sparsification,which can compress the input or feature space and suppress the growth of the radial basis function(RBF)structure in the kernel learning algorithm.To verify the effectiveness of the algorithm,it is applied to the model identification of CSTR process to construct a nonlinear mapping relationship between coolant flow rate and product concentration.In additiion,the proposed algorithm is further compared with least squares support vector machine(LS-SVM),echo state network(ESN),extreme learning machine with kernels(KELM),etc.The experimental results show that the proposed algorithm has higher identification accuracy and better online learning ability under the same conditions.展开更多
A Single Image Super-Resolution (SISR) reconstruction method that uses clustered sparse representation and adaptive patch aggregation is proposed. First, we randomly extract image patch pairs from the training images,...A Single Image Super-Resolution (SISR) reconstruction method that uses clustered sparse representation and adaptive patch aggregation is proposed. First, we randomly extract image patch pairs from the training images, and divide these patch pairs into different groups by K-means clustering. Then, we learn an over-complete sub-dictionary pair offline from corresponding group patch pairs. For a given low-resolution patch, we adaptively select one sub-dictionary to reconstruct the high resolution patch online. In addition, non-local self-similarity and steering kernel regression constraints are integrated into patch aggregation to improve the quality of the recovered images. Experiments show that the proposed method is able to realize state-of-the-art performance in terms of both objective evaluation and visual perception.展开更多
To address the problem of underwater multi-sensor multi-target passive tracking in clutter,a distributed kernel mean embedding-based Gaussian belief propagation(DKME-GaBP)algorithm is proposed.First,a joint posterior ...To address the problem of underwater multi-sensor multi-target passive tracking in clutter,a distributed kernel mean embedding-based Gaussian belief propagation(DKME-GaBP)algorithm is proposed.First,a joint posterior probability density function(PDF)is established and factorized,and it is represented by the corresponding factor graph.Then,the GaBP algorithm is executed on this factor graph to reduce the computational complexity of data association.The factor graph of the GaBP consists of inner and outer loops.The inner loop is responsible for local track estimation and data association.The outer loop fuses information from different sensors.For the inner loop,the kernel mean embedding(KME)with a Gaussian kernel is designed to transform the strong nonlinear problem of local estimation into a linear problem in a high-dimensional reproducing kernel Hilbert space(RKHS).For the outer loop,a multi-sensor distributed fusion method based on KME is proposed to improve fusion accuracy by accounting for the distance among different PDFs in RKHS.The effectiveness and robustness of the DKME-GaBP are validated in the simulations.展开更多
基金supported by the National Key Technologies R&D Program of China under Grant No. 2015BAK38B01the National Natural Science Foundation of China under Grant Nos. 61174103 and 61603032+4 种基金the National Key Research and Development Program of China under Grant Nos. 2016YFB0700502, 2016YFB1001404, and 2017YFB0702300the China Postdoctoral Science Foundation under Grant No. 2016M590048the Fundamental Research Funds for the Central Universities under Grant No. 06500025the University of Science and Technology Beijing - Taipei University of Technology Joint Research Program under Grant No. TW201610the Foundation from the Taipei University of Technology of Taiwan under Grant No. NTUT-USTB-105-4
文摘Quantized kernel least mean square(QKLMS) algorithm is an effective nonlinear adaptive online learning algorithm with good performance in constraining the growth of network size through the use of quantization for input space. It can serve as a powerful tool to perform complex computing for network service and application. With the purpose of compressing the input to further improve learning performance, this article proposes a novel QKLMS with entropy-guided learning, called EQ-KLMS. Under the consecutive square entropy learning framework, the basic idea of entropy-guided learning technique is to measure the uncertainty of the input vectors used for QKLMS, and delete those data with larger uncertainty, which are insignificant or easy to cause learning errors. Then, the dataset is compressed. Consequently, by using square entropy, the learning performance of proposed EQ-KLMS is improved with high precision and low computational cost. The proposed EQ-KLMS is validated using a weather-related dataset, and the results demonstrate the desirable performance of our scheme.
基金supported by the National Key R.D Program of China(2021YFB2401904)the Joint Fund project of the National Natural Science Foundation of China(U21A20485)+1 种基金the National Natural Science Foundation of China(61976175)the Key Laboratory Project of Shaanxi Provincial Education Department Scientific Research Projects(20JS109)。
文摘The state of charge(SOC)estimation of lithium-ion battery is an important function in the battery management system(BMS)of electric vehicles.The long short term memory(LSTM)model can be employed for SOC estimation,which is capable of estimating the future changing states of a nonlinear system.Since the BMS usually works under complicated operating conditions,i.e the real measurement data used for model training may be corrupted by non-Gaussian noise,and thus the performance of the original LSTM with the mean square error(MSE)loss may deteriorate.Therefore,a novel LSTM with mixture kernel mean p-power error(MKMPE)loss,called MKMPE-LSTM,is developed by using the MKMPE loss to replace the MSE as the learning criterion in LSTM framework,which can achieve robust SOC estimation under the measurement data contaminated with non-Gaussian noises(or outliers)because of the MKMPE containing the p-order moments of the error distribution.In addition,a meta-heuristic algorithm,called heap-based-optimizer(HBO),is employed to optimize the hyper-parameters(mainly including learning rate,number of hidden layer neuron and value of p in MKMPE)of the proposed MKMPE-LSTM model to further improve its flexibility and generalization performance,and a novel hybrid model(HBO-MKMPE-LSTM)is established for SOC estimation under non-Gaussian noise cases.Finally,several tests are performed under various cases through a benchmark to evaluate the performance of the proposed HBO-MKMPE-LSTM model,and the results demonstrate that the proposed hybrid method can provide a good robustness and accuracy under different non-Gaussian measurement noises,and the SOC estimation results in terms of mean square error(MSE),root MSE(RMSE),mean absolute relative error(MARE),and determination coefficient R2are less than 0.05%,3%,3%,and above 99.8%at 25℃,respectively.
基金National Natural Science Foundation of China(No.51467008)
文摘Considering that the prediction accuracy of the traditional traffic flow forecasting model is low,based on kernel adaptive filter(KAF)algorithm,kernel least mean square(KLMS)algorithm and fixed-budget kernel recursive least-square(FB-KRLS)algorithm are presented for online adaptive prediction.The computational complexity of the KLMS algorithm is low and does not require additional solution paradigm constraints,but its regularization process can solve the problem of regularization performance degradation in high-dimensional data processing.To reduce the computational complexity,the sparse criterion is introduced into the KLMS algorithm.To further improve forecasting accuracy,FB-KRLS algorithm is proposed.It is an online learning method with fixed memory budget,and it is capable of recursively learning a nonlinear mapping and changing over time.In contrast to a previous approximate linear dependence(ALD)based technique,the purpose of the presented algorithm is not to prune the oldest data point in every time instant but it aims to prune the least significant data point,thus suppressing the growth of kernel matrix.In order to verify the validity of the proposed methods,they are applied to one-step and multi-step predictions of traffic flow in Beijing.Under the same conditions,they are compared with online adaptive ALD-KRLS method and other kernel learning methods.Experimental results show that the proposed KAF algorithms can improve the prediction accuracy,and its online learning ability meets the actual requirements of traffic flow and contributes to real-time online forecasting of traffic flow.
基金supported by the National Natural Science Foundation of China(6100115361271415+4 种基金6140149961531015)the Fundamental Research Funds for the Central Universities(3102014JCQ010103102014ZD0041)the Opening Research Foundation of State Key Laboratory of Underwater Information Processing and Control(9140C231002130C23085)
文摘With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square（LMS） algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error（MSE） performance among of complex kernel LMS（KLMS） methods according to the specified kernel bandwidth and the length of dictionary.
基金National Natural Science Foundation of China(No.51467008)Scientific Research Projects of Colleges and Universities in Gansu Province(Nos.2018C-10,2017D-09)。
文摘The continuous stirred tank reactor(CSTR)is one of the typical chemical processes.Aiming at its strong nonlinear characteristics,a quantized kernel least mean square(QKLMS)algorithm is proposed.The QKLMS algorithm is based on a simple online vector quantization technology instead of sparsification,which can compress the input or feature space and suppress the growth of the radial basis function(RBF)structure in the kernel learning algorithm.To verify the effectiveness of the algorithm,it is applied to the model identification of CSTR process to construct a nonlinear mapping relationship between coolant flow rate and product concentration.In additiion,the proposed algorithm is further compared with least squares support vector machine(LS-SVM),echo state network(ESN),extreme learning machine with kernels(KELM),etc.The experimental results show that the proposed algorithm has higher identification accuracy and better online learning ability under the same conditions.
基金partially supported by the National Natural Science Foundation of China under Grants No. 61071146, No. 61171165the Natural Science Foundation of Jiangsu Province under Grant No. BK2010488+1 种基金sponsored by Qing Lan Project, Project 333 "The Six Top Talents" of Jiangsu Province
文摘A Single Image Super-Resolution (SISR) reconstruction method that uses clustered sparse representation and adaptive patch aggregation is proposed. First, we randomly extract image patch pairs from the training images, and divide these patch pairs into different groups by K-means clustering. Then, we learn an over-complete sub-dictionary pair offline from corresponding group patch pairs. For a given low-resolution patch, we adaptively select one sub-dictionary to reconstruct the high resolution patch online. In addition, non-local self-similarity and steering kernel regression constraints are integrated into patch aggregation to improve the quality of the recovered images. Experiments show that the proposed method is able to realize state-of-the-art performance in terms of both objective evaluation and visual perception.
基金supported by the National Natural Science Foundation of China(Nos.62371173,U22A2044,and U22A2047)the Stable Supporting Fund of Acoustic Science and Technology Laboratory(NO.JCKYS2024604SSJS009)。
文摘To address the problem of underwater multi-sensor multi-target passive tracking in clutter,a distributed kernel mean embedding-based Gaussian belief propagation(DKME-GaBP)algorithm is proposed.First,a joint posterior probability density function(PDF)is established and factorized,and it is represented by the corresponding factor graph.Then,the GaBP algorithm is executed on this factor graph to reduce the computational complexity of data association.The factor graph of the GaBP consists of inner and outer loops.The inner loop is responsible for local track estimation and data association.The outer loop fuses information from different sensors.For the inner loop,the kernel mean embedding(KME)with a Gaussian kernel is designed to transform the strong nonlinear problem of local estimation into a linear problem in a high-dimensional reproducing kernel Hilbert space(RKHS).For the outer loop,a multi-sensor distributed fusion method based on KME is proposed to improve fusion accuracy by accounting for the distance among different PDFs in RKHS.The effectiveness and robustness of the DKME-GaBP are validated in the simulations.
