期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Kernel density estimation and marginalized-particle based probability hypothesis density filter for multi-target tracking 被引量:3
1
作者 张路平 王鲁平 +1 位作者 李飚 赵明 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第3期956-965,共10页
In order to improve the performance of the probability hypothesis density(PHD) algorithm based particle filter(PF) in terms of number estimation and states extraction of multiple targets, a new probability hypothesis ... In order to improve the performance of the probability hypothesis density(PHD) algorithm based particle filter(PF) in terms of number estimation and states extraction of multiple targets, a new probability hypothesis density filter algorithm based on marginalized particle and kernel density estimation is proposed, which utilizes the idea of marginalized particle filter to enhance the estimating performance of the PHD. The state variables are decomposed into linear and non-linear parts. The particle filter is adopted to predict and estimate the nonlinear states of multi-target after dimensionality reduction, while the Kalman filter is applied to estimate the linear parts under linear Gaussian condition. Embedding the information of the linear states into the estimated nonlinear states helps to reduce the estimating variance and improve the accuracy of target number estimation. The meanshift kernel density estimation, being of the inherent nature of searching peak value via an adaptive gradient ascent iteration, is introduced to cluster particles and extract target states, which is independent of the target number and can converge to the local peak position of the PHD distribution while avoiding the errors due to the inaccuracy in modeling and parameters estimation. Experiments show that the proposed algorithm can obtain higher tracking accuracy when using fewer sampling particles and is of lower computational complexity compared with the PF-PHD. 展开更多
关键词 particle filter with probability hypothesis density marginalized particle filter meanshift kernel density estimation multi-target tracking
在线阅读 下载PDF
PM_(2.5) probabilistic forecasting system based on graph generative network with graph U-nets architecture
2
作者 LI Yan-fei YANG Rui +1 位作者 DUAN Zhu LIU Hui 《Journal of Central South University》 2025年第1期304-318,共15页
Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific ... Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific basis for governance and prevention efforts.In this paper,we propose an interval prediction method that considers the spatio-temporal characteristic information of PM_(2.5)signals from multiple stations.K-nearest neighbor(KNN)algorithm interpolates the lost signals in the process of collection,transmission,and storage to ensure the continuity of data.Graph generative network(GGN)is used to process time-series meteorological data with complex structures.The graph U-Nets framework is introduced into the GGN model to enhance its controllability to the graph generation process,which is beneficial to improve the efficiency and robustness of the model.In addition,sparse Bayesian regression is incorporated to improve the dimensional disaster defect of traditional kernel density estimation(KDE)interval prediction.With the support of sparse strategy,sparse Bayesian regression kernel density estimation(SBR-KDE)is very efficient in processing high-dimensional large-scale data.The PM_(2.5)data of spring,summer,autumn,and winter from 34 air quality monitoring sites in Beijing verified the accuracy,generalization,and superiority of the proposed model in interval prediction. 展开更多
关键词 PM_(2.5)interval forecasting graph generative network graph U-Nets sparse Bayesian regression kernel density estimation spatial-temporal characteristics
在线阅读 下载PDF
Data driven particle size estimation of hematite grinding process using stochastic configuration network with robust technique 被引量:6
3
作者 DAI Wei LI De-peng +1 位作者 CHEN Qi-xin CHAI Tian-you 《Journal of Central South University》 SCIE EI CAS CSCD 2019年第1期43-62,共20页
As a production quality index of hematite grinding process,particle size(PS)is hard to be measured in real time.To achieve the PS estimation,this paper proposes a novel data driven model of PS using stochastic configu... As a production quality index of hematite grinding process,particle size(PS)is hard to be measured in real time.To achieve the PS estimation,this paper proposes a novel data driven model of PS using stochastic configuration network(SCN)with robust technique,namely,robust SCN(RSCN).Firstly,this paper proves the universal approximation property of RSCN with weighted least squares technique.Secondly,three robust algorithms are presented by employing M-estimation with Huber loss function,M-estimation with interquartile range(IQR)and nonparametric kernel density estimation(NKDE)function respectively to set the penalty weight.Comparison experiments are first carried out based on the UCI standard data sets to verify the effectiveness of these methods,and then the data-driven PS model based on the robust algorithms are established and verified.Experimental results show that the RSCN has an excellent performance for the PS estimation. 展开更多
关键词 hematite grinding process particle size stochastic configuration network robust technique M-estimation nonparametric kernel density estimation
在线阅读 下载PDF
Bandwidth adaption for kernel particle filter 被引量:1
4
作者 Fu Li Guangming Shi Fei Qi Li Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第2期340-346,共7页
A novel particle filter bandwidth adaption for kernel particle filter (BAKPF) is proposed. Selection of the kernel bandwidth is a critical issue in kernel density estimation (KDE). The plug-in method is adopted to... A novel particle filter bandwidth adaption for kernel particle filter (BAKPF) is proposed. Selection of the kernel bandwidth is a critical issue in kernel density estimation (KDE). The plug-in method is adopted to get the global fixed bandwidth by optimizing the asymptotic mean integrated squared error (AMISE) firstly. Then, particle-driven bandwidth selection is invoked in the KDE. To get a more effective allocation of the particles, the KDE with adap- tive bandwidth in the BAKPF is used to approximate the posterior probability density function (PDF) by moving particles toward the posterior. A closed-form expression of the true distribution is given. The simulation results show that the proposed BAKPF performs better than the standard particle filter (PF), unscented particle filter (UPF) and the kernel particle filter (KPF) both in efficiency and estimation precision. 展开更多
关键词 kernel density estimation adaptive bandwidth kernel particle filter.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部