检索结果-南通市图书馆

Quadrature Kalman particle fitler

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2010年第2期21卷 175-179页

作者： Chunlincl Wu chongzhao han School of Electronic and Control Engineering Chang'an University Xi'an 710064 P. R. China School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an 710049 P. R. China

In order to resolve the state estimation problem of nonlinear/non-Gaussian systems, a new kind of quadrature Kalman particle filter （QKPF） is proposed. In this new algorithm, quadrature Kalman filter （QKF） is used for generating the impor- tance density function. It linearizes the nonlinear functions using statistical linear regression method through a set of Gaussian- Hermite quadrature points. It need not compute the Jacobian matrix and is easy to be implemented. Moreover, the importantce density function integrates the latest measurements into system state transition density, so the approximation to the system poste- rior density is improved. The theoretical analysis and experimen- tal results show that, compared with the unscented partcle filter （UPF）, the estimation accuracy of the new particle filter is improved almost by 18%, and its calculation cost is decreased a little. So, QKPF is an effective nonlinear filtering algorithm.

关键词： particle filter statistical linear regression quadrature Kalman filter importance density function.

Dynamic weighted voting for multiple classifier fusion:a generalized rough set method

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2006年第3期17卷 487-494页

作者： Sun Liang han chongzhao School of Electronic & Information Engineering Xi'an Jiaotong Univ. Xi'an 710049 P. R. China Inst. of Information Science & Technology Zhengzhou 450001 P. R. China

To improve the performance of multiple classifier system, a knowledge discovery based dynamic weighted voting （KD-DWV） is proposed based on knowledge discovery. In the method, all base classifiers may be allowed to operate in different measurement/feature spaces to make the most of diverse classification information. The weights assigned to each output of a base classifier are estimated by the separability of training sample sets in relevant feature space. For this purpose, some decision tables （DTs） are established in terms of the diverse feature sets. And then the uncertainty measures of the separability are induced, in the form of mass functions in Dempster-Shafer theory （DST）, from each DTs based on generalized rough set model. From the mass functions, all the weights are calculated by a modified heuristic fusion function and assigned dynamically to each classifier varying with its output. The comparison experiment is performed on the hyperspectral remote sensing images. And the experimental results show that the performance of the classification can be improved by using the proposed method compared with the plurality voting （PV）.

关键词： multiple classifier fusion dynamic weighted voting generalized rough set hyperspectral.

Direct data domain approach to space-time adaptive processing

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2006年第1期17卷 59-64页

作者： Wen Xiaoqin han chongzhao School of Electronic and Information Engineering Xi'an Jiaotong Univ. Xi'an 710049 P. R. China

In non-homogeneous environment, traditional space-time adaptive processing doesn＇t effectively suppress interference and detect target, because the secondary data don＇ t exactly reflect the statistical characteristic of the range cell under test. A ravel methodology utilizing the direct data domain approach to space-time adaptive processing （ STAP ） in airbome radar non-homogeneous environments is presented. The deterministic least squares adaptive signal processing technique operates on a ＂snapshot-by-snapshot＂ basis to dethrone the adaptive adaptive weights for nulling interferences and estimating signal of interest （SOI）. Furthermore, this approach eliminates the requirement for estimating the covariance through the data of neighboring range cell, which eliminates calculating the inverse of covariance, and can be implemented to operate in real-time. Simulation results illustrate the efficiency of interference suppression in non-homogeneous environment.

关键词： space-time adaptive processing direct data domain interference suppression.

A novel approximation of basic probability assignment based on rank-level fusion

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2013年第4期26卷 993-999页

作者： Yang Yi han Deqiang han chongzhao Cao Feng State Key Laboratory for Strength and Vibration of Mechanical Structures School of Aerospace Xi'an Jiaotong University Institute of Integrated Automation MOE KLINNS Lab School of Electronic and Information Engineering Xi'an Jiaotong University School of Energy and Power Engineering Xi'an Jiaotong University

Belief functions theory is an important tool in the field of information fusion. However, when the cardinality of the frame of discernment becomes large, the high computational cost of evidence combination will become the bottleneck of belief functions theory in real applications. The basic probability assignment （BPA） approximations, which can reduce the complexity of the BPAs, are always used to reduce the computational cost of evidence combination. In this paper, both the cardinalities and the mass assignment values of focal elements are used as the criteria of reduction. The two criteria are jointly used by using rank-level fusion. Some experiments and related analyses are provided to illustrate and justify the proposed new BPA approximation approach.

关键词： Belief approximation Distance of evidence Evidence combination Information fusion Rank-level fusion

Modified center-based feature line classification approach

在线全文

学校读者我要写书评

暂无评论

Frontiers of Electrical and Electronic Engineering in China 2010年第2期5卷 173-178页

作者： Deqiang han chongzhao han Yi YANG Institute of Integrated Automation Xi’an Jiaotong UniversityXi’an 710049China

A novel classification approach called modified center-based feature line(MCFL)is proposed to reduce the computational cost of the nearest feature line(NFL)and maintain the advantages of *** NFL,MCFL defines a different type of feature line and utilizes both the query point’s local information and corresponding class-global information in training *** experiments provided,the comparisons with the nearest neighbor(NN),NFL,and other NFL-refined approaches show that the computation time of MCFL can be shortened dramatically with less accuracy *** proposed is probably a better choice for the classification application tasks of large-scale dataset.

关键词： classification nearest feature line(NFL) nearest neighbor line(NNL) center-based nearest neighbor(CNN) modified center-based feature line(MCFL)

CLASSIFIER FUSION BASED ON EVIDENCE THEORY AND ITS APPLICATION IN FACE RECOGNITION

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2009年第6期26卷 771-776页

作者： Yang Yi han chongzhao han Deqiang Institute of Integrated Automation Xi＇an Jiaotong University Xi＇an 710049 China

A multiple classifier fusion approach based on evidence combination is proposed in this paper. The individual classifier is designed based on a refined Nearest Feature Line (NFL),which is called Center-based Nearest Neighbor (CNN). CNN retains the advantages of NFL while it has relatively low computational cost. Different member classifiers are trained based on different feature spaces respectively. Corresponding mass functions can be generated based on proposed mass function determination approach. The classification decision can be made based on the combined evidence and better classification performance can be expected. Experimental results on face recognition provided verify that the new approach is rational and effective.

关键词： Nearest Feature Line (NFL) Evidence combination Classifier fusion Face recognition

A BOOSTING APPROACH FOR INTRUSION DETECTION

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2007年第3期24卷 369-373页

作者： Zan Xin han Jiuqiang Zhang Junjie Zheng Qinghua han chongzhao Dept of Automation School of Electronics and Information Engineering Xi＇an Jiaotong University Xi＇an 710040 China

Intrusion detection can be essentially regarded as a classification problem,namely,dis-tinguishing normal profiles from intrusive behaviors. This paper introduces boosting classification algorithm into the area of intrusion detection to learn attack signatures. Decision tree algorithm is used as simple base learner of boosting algorithm. Furthermore,this paper employs the Principle Com-ponent Analysis (PCA) approach,an effective data reduction approach,to extract the key attribute set from the original high-dimensional network traffic data. KDD CUP 99 data set is used in these ex-periments to demonstrate that boosting algorithm can greatly improve the classification accuracy of weak learners by combining a number of simple “weak learners”. In our experiments,the error rate of training phase of boosting algorithm is reduced from 30.2% to 8% after 10 iterations. Besides,this paper also compares boosting algorithm with Support Vector Machine (SVM) algorithm and shows that the classification accuracy of boosting algorithm is little better than SVM algorithm’s. However,the generalization ability of SVM algorithm is better than boosting algorithm.

关键词： Network security Intrusion Detection System (IDS) Machine learning Boosting algo-rithm Decision tree Support Vector Machine (SVM)

MULTITARGET STATE AND TRACK ESTIMATION FOR THE PROBABILITY HYPOTHESES DENSITY FILTER

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2009年第1期26卷 2-12页

作者： Liu Weifeng han chongzhao Lian Feng Xu Xiaobin Wen Chenglin School of Electronic Information Engineering Xi＇an Jiaotong University Xi＇an 710049 China Institute of Information and Control Hangzhou Dianzi University Hangzhou 310018 China

The particle Probability Hypotheses Density (particle-PHD) filter is a tractable approach for Random Finite Set (RFS) Bayes estimation, but the particle-PHD filter can not directly derive the target track. Most existing approaches combine the data association step to solve this problem. This paper proposes an algorithm which does not need the association step. Our basic ideal is based on the clustering algorithm of Finite Mixture Models (FMM). The intensity distribution is first derived by the particle-PHD filter, and then the clustering algorithm is applied to estimate the multitarget states and tracks jointly. The clustering process includes two steps: the prediction and update. The key to the proposed algorithm is to use the prediction as the initial points and the convergent points as the es- timates. Besides, Expectation-Maximization (EM) and Markov Chain Monte Carlo (MCMC) ap- proaches are used for the FMM parameter estimation.

关键词： Probability Hypotheses Density (PHD) Particle-PHD filter State and track estimation Finite mixture models

A new adaptive fast motion estimation algorithm based on local motion similarity degree (LMSD)

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2005年第12期15卷 1126-1134页

作者： LIU Long,han chongzhao and BAI Yan School of Electronics & Information Engineering,Xi’an Jiaotong University,Xi’an 710049,China School of Electronics and Information Engineering Xi'an Jiaotong University Xi'an 710049 China

In the motion vector field adaptive search technique (MVFAST) and the predictive motion vector field adaptive search technique (PMVFAST),the size of the largest motion vector from the three adjacent blocks (left,top,top-right) is compared with the threshold to select different search *** a suitable search center and search pattern will not be selected in the adaptive search technique when the adjacent motion vectors are not coherent in local *** paper presents an efficient adaptive search *** motion vector variation degree (MVVD) is considered a reasonable factor for adaptive search *** the relationship between local motion similarity degree (LMSD) and the variation degree of motion vector (MVVD),the motion vectors are classified as three categories according to corresponding LMSD; then different proposed search schemes are adopted for motion *** experimental results show that the proposed algorithm has a significant computational speedup compared with MVFAST and PMVFAST algorithms,and offers a similar,even better performance.

关键词： motion estimation motion vector video coding local motion