Grid pattern recognition in road networks using the C4.5 algorithm

Pattern recognition in road networks can be used for different applications, including spatiotemporal data mining, automated map generalization, data matching of different levels of detail, and other important research topics. Grid patterns are a common pattern type. This paper proposes and implements a method for grid pattern recognition based on the idea of mesh classification through a supervised learning process. To train the classifier, training datasets are selected from worldwide city samples with different cultural, historical, and geographical environments. Meshes are subsequently labeled as composing or noncomposing grids by participants in an experiment, and the mesh measures are defined while accounting for the mesh’s individual characteristics and spatial context. The classifier is generated using the C4.5 algorithm. The accuracy of the classifier is evaluated using Kappa statistics and the overall rate of correctness. The average Kappa value is approximately 0.74, which corresponds to a total accuracy of 87.5%. Additionally, the rationality of the classifier is evaluated in an interpretation step. Two other existing grid pattern recognition methods were also tested on the datasets, and comparison results indicate that our approach is effective in identifying grid patterns in road networks.     

基于不同邻近标签数选择的LANDMARC定位算法研究

对于基于射频识别的LANDMARC室内定位算法而言,该系统采用"k近邻"算法,通过选取k个与待测标签相邻且符合特定条件的参考标签,最后根据这些标签的位置结合权值估算出待测标签的坐标信息.但是在实际的操作过程中,最近邻参考标签数的选取无指导原则,具有一定的盲目性.针对这一问题,通过选取与待定位参考点最近邻的参考节点作为未知点,通过搜索法获得最优的邻近标签数k,在随后的未知节点的定位过程中,选取k个邻近标签进行定位.经过多次实验,最终得出结论,使用改进后的LANDMARC算法的性能要优于原来经典的LANDMARC算法,精确度提升了10%左右,同时避免了k值选取的盲目性.     

基于A*算法的路网数据组织

路网的数据组织是路径规划算法设计的基础。采用C++标准模板库实现基于A*算法的路网数据组织,着重从路网的拓扑结构、空间索引、A*算法数据结构、分层和分网格组织几方面来讨论。最后给出实例证明其有效性。     

平面点集凸壳的一种快速算法

提出一种计算平面点集凸壳的快速算法———八方向极值快速凸壳算法。该算法首先对平面点集进行一次扫描,从而快速查找到东、南、西、北、东南、西南、东北、西北8个方向上的极值点,构造出一个更接近凸壳的初始凸壳,从而在后续的点集扫描中可以排除更多的内点,使该算法计算效率更高。该算法的空间复杂度为O(N);其时间复杂度虽然无法突破最坏情况下O(NlogN)的理论下限,但其期望时间复杂度已达到线性水平,并且可以容易地扩展到三维和高维空间。     

机载测雨雷达两种反演方法的优化和综合利用的模拟研究

由于机载雷达的天线不能做得太大,如果想获得一个较好的束向分辨率,就不得不使用X波段的频率,而该波段的电磁波穿过雨区时会受到衰减,直接利用视反射率进行降水反演就会产生很大的误差,因此,衰减效应必须进行校正。两种降水反演方法——立体雷达方法和双束算法,在实际的反演中各有优缺点。立体雷达方法对边界条件要求高,而双束算法在雨团中心雨强大处会有较大的误差。引入权重因子后的立体雷达方法－双束算法(综合算法)能充分发挥两种方法的优点,从而更具适用性和准确性。     

运用人工鱼群算法的3D扫描碎片重建探究

针对传统三维碎片拼接匹配过程中依赖单一特征及存在误差累积的问题,提出了一种运用鱼群算法的全局最优匹配方法。该方法先对碎片点云数据进行多特征提取,结合纹理、专家经验信息对混合在一起的多种类型碎片进行粗糙集分类,之后采用鱼群算法的最优解求得最佳匹配方案。实例验证所提全局匹配方法具有能力强、与初始位置无关及较强的稳健性等特点,为三维碎片的全局匹配提供了一种有效的解决方案。     

不规则三角网数字水深模型缓冲面快速构建的滚动球加速优化算法

针对TIN_DDM缓冲面构建与应用中存在的数据类型特殊、算法效率与模型精度不匹配的问题,本文将滚动球模型应用扩展至TIN_DDM缓冲面的构建过程。在分析滚动球模型构建精度局限的基础上,建立了滚动球半径关联的滚动球模型整体精度控制方法;结合大数据量TIN_DDM缓冲面多次构建的应用效率需求,阐明了关键采样点与滚动球半径对TIN_DDM缓冲面构建效率的影响规律;设计了TIN_DDM缓冲面构建关键采样点的判定准则,建立了关键采样点与滚动球半径的数值关联关系;提出了一种基于滚动球加速优化模型的TIN_DDM缓冲面快速构建算法,算法时间复杂度为O(n)。试验结果表明:本文算法可实现任意缓冲半径条件下TIN_DDM缓冲面的多次快速构建,且算法精度控制在2σ内。     

基于GPS和水准数据的微粒群算法联合反演祁连山北缘断裂三维滑动速率

将微粒群算法与位错理论模型相结合,采用中国地壳运动观测网络提供的青藏高原地区2001~2004年GPS测量数据和2000~2006年水准测量数据,通过常规定权和附有相对权比的方法对祁连山北缘断裂的三维滑动速率进行联合反演,并与蚁群算法反演结果进行对比。结果表明,微粒群算法收敛速度快、稳定性高,结合经典位错理论模型,是一种可以有效求解断层三维滑动速率反演问题的优化算法,在大地测量反演领域极具应用潜力。     

遗传算法的单频网覆盖时延优化

针对目前数字广播电视单频网不能自动进行覆盖结果优化调整的问题,该文在基于地理信息的单频网台站场强预测的基础上,实现了单频网覆盖时延自动优化。首先,利用台站基本信息,结合地理信息,利用台站场强预测模型,对单频网内各个台站进行覆盖场强预测,得到各个台站的覆盖结果矩阵。其次,结合各个台站的覆盖结果矩阵,利用遗传算法对各个台站的时延情况进行寻优。最后,得到每个台站的最优时延结果,以及得到时延优化后的单频网覆盖结果。实验结果表明,本文提出的基于遗传算法的单频网覆盖时延优化算法,能够很好地实现单频网内各个台站的自动时延优化,根据得到的时延结果,对单频网内各台站信号进行控制,从而自动地进行单频网覆盖结果的优化。     

Estimation of crowd density from UAVs images based on corner detection procedures and clustering analysis

With rapid developments in platforms and sensors technology in terms of digital cameras and video recordings, crowd monitoring has taken a considerable attentions in many disciplines such as psychology, sociology, engineering, and computer vision. This is due to the fact that, monitoring of the crowd is necessary to enhance safety and controllable movements to minimize the risk particularly in highly crowded incidents (e.g. sports). One of the platforms that have been extensively employed in crowd monitoring is unmanned aerial vehicles (UAVs), because UAVs have the capability to acquiring fast, low costs, high-resolution and real-time images over crowd areas. In addition, geo-referenced images can also be provided through integration of on-board positioning sensors (e.g. GPS/IMU) with vision sensors (digital cameras and laser scanner). In this paper, a new testing procedure based on feature from accelerated segment test (FAST) algorithms is introduced to detect the crowd features from UAV images taken from different camera orientations and positions. The proposed test started with converting a circle of 16 pixels surrounding the center pixel into a vector and sorting it in ascending/descending order. A single pixel which takes the ranking number 9 (for FAST-9) or 12 (for FAST-12) was then compared with the center pixel. Accuracy assessment in terms of completeness and correctness was used to assess the performance of the new testing procedure before and after filtering the crowd features. The results show that the proposed algorithms are able to extract crowd features from different UAV images. Overall, the values of Completeness range from 55 to 70 % whereas the range of correctness values was 91 to 94 %.