Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with ...Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-展开更多
Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large am...Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.展开更多
针对水声目标信号复杂、样本获取难度大且富含不确定信息的问题,研究了一种新的证据K类近邻识别算法(Evidence K Nearest Neighbor,EK-NN)。首先在水声目标的各类训练样本中,根据特征距离大小选取待识别目标的K近邻,并构造其基本置信指...针对水声目标信号复杂、样本获取难度大且富含不确定信息的问题,研究了一种新的证据K类近邻识别算法(Evidence K Nearest Neighbor,EK-NN)。首先在水声目标的各类训练样本中,根据特征距离大小选取待识别目标的K近邻,并构造其基本置信指派函数。然后使用证据理论中的Dempster-Shafer(D-S)规则对各类别下的近邻证据进行组合,最后再应用冲突置信的比例分配规则5(Redistribute Conflicting mass proportionally rule5,PCR5)将所有类别的组合证据进行融合,并根据融合结果和所设立的分类规则来判断目标的类别属性。根据水声目标实测数据,将新算法与其他几种常见的水声目标识别算法进行了对比分析,结果表明新算法能有效提高识别的准确率。展开更多
基金This project was supported by Shanghai Shu Guang Project.
文摘Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-
文摘Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.
文摘为了改善利用SCATS交通数据估计路段行程时间的效果,通过分析SCATS实际交通数据获取时间间隔不一致的特征,构建了SCATS交通数据虚拟时间序列,将利用因子分析法提取的累计贡献率在85%以上的主因子作为交通模式特征向量的构成要素,用欧氏距离作为当前交通模式特征向量和历史交通模式特征向量相似性的测度指标,以路段行程时间估计误差最小为目标选取当前交通模式的近邻数,对交通模式之间距离的倒数进行归一化处理,确定了相似交通模式的行程时间权重,设计了基于SCATS交通数据的路段行程时间估计方法.实例结果表明:与多元线性回归方法相比,本文方法估计的路段行程时间平均绝对误差、平均绝对百分比误差和均方根误差分别平均减少了9.68 s、8.07%和4.5 s.
文摘针对水声目标信号复杂、样本获取难度大且富含不确定信息的问题,研究了一种新的证据K类近邻识别算法(Evidence K Nearest Neighbor,EK-NN)。首先在水声目标的各类训练样本中,根据特征距离大小选取待识别目标的K近邻,并构造其基本置信指派函数。然后使用证据理论中的Dempster-Shafer(D-S)规则对各类别下的近邻证据进行组合,最后再应用冲突置信的比例分配规则5(Redistribute Conflicting mass proportionally rule5,PCR5)将所有类别的组合证据进行融合,并根据融合结果和所设立的分类规则来判断目标的类别属性。根据水声目标实测数据,将新算法与其他几种常见的水声目标识别算法进行了对比分析,结果表明新算法能有效提高识别的准确率。
