Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dim...Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes.展开更多
The scene matching navigation is a research focus in the field of autonomous navigation,but the real-time performance of image matching algorithm is difficult to meet the needs of real navigation systems.Therefore,thi...The scene matching navigation is a research focus in the field of autonomous navigation,but the real-time performance of image matching algorithm is difficult to meet the needs of real navigation systems.Therefore,this paper proposes a fast image matching algorithm.The algorithm improves the traditional line segment extraction algorithm and combines with the Delaunay triangulation method.By combining the geometric features of points and lines,the image feature redundancy is reduced.Then,the error with confidence criterion is analyzed and the matching process is completed.The simulation results show that the proposed algorithm can still work within 3°rotation and small scale variation.In addition,the matching time is less than 0.5 s when the image size is 256 pixel×256 pixel.The proposed algorithm is suitable for autonomous navigation systems with multiple feature distribution and higher real-time requirements.展开更多
Objective To analyze the clinical features of the multiple trauma patients combined with spine and spinal cord injuries.Methods A retrospective study was performed in143multiple trauma patients combined with spine and...Objective To analyze the clinical features of the multiple trauma patients combined with spine and spinal cord injuries.Methods A retrospective study was performed in143multiple trauma patients combined with spine and spinal展开更多
A new method for combining features via importance-inhibition analysis （IIA） is described to obtain more effective feature combination in learning question classification. Features are combined based on the inhibiti...A new method for combining features via importance-inhibition analysis （IIA） is described to obtain more effective feature combination in learning question classification. Features are combined based on the inhibition among features as well as the importance of individual features. Experimental results on the Chinese questions set show that, the IIA method shows a gradual increase in average and maximum accuracies at all feature combinations, and achieves great improvement over the importance analysis（IA） method on the whole. Moreover, the IIA method achieves the same highest accuracy as the one by the exhaustive method, and further improves the performance of question classification.展开更多
The method of extracting the basic features of part from the file of STEPAP214 of 3-D model is proposed. All faces in the file are the minimal elements. The combination isdone for the faces with geometry restrictions ...The method of extracting the basic features of part from the file of STEPAP214 of 3-D model is proposed. All faces in the file are the minimal elements. The combination isdone for the faces with geometry restrictions and some attributes by the theory of the bestalphabetic tree which is constructed by HU--TUCKER algorithm in combination principle. So the basicfeatures could be attained. This provides the research basis to the more share and integration ofCAD information in the virtual enterprises. Finally, a case is used to illustrate the validity ofthe approach.展开更多
特征选择是面向对象信息提取的关键步骤之一。本文针对分离阈值(separability and threshold,SEaTH)这一特征选择方法在实际应用中存在的不足,例如未考虑特征值的离散程度,仅利用J-M距离评判单一特征,特征间可能存在较强相关性,以及无...特征选择是面向对象信息提取的关键步骤之一。本文针对分离阈值(separability and threshold,SEaTH)这一特征选择方法在实际应用中存在的不足,例如未考虑特征值的离散程度,仅利用J-M距离评判单一特征,特征间可能存在较强相关性,以及无法有效确定出分类顺序,提出了一种改进的SEaTH算法(optimized SEaTH,OPSEaTH)。OPSEaTH算法首先在J-M距离基础上构建了一类特征评价指标(E值),有效解决了特征值的离散度问题;然后,基于E值构建出特征组合评价指标(C_(e)值),可有效评估得到每种地物的最佳特征组合并自动确定出地物的分类顺序;最后基于eCognition等分类器可完成对地物对象的最终有效分类。利用高分二号遥感影像数据对本文方法进行了测试,并将结果分别与SEaTH算法、DPC、OIF和最近邻分类器的分类结果进行了对比,结果表明:OPSEaTH算法不仅能有效降低特征维数、优化特征空间,还能够对分类顺序进行自动化合理确定,总体精度和Kappa系数及其他精度指标,均显著优于基于SEaTH算法的特征选择结果。本文方法无论从特征降维效果、分类结果精度还是计算效率方面均优于DPC、OIF和最近邻分类器结果。OPSEaTH是一种更优的特征选择方法。展开更多
随着互联网和广告平台的飞速发展,面对海量的广告信息,为了提升用户点击率,提出一种改进的基于组合结构的逻辑回归点击预测算法LRCS(Logical Regression of Combination Structure)。该算法基于不同类别特征广告受众可能不同的特点,首先...随着互联网和广告平台的飞速发展,面对海量的广告信息,为了提升用户点击率,提出一种改进的基于组合结构的逻辑回归点击预测算法LRCS(Logical Regression of Combination Structure)。该算法基于不同类别特征广告受众可能不同的特点,首先,采用FM进行特征组合,产生两类组合特征;其次,将一类特征组合作为聚类算法的输入进行聚类;最后,将另一类特征组合输入由聚类产生的分段GBDT+逻辑回归组合的模型中进行预测。在两个公开数据集中进行了多角度验证,结果表明与其他几类常用的点击预测算法相比,LRCS在点击预测上有一定的性能提升。展开更多
基金supported by the National Natural Science Foundations of China(Nos.51205193,51475221)
文摘Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes.
基金supported by the Fundation of Graduate Innovation Center in Nanjing University of Aeronautics and Astronautics (No.kfjj20191506)
文摘The scene matching navigation is a research focus in the field of autonomous navigation,but the real-time performance of image matching algorithm is difficult to meet the needs of real navigation systems.Therefore,this paper proposes a fast image matching algorithm.The algorithm improves the traditional line segment extraction algorithm and combines with the Delaunay triangulation method.By combining the geometric features of points and lines,the image feature redundancy is reduced.Then,the error with confidence criterion is analyzed and the matching process is completed.The simulation results show that the proposed algorithm can still work within 3°rotation and small scale variation.In addition,the matching time is less than 0.5 s when the image size is 256 pixel×256 pixel.The proposed algorithm is suitable for autonomous navigation systems with multiple feature distribution and higher real-time requirements.
文摘Objective To analyze the clinical features of the multiple trauma patients combined with spine and spinal cord injuries.Methods A retrospective study was performed in143multiple trauma patients combined with spine and spinal
基金The National Natural Science Foundation of China(No.61003112,61170181)the Open Research Fund of State Key Laboratory for Novel Softw are Technology of China(No.KFKT2010B02)the Key Project of Natural Science Research for Anhui Colleges of China(No.KJ2011A048)
文摘A new method for combining features via importance-inhibition analysis （IIA） is described to obtain more effective feature combination in learning question classification. Features are combined based on the inhibition among features as well as the importance of individual features. Experimental results on the Chinese questions set show that, the IIA method shows a gradual increase in average and maximum accuracies at all feature combinations, and achieves great improvement over the importance analysis（IA） method on the whole. Moreover, the IIA method achieves the same highest accuracy as the one by the exhaustive method, and further improves the performance of question classification.
基金This project is supported by Key Laboratory Program of National Defense-Science Foundation of China (No.51458030103BQ0205)Prorincial Natural Science Foundation of Jiangsu, China (No.BK2003094).
文摘The method of extracting the basic features of part from the file of STEPAP214 of 3-D model is proposed. All faces in the file are the minimal elements. The combination isdone for the faces with geometry restrictions and some attributes by the theory of the bestalphabetic tree which is constructed by HU--TUCKER algorithm in combination principle. So the basicfeatures could be attained. This provides the research basis to the more share and integration ofCAD information in the virtual enterprises. Finally, a case is used to illustrate the validity ofthe approach.
基金This paper is supported by National Natural Science Foundation of China （No. 61074078） and Fundamental Research Funds for the Central Universities （No. 12MS121）.
文摘特征选择是面向对象信息提取的关键步骤之一。本文针对分离阈值(separability and threshold,SEaTH)这一特征选择方法在实际应用中存在的不足,例如未考虑特征值的离散程度,仅利用J-M距离评判单一特征,特征间可能存在较强相关性,以及无法有效确定出分类顺序,提出了一种改进的SEaTH算法(optimized SEaTH,OPSEaTH)。OPSEaTH算法首先在J-M距离基础上构建了一类特征评价指标(E值),有效解决了特征值的离散度问题;然后,基于E值构建出特征组合评价指标(C_(e)值),可有效评估得到每种地物的最佳特征组合并自动确定出地物的分类顺序;最后基于eCognition等分类器可完成对地物对象的最终有效分类。利用高分二号遥感影像数据对本文方法进行了测试,并将结果分别与SEaTH算法、DPC、OIF和最近邻分类器的分类结果进行了对比,结果表明:OPSEaTH算法不仅能有效降低特征维数、优化特征空间,还能够对分类顺序进行自动化合理确定,总体精度和Kappa系数及其他精度指标,均显著优于基于SEaTH算法的特征选择结果。本文方法无论从特征降维效果、分类结果精度还是计算效率方面均优于DPC、OIF和最近邻分类器结果。OPSEaTH是一种更优的特征选择方法。
文摘随着互联网和广告平台的飞速发展,面对海量的广告信息,为了提升用户点击率,提出一种改进的基于组合结构的逻辑回归点击预测算法LRCS(Logical Regression of Combination Structure)。该算法基于不同类别特征广告受众可能不同的特点,首先,采用FM进行特征组合,产生两类组合特征;其次,将一类特征组合作为聚类算法的输入进行聚类;最后,将另一类特征组合输入由聚类产生的分段GBDT+逻辑回归组合的模型中进行预测。在两个公开数据集中进行了多角度验证,结果表明与其他几类常用的点击预测算法相比,LRCS在点击预测上有一定的性能提升。
