网络环境下分区统计地图制图子系统的设计与实现

分析了网络环境下分区统计地图表达信息的特点,根据其可视化地理统计信息的需要,运用Java Ap-plet技术,设计和开发了网络环境下交互式分区统计地图制图子系统。     

饼状/柱状分区统计地图参数设置界面优化

当前国内外在线专题地图制图平台模板式制图流程的视觉变量设计中缺乏对用户使用习惯和关注焦点的研究,难以有效满足用户灵活广泛的个性化需求。设计了一套在线饼状/柱状分区统计地图参数设置原型系统,以问卷调查的方式对该系统进行评价,首先获取用户对参数设置面板的位置偏好,然后通过层次分析法获取面板参数权重,由此提出在线饼状/柱状分区统计地图参数设计优化方案,以此作为改进原型系统界面设计的依据。     

叠加柱状符号的自动绘制

随着专题地图的广泛应用,统计地图起着越来越重要的作用。分区统计图表的符号设计是编制统计地图的关键。国内外许多学者在自动绘制统计图符号方面做了大量工作,对各种符号进行了归类,建立了点状符     

一种构成邻接统计地图的新方法

一种构成邻接统计地图的新方法［俄］Ｓ．Ｍ．Ｇｕｓｅｉｎ－Ｚａｄｅ；Ｖ．Ｓ．Ｔｉｋｕｎｏｖ一、引言邻接统计地图是一种从传统地图上获得的图像，其比例尺随变量值而变化，在这种地图上变量值是其基础。“变形地图”、“变换图”和“伪统计地图”常用于描述邻接统计地...     

基于画家算法的2.5维统计地图符号消隐方法

在利用2维符号图元构建2.5维统计地图符号时,图元的绘制顺序会影响其相互之间的压盖关系,不合理的绘制顺序将会导致2.5维地图符号模糊不清、表达无力。因此,必须采取特定的策略合理地安排图元的绘制顺序,以完成符号的顺利绘制。此处通过对画家算法的分析,探讨基于该算法构建2.5维统计地图符号的基本思路,提出基于画家算法的2.5维统计地图符号空间消隐方法,详细阐述轴式消隐、面式消隐、体式消隐和扇式消隐等几种消隐方法,在保证图元完整性表达方面取得了良好的效果。实验结果表明,该方法可以有效地解决符号图元之间因绘制顺序不合理而产生的相互遮挡压盖问题,构建外形精美的2.5维统计地图符号,在一定程度上提高了统计地图的整体显示效果。     

计算机机助编制统计地图的方法研究

本文通过应用计算机机助编制统计地图的实验，探讨机助编制统计地图的有关问题。文章讨论了（一）应用计算机机助编制统计地图的意义。（二）统计地图信息的研究和分析。（三）统计地图自动成图软件系统及程序设计原理。（四）机助编制统计地图的优缺点。     

基于视觉元素的统计地图符号自适应生成

从电子地图自适应可视化角度出发,本文结合J.Bertin的视觉变量理论,研究了统计地图符号构成的内在规律,分解出统计地图符号构成的基本元素(视觉元素);基于视觉元素建立了统计地图符号自适应生成模型,并在某GIS平台上实现了统计地图符号的自适应生成系统,取得了良好的效果。     

运用OO方法设计统计符号库的理论探讨

统计符号库的设计与实现是符号库软件的难点，一直没有得到较好的解决，制约着统计地图制图软件的开发和实用化。本文首先分析了符号绘制的常用方法及其应用于统计符号库设计的局限性，进而基于ＯＯ方法提出了统计符号库设计的一种新方案，并就该方案的几个难点给出了解决办法     

以符号为中心的统计地图制图模板技术研究

地图制图自动化与智能化是当前制图领域研究的热点问题,模板制图是实现制图自动化,提高制图效率的一种手段。在探讨模板制图原理的基础上,分析了现有制图模板的特点及其应用模式上存在的不足,设计了以符号为中心的统计地图制图模板的应用模式,提出了以符号为中心的统计地图制图模板技术,凸显了统计地图制作过程中符号的重要地位。以此为基础,深入剖析了统计制图模板、统计专题图层、图面表达结果三者之间的区别与联系,研究了以符号为中心的统计地图制图模板构建技术、存储技术以及匹配技术,并进行了系统应用,验证了这一技术的可行性和有效性。     

基于目标规划与模拟退火算法的土地利用分区优化方法

以兰州市榆中县为实验区,选取分区适宜性、规划协调性和空间紧凑性作为分区目标,基于目标规划和模拟退火算法对实验区进行土地利用分区优化。结果表明,不同情景下的分区方案能很好地满足决策者设定的目标偏好值;从空间特征分析的结果看,本分区方案较原有分区方案对各个分区目标进行了优化,更好地满足了农业生产、经济发展以及生态保护的要求。     

Searching for Boundaries on Maps: Cognitive Processes

The purpose of this research was to examine the interaction between color and the visual processes people use to search choropleth maps. Two experiments were performed in which subjects searched hypothetical choropleth maps displayed on a cathode-ray tube to determine whether a particular (target) boundary formed by two adjacent polygons filled with different colors was present. In experiment 1, the four pairs of colors used to form the target boundaries were red-blue, green-yellow, green-magenta, and cyan-magenta. In experiment 2, red-green, blue-yellow, red-orange, and cyan-orange were the color pairs used toform the target boundaries. The target boundary colors, target-background discriminability, target boundary location, and the number and types of boundaries on the maps had a significant effect on search time. The results of both experiments indicated that subjects were using a parallel search process followed by a serial search process as described by Cave and Wolfe's (1990) guided search theory. The relative mean search times for the various colored target boundaries was best explained by the opponent process theory.     

顾及上下级空间关系相似性的道路网联动匹配方法

现有道路网匹配方法中,大多利用道路自身结点和弧段特征进行匹配,而较少注意道路邻域要素在道路网匹配中的重要定位参考作用,从而影响匹配效率和正确率的进一步提高。针对上述问题,本文提出了一种顾及上下级空间关系相似性的道路网联动匹配方法,即模仿人在读图时通过特征地物和空间关联寻找目标地物的思维过程,将匹配看作是一种特征目标寻找、信息关联传递的推理过程。首先,运用Stroke技术将复杂道路网进行等级划分。其次,通过道路骨架关联关系树构建道路网联动匹配模型。最后,选取高等级骨干道路作为起始特征对象,计算道路间的上下级空间关系相似性,逐级迭代使匹配信息在道路网联动匹配模型中传递,从而得到匹配结果。试验表明,本文算法缩小了待匹配数据的搜索范围,能够有效提高匹配正确率和效率,尤其在数据位移较大、存在非系统性几何位置偏差的情况下优势明显。     

常加速度模型的简化自协方差最小二乘法

“当前”统计模型自适应算法并非真正意义上的自适应目标跟踪算法,其性能与其中关键参数的选择有着直接的关系。本文以常加速度模型对机动载体进行建模,顾及其状态噪声协方差矩阵满足特定结构,提出了简化的自协方差最小二乘噪声协方差估计方法,该方法通过建立新息的相关函数序列与未知噪声协方差矩阵间的函数模型,并结合最小二乘法进行噪声协方差估计。数值仿真结果表明,当载体进行阶跃加速度运动或变加速度运动时,本文所提方法的目标跟踪精度均优于“当前”统计模型自适应算法。     

利用城市骨架线网的道路和居民地联动匹配方法

同名道路或者居民地数据间由于数据一致性程度不高,往往存在较大的几何位置偏差,当对道路或者居民地单独进行匹配时,不利于提高匹配正确率和效率。针对这一问题,本文提出了一种利用城市骨架线网的道路和居民地联动匹配方法。联动匹配即模仿人在读图时通过特征地物和空间关联寻找目标地物的思维过程,将匹配看作是一种特征目标寻找、信息关联传递的推理过程。首先,利用约束Delaunay三角网对地图构建城市骨架线网。然后,通过道路、骨架线、骨架线网眼和居民地之间的拓扑关系建立道路和居民地之间的匹配传递模型。最后,根据该传递模型实现通过道路匹配带动居民地匹配或者通过居民地匹配带动道路匹配的联动匹配。该方法优势在于只要有一种要素的数据一致性比较好,就能带动另一种要素取得很好的匹配效果,同时符合人类进行匹配时的认知过程。     

导航信号干扰源定位排查能力评估

立足干扰源定位排查能力培训,对导航信号干扰源定位排查能力进行综合评估．运用层次分析法、德尔菲法等方法解决三个方面的问题:一是建立评估指标体系,二是确定评估指标权重,三是确定量化评分方法,为开展导航信号干扰源排查培训提供有效的综合能力评估方案,确保培训科目内容设置、分值分配及成绩量化评分的科学性、合理性,有利于准确评估导航信号干扰源定位排查能力．      

Frequency ratio modelling using geospatial data to predict Kimberlite Clan of rock emplacement zones in Dharwar Craton,India

Kimberlite clan of rocks (KCR) comprising of mantle derived ultrabasic rocks such as Kimberlite and related Lamproites and Lamprophyres,are the primary source of diamond. Locating the KCR is first step in the diamond exploration, which is highly challenging in the field due to (i) very small spatial extent of KCR pipes (ii) high susceptibility of KCR to weathering and alteration on exposure to atmosphere, owing to their ultrabasic composition. Predictive statistical models using the geospatial data are often used to minimize the search and the present work attempts to apply the Frequency Ratio (FR) based predictive model in GIS to prepare KCR potential zone maps based on the relationship between the already explored KCR locations and the factors that favour their emplacement. Wajrakarur Kimberlite Field (WKF) in the Dharawar Craton of India, with more than 30 explored kimberlite pipes is selected as the study area. Geospatial technology has been used to generate thematic maps such as known KCR pipe locations, lineament density, lineament buffer zone, lineament intersection buffer zone, drainage anomaly buffer zone, geomorphology, and classified image showing distribution of mineral such as clay, iron oxide and calcrete, which are surface expression of KCR emplacement from various sources. Landsat 8 OLI satellite data, ASTER DEM were used in preparing the geomorphology, lineament map, and band ratio based mineral classified map. The thematic maps were converted to raster grid of 10 sq. m. FR values for each unit in each thematic map were obtained by correlating the spatial relationship between thematic map and the 25 locations of the 33 “known” KCR locations in WKF used for FR modelling. Cumulative FR value were obtained by carrying out overlay analysis of the thematic maps, which are classified into five classes by Natural Breaking method as (i)Very Low Favourable (VLF), (ii) Low Favourable (LF), (iii)Moderate favourable (MF), (iv)High Favourable (HF), and (v)Very High Favourable (VHF). The model was validated by ground verification at random sites and statistical method. During the ground visit, we observed KCR-like lithology’s at four new sites that have calcrete exposure at limited spatial extent and also some pieces of ultrabasic rocks similar to the explored sites. To ascertain their chemical composition of the samples were plotted in the MgO-K₂O-Al₂O₃ ternary diagram. All the four samples fall in the Kimberlite/Lamproite field confirming them to be KCR. The FR predictive model was also validated statistically. Total 13 locations, including 8 site out of 33 known KCR locations, one newly discovered pipe by GSI and the four locations discovered during this study were used for the validation. Statistical validation shows that 84% of model accuracy is achieved. The study reveals that Lineament Intersection, and circular drainage anomaly in 3rd order streams, lineament density are significant themes in predicting KCR emplacement zones. The study demonstrates the utility of statistical based model such as FR model in predicting the location of KCR emplacement, even with statistically insignificant distribution of KCRs and can be applied elsewhere in the world to locate the KCRs. In the process, we report discovery of four new KCR pipes in the WKF.     

Statistical analysis of two 3-D registration and modeling strategies

The paper deals with the registration and modeling of multiple 3-D profile maps acquired from different viewpoints by light striping. We analyze the propagation of measurement and calibration errors to the registration parameters and further to the reconstructed model of the scene consisting of planar patches. The analysis is performed for two strategies. In the first strategy, the maps are registered simultaneously using the Levenberg–Marquardt method to update the registration parameters and the model computed afterwards while in the second one, the maps are registered sequentially against the model reconstructed up till then using the method of unit quaternions to update the registration parameters. Our statistical analysis thus combines the registration and modeling steps, and in registration, we determine the corresponding points either on the parametric domains of the maps or as closest points in 3-D using the information from the parametric domain to restrict the search for the closest points. We also point out the precise estimation of the covariance matrix of the solution given by the Levenberg–Marquardt method. We illustrate the results of our analysis with real data from a scale model of an urban area.     

Parallel computing solutions for Markov chain spatial sequential simulation of categorical fields

The Markov chain random field (MCRF) model is a spatial statistical approach for modeling categorical spatial variables in multiple dimensions. However, this approach tends to be computationally costly when dealing with large data sets because of its sequential simulation processes. Therefore, improving its computational efficiency is necessary in order to run this model on larger sizes of spatial data. In this study, we suggested four parallel computing solutions by using both central processing unit (CPU) and graphics processing unit (GPU) for executing the sequential simulation algorithm of the MCRF model, and compared them with the nonparallel computing solution on computation time spent for a land cover post-classification. The four parallel computing solutions are: (1) multicore processor parallel computing (MP), (2) parallel computing by GPU-accelerated nearest neighbor searching (GNNS), (3) MP with GPU-accelerated nearest neighbor searching (MP-GNNS), and (4) parallel computing by GPU-accelerated approximation and GPU-accelerated nearest neighbor searching (GA-GNNS). Experimental results indicated that all of the four parallel computing solutions are at least 1.8× faster than the nonparallel solution. Particularly, the GA-GNNS solution with 512 threads per block is around 83× faster than the nonparallel solution when conducting a land cover post-classification with a remotely sensed image of 1000?×?1000 pixels.     

基于二叉树的启发式搜索算法改进

最短路径是现代物流配送研究中热点问题之一,在分析传统启发式搜索算法的基础上,针对算法在路径优化中存在的不足,提出基于二叉树优化启发式搜索算法（A＊）实现所需结点之间最短路径查询,在引入已知的全局信息条件下选择下一个被检查的结点,并根据用户给出的起始顶点与目标顶点以及搜索的角度查找最短路径,从而搜索可能性较大的结点,提高搜索过程的效率.实验表明,基于二叉树的A＊比A＊效率提高11％～26％.     

基于ArcGIS Objects的简易找矿模型分析的研究与实现

目前大部分找矿模型的实现,大多只能借助现有的地图资料,根据经验,人为手工圈定找矿靶区,利用计算机实现自动计算靶区仍是一个新鲜话题。本文借助ArcGIS Objects二次开发的手段,分析现有地质资料数据,依据专家简易金矿找矿模型,研究并实现计算机生成专题图、自动框选采矿靶区,计算专题图中每个要素的金矿成矿可能性大小,最终以金矿赋值度的形式展示,并以实际钻孔数据对模型分析的结果进行验证。