The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods.However,reentry flight is accompanied by complex flight environments,which brings to the ...The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods.However,reentry flight is accompanied by complex flight environments,which brings to the uncertain,complex,and strongly coupled non-Gaussian detection noise.As a result,there are several intractable considerations on the problem of state estimation tasks corrupted by complex non-Gaussian outliers for non-linear dynamics systems in practical application.To address these issues,a new iterated rational quadratic(RQ)kernel high-order unscented Kalman filtering(IRQHUKF)algorithm via capturing the statistics to break through the limitations of the Gaussian assumption is proposed.Firstly,the characteristic analysis of the RQ kernel is investigated in detail,which is the first attempt to carry out an exploration of the heavy-tailed characteristic and the ability on capturing highorder moments of the RQ kernel.Subsequently,the RQ kernel method is first introduced into the UKF algorithm as an error optimization criterion,termed the iterated RQ kernel-UKF(RQ-UKF)algorithm by derived analytically,which not only retains the high-order moments propagation process but also enhances the approximation capacity in the non-Gaussian noise problem for its ability in capturing highorder moments and heavy-tailed characteristics.Meanwhile,to tackle the limitations of the Gaussian distribution assumption in the linearization process of the non-linear systems,the high-order Sigma Points(SP)as a subsidiary role in propagating the state high-order statistics is devised by the moments matching method to improve the RQ-UKF.Finally,to further improve the flexibility of the IRQ-HUKF algorithm in practical application,an adaptive kernel parameter is derived analytically grounded in the Kullback-Leibler divergence(KLD)method and parametric sensitivity analysis of the RQ kernel.The simulation results demonstrate that the novel IRQ-HUKF algorithm is more robust and outperforms the existing advanced UKF with respect to the kernel method in reentry vehicle tracking scenarios under various noise environments.展开更多
Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is...Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.展开更多
提出通过String Kernel方法把负实例语法数据库中的负实例转化成核矩阵,再用Kernel Principal Component Analysis(KPCA)对转换的核矩阵进行特征提取,进而可将原始负实例数据库按照这些特征分成多个容量较小的特征表。通过构造负实例特...提出通过String Kernel方法把负实例语法数据库中的负实例转化成核矩阵,再用Kernel Principal Component Analysis(KPCA)对转换的核矩阵进行特征提取,进而可将原始负实例数据库按照这些特征分成多个容量较小的特征表。通过构造负实例特征索引表设计了一个分类器,待检查的句子通过此分类器被分配到某个负实例特征表里进行匹配搜索,而此特征表的特征属性数和记录数要远远小于原始负实例数据库中的相应数目,从而大大提高了检查的速度,同时不影响语法检查的精度。通过比较测试,可看出提出的方法在保证语法检查精确度的同时有更快的速度。展开更多
对农作物品种正确分类是作物分类学的重要内容,为考察X-ray成像技术对小麦品种分类研究的有效性,基于软X-ray成像仪采集的3品种(Kama,Rosa and Canadian)每个品种70个籽粒,共210个籽粒样本的X-ray扫描图像,并针对其7个形态几何特征(面...对农作物品种正确分类是作物分类学的重要内容,为考察X-ray成像技术对小麦品种分类研究的有效性,基于软X-ray成像仪采集的3品种(Kama,Rosa and Canadian)每个品种70个籽粒,共210个籽粒样本的X-ray扫描图像,并针对其7个形态几何特征(面积、周长、紧致度、籽粒长度、宽度、偏斜度、种子腹沟长度),提出了一种使用Kernel-ICA的方法先对特征进行优化,再进行小麦品种的聚类与识别的方法,并与K-means、C-means 2种聚类方法以及基于工神经网络(ANN)和支持向量机(SVM)2种识别方法的分类结果进行比较,结果发现:分类正确率从高到低分别为:Kernel-ICA、SVM、C-means、K-means、BP-ANN,分类正确率分别为:91.9%、90.5%、89.5%、87.1%、86.9%。研究提出的Kernel-ICA的方法,聚类优化和识别能力较强,对软X-ray成像的小麦品种进行分类,已基本上满足农艺上对小麦品种分类需要,对农作物种质资源鉴别和作物品种分类研究具有积极意义。展开更多
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.展开更多
A recursive Kernel eigenspace updating algorithm was proposed to build the soft sensor for end-product quality.The updating procedure was composed of two sub-stages,i.e.firstly performing forward increasing updating a...A recursive Kernel eigenspace updating algorithm was proposed to build the soft sensor for end-product quality.The updating procedure was composed of two sub-stages,i.e.firstly performing forward increasing updating and then followed by backward decreasing updating,which drastically decreased the required computation workload.Further,the whole Kernel matrix did not need to be stored.Simulation study on the Tennessee Eastman process showed that the consequent impurity component model had satisfying precision under both normal and faulty operations,which was obviously superior to the offline batch model and meanwhile approximated the performance of model obtained by successively applying the time-consuming traditional eigenvalue numerical algorithm.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.12072090.
文摘The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods.However,reentry flight is accompanied by complex flight environments,which brings to the uncertain,complex,and strongly coupled non-Gaussian detection noise.As a result,there are several intractable considerations on the problem of state estimation tasks corrupted by complex non-Gaussian outliers for non-linear dynamics systems in practical application.To address these issues,a new iterated rational quadratic(RQ)kernel high-order unscented Kalman filtering(IRQHUKF)algorithm via capturing the statistics to break through the limitations of the Gaussian assumption is proposed.Firstly,the characteristic analysis of the RQ kernel is investigated in detail,which is the first attempt to carry out an exploration of the heavy-tailed characteristic and the ability on capturing highorder moments of the RQ kernel.Subsequently,the RQ kernel method is first introduced into the UKF algorithm as an error optimization criterion,termed the iterated RQ kernel-UKF(RQ-UKF)algorithm by derived analytically,which not only retains the high-order moments propagation process but also enhances the approximation capacity in the non-Gaussian noise problem for its ability in capturing highorder moments and heavy-tailed characteristics.Meanwhile,to tackle the limitations of the Gaussian distribution assumption in the linearization process of the non-linear systems,the high-order Sigma Points(SP)as a subsidiary role in propagating the state high-order statistics is devised by the moments matching method to improve the RQ-UKF.Finally,to further improve the flexibility of the IRQ-HUKF algorithm in practical application,an adaptive kernel parameter is derived analytically grounded in the Kullback-Leibler divergence(KLD)method and parametric sensitivity analysis of the RQ kernel.The simulation results demonstrate that the novel IRQ-HUKF algorithm is more robust and outperforms the existing advanced UKF with respect to the kernel method in reentry vehicle tracking scenarios under various noise environments.
基金supported by the National Natural Science Fundation of China (60736021)the Joint Funds of NSFC-Guangdong Province(U0735003)
文摘Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.
文摘提出通过String Kernel方法把负实例语法数据库中的负实例转化成核矩阵,再用Kernel Principal Component Analysis(KPCA)对转换的核矩阵进行特征提取,进而可将原始负实例数据库按照这些特征分成多个容量较小的特征表。通过构造负实例特征索引表设计了一个分类器,待检查的句子通过此分类器被分配到某个负实例特征表里进行匹配搜索,而此特征表的特征属性数和记录数要远远小于原始负实例数据库中的相应数目,从而大大提高了检查的速度,同时不影响语法检查的精度。通过比较测试,可看出提出的方法在保证语法检查精确度的同时有更快的速度。
文摘对农作物品种正确分类是作物分类学的重要内容,为考察X-ray成像技术对小麦品种分类研究的有效性,基于软X-ray成像仪采集的3品种(Kama,Rosa and Canadian)每个品种70个籽粒,共210个籽粒样本的X-ray扫描图像,并针对其7个形态几何特征(面积、周长、紧致度、籽粒长度、宽度、偏斜度、种子腹沟长度),提出了一种使用Kernel-ICA的方法先对特征进行优化,再进行小麦品种的聚类与识别的方法,并与K-means、C-means 2种聚类方法以及基于工神经网络(ANN)和支持向量机(SVM)2种识别方法的分类结果进行比较,结果发现:分类正确率从高到低分别为:Kernel-ICA、SVM、C-means、K-means、BP-ANN,分类正确率分别为:91.9%、90.5%、89.5%、87.1%、86.9%。研究提出的Kernel-ICA的方法,聚类优化和识别能力较强,对软X-ray成像的小麦品种进行分类,已基本上满足农艺上对小麦品种分类需要,对农作物种质资源鉴别和作物品种分类研究具有积极意义。
基金supported by the National Natural Science Foundation of China (60736043 60805012)the Fundamental Research Funds for the Central Universities (K50510020032)
文摘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.
文摘A recursive Kernel eigenspace updating algorithm was proposed to build the soft sensor for end-product quality.The updating procedure was composed of two sub-stages,i.e.firstly performing forward increasing updating and then followed by backward decreasing updating,which drastically decreased the required computation workload.Further,the whole Kernel matrix did not need to be stored.Simulation study on the Tennessee Eastman process showed that the consequent impurity component model had satisfying precision under both normal and faulty operations,which was obviously superior to the offline batch model and meanwhile approximated the performance of model obtained by successively applying the time-consuming traditional eigenvalue numerical algorithm.
