利用Snake移位模型构建中心型地图

中心型地图可表示空间各点到中心点的时间距离,能直观反映地理分布因交通系统影响而产生的相近性变化。其构建核心是依据控制点的位置移动确定非控制点的新位置,因此,将中心型地图的构建过程建模为地图目标的移位问题,以相对邻近图表示点之间的邻近关系,并基于控制点的位置移动计算点的初始受力,应用Snake移位方法迭代计算各点的新位置生成中心型地图,同时利用后处理解决潜在拓扑错误。利用所提方法和最小二乘方法可视化武汉市到其他各市的旅行时间,并定量、定性地进行对比分析。结果表明,所提方法能更好地避免拓扑错误,且局部形态保持更好。     

顾及景区范围的美丽乡村点聚合表达

针对当前常用地图聚合方法仅能解决地图可视化中出现的重叠覆盖,未考虑复合图层拓扑位置关系的问题,文章分析研究已有的经典聚合算法的优缺点,提出了顾及景区范围的美丽乡村点聚合表达方法。实验证明,该方法不仅有效的解决了地图可视化中重叠覆盖问题,而且能很好的聚合表达景区和周边美丽乡村的位置关系。     

三元空间下的泛地图可视化维度

信息通信时代促生地图的对象空间与表达空间发生了巨大变化,地图可视化理论面临空前挑战。针对泛地图的表达特点,构建泛地图可视化维度体系,给出了三元空间下泛地图可视化的研究框架,分析了泛地图可视化维度的层次、类型和特征,以具体的表达手段、状态、读图者视角、可视范围、变形、空间变换、空间参考等11个维度解构三元空间下的泛地图可视化模型,详细列出了其中6个可视化维度,并以迁徙地图、虚拟地图为例,分析不同维度组合下的泛地图可视化特征,拓展现有地图学理论框架。     

DTW算法支持下的线状要素连续地图综合方法

面向线状地图要素连续尺度变换问题,本文提出了一种DTW算法支持下的连续综合方法。该方法基于尺度融合的思想,将同一地理实体在大小两种比例尺下以不同的几何表达作为输入,首先基于DTW算法建立两种几何表达坐标顶点之间的对应关系;然后采用线性内插方法动态派生任意中间尺度上几何数据,从而实现连续地图综合。顶点之间对应关系的正确性,直接决定了线性内插的结果,而同一实体在不同比例尺下的几何表达往往具有不同的坐标点数,顶点之间具有一对多的对应关系。为寻求最优顶点匹配方案,以顶点距离作为匹配代价,以整体最小距离作为目标函数,采用DTW算法求解最优匹配。试验结果表明,基于DTW的顶点匹配方法可适应不同的地图综合场景,该方法支持下的地图综合效果可实现连续、光滑的渐变,符合地图表达规则和人类空间认知。     

基于用户认知特征的地图可视化系统自适应用户界面研究

地图可视化系统用户界面是地图可视化系统和用户进行信息交互的接口.用户界面存在的问题制约用户对地图可视化系统应有功能的使用.以地图可视化系统的用户为中心,通过探讨用户的认知特征和分析现有地图可视化系统用户界面设计中存在的一些问题,拓宽用户界面的概念,设计一种地图可视化系统自适应用户界面的初步机制,探索让系统的用户界面自动地适应用户特征的方法.     

自适应地图可视化系统设计研究

传统的地图可视化系统设计思想已经不能完全适应现阶段地图可视化系统发展的需要,如何满足不同用户的个性化需求,是地图可视化系统进一步发展所面临的重要问题.自适应地图可视化系统,将自适应理论引入到地图可视化系统的设计开发中,为解决这一问题提供了一种有效的方法.文中阐述了自适应地图可视化系统的概念和提出背景, 分析了建立自适应地图可视化系统所需要研究的内容,并以自适应用户界面为重点探讨了设计自适应地图可视化系统的基本原理和方法.     

基于模板的六角格兵棋地图可视化设计研究

兵棋地图是兵棋的重要组成部分,是战场环境信息的载体,是兵棋推演者认知战场环境的工具。在介绍兵棋地图概念和作用的基础上,阐明兵棋地图可视化设计的重要性,总结目前兵棋地图可视化设计存在的问题和不足。以提高兵棋地图可视化设计效率和改进其可视化表达效果为目的,将地图模板技术运用到兵棋地图可视化设计中,分析兵棋地图可视化模板设计的影响因素,构建兵棋地图可视化模板库,并对其实现机制进行研究,最后给出应用实例,证明效果良好。     

多时相统计数据空间动态可视化模型研究

阐述了统计数据的时空特性,扩展了动态空间可视化的动态视觉参量,设计了3种用于多时相统计信息动态空间可视化的"动态统计图表"。采用时间地图动画技术及关键帧插值动画技术来设计与构建动态统计图表,并将此方法应用于相应系统,实现了统计数据随时间变化动态特性的可视化表达。     

基于可视化维度的泛地图表达机制

在信息与通信技术的推动下, 地图可视化表达呈现出突破创新和拓展泛化的趋势, 然而地图设计与制作过程仍然高度依赖制图者的自然智能和专业经验等主观性因素。为适应信息化时代下地图表达与制作的客观化和自动化需求, 同时推进地图学理论方法研究与新型地图可视化技术的同步发展, 首先基于泛地图可视化维度体系和地图功能体系, 建立表达需求与可视化维度的关联关系;然后分析不同可视化维度类型所对应的典型地图可视化形式, 构建表达需求解析→可视化维度组合→表达形式建立→地图表达的泛地图表达机制。这进一步拓展了地图学研究和实践应用, 助力地图设计、表达和制作逐步走向大众化。     

自适应地图可视化系统设计研究

传统的地图可视化系统设计思想已经不能完全适应现阶段地图可视化系统发展的需要，如何满足不同用户的个性化需求，是地图可视化系统进一步发展所面临的重要问题。自适应地图可视化系统，将自适应理论引入到地图可视化系统的设计开发中，为解决这一问题提供了一种有效的方法。文中阐述了自适应地图可视化系统的概念和提出背景，分析了建立自适应地图可视化系统所需要研究的内容，并以自适应用户界面为重点探讨了设计自适应地图可视化系统的基本原理和方法。     

Personalized travel route recommendation using collaborative filtering based on GPS trajectories

Travelling is a critical component of daily life. With new technology, personalized travel route recommendations are possible and have become a new research area. A personalized travel route recommendation refers to plan an optimal travel route between two geographical locations, based on the road networks and users’ travel preferences. In this paper, we define users’ travel behaviours from their historical Global Positioning System (GPS) trajectories and propose two personalized travel route recommendation methods – collaborative travel route recommendation (CTRR) and an extended version of CTRR (CTRR+). Both methods consider users’ personal travel preferences based on their historical GPS trajectories. In this paper, we first estimate users’ travel behaviour frequencies by using collaborative filtering technique. A route with the maximum probability of a user’s travel behaviour is then generated based on the naïve Bayes model. The CTRR+ method improves the performances of CTRR by taking into account cold start users and integrating distance with the user travel behaviour probability. This paper also conducts some case studies based on a real GPS trajectory data set from Beijing, China. The experimental results show that the proposed CTRR and CTRR+ methods achieve better results for travel route recommendations compared with the shortest distance path method.     

Vegetation mapping with multitemporal NDVI in North Eastern China Transect (NECT)

Temporal changes in the normalized difference vegetation index (NDVI) have been widely used in vegetation mapping due to the usefulness of NDVI data in distinguishing characteristic seasonal differences in the phenology of greenness of vegetation cover. Research has also shown that NDVI provides potential to derive meaningful metrics that describe ecosystem functions. In this paper, we have applied both unsupervised “k-means” classification and supervised minimum distance classification as derived from temporal changes in NDVI measured in 1997 along the North Eastern China Transect (NECT), and we have also utilized the same two classification methods together with NDVI-derived metrics, namely maximum NDVI, mean NDVI, NDVI amplitude, NDVI threshold, total length of growing season, fraction of growing season during greenup, rate of greenup, rate of senescence, integrated NDVI during the growing season, and integrated NDVI during greenup/integrated NDVI during senescence to map vegetation. The main objectives of this study are: (1) to test the relative performance of NDVI temporal profile metrics and NDVI-derived metrics for vegetation cover discrimination in NECT; (2) to test the relative performance of unsupervised (k-means) and supervised (minimum distance) methods for vegetation mapping; (3) to test the accuracy of the IGBP-DIS released land cover map for NECT; (4) to provide an up-to-date vegetation map for NECT. The results suggest that the classifications based on NDVI temporal profile metrics have higher accuracies than those based on any other metrics, such as NDVI-derived metrics, or all (NDVI temporal profile metrics + NDVI-derived metrics), or 15 metrics (NDVI temporal profile + Rate of greenup, Rate of senescence, and Integrated NDVI in greenup/integrated NDVI in senescence) for both methods. And among them, unsupervised k-means classification had the highest overall accuracy of 52% and Kappa coefficient of 0.2057. Both unsupervised (k-means) and supervised (minimum distance) methods achieved similar accuracies for the same metrics. The accuracy of IGBP-DIS released land cover map had an overall accuracy of 37% and a Kappa coefficient is 0.1441, and can improve to 46% by decomposing the crop/natural vegetation mosaic to cropland and other natural vegetation types. The results support using unsupervised k-means classification based on NDVI temporal profile metrics to provide an up-to-date vegetation cover classification. However, new effort is necessary in the future in order to improve the overall performance on this issue.     

面状空间要素相似性度量方法研究

不同尺度、来源的地图上同一要素通常具有一定的相似度。地图空间要素相似度在GIS领域具有广泛的应用。论文在总结前人相关成果的基础上分别从位置(距离)、形状、大小三个方面给出了面状空间要素相似性度量模型:以分形维数和面积/周长(紧凑度)作为相似特征的形状相似度;以中值距离作为相似特征的距离相似度;以面积或周长作为相似特征的大小相似度。最后,以多尺度面状空间要素为实验数据,通过比较分析验证了本文提出的相似性度量模型可行性。实验结果表明:以中值距离、分形维数作为相似度指标的度量模型综合考虑了面状要素局部结构和整体分布,在面状空间要素相似性度量方面具有很好的稳定性。     

A Topology‐Inferred Graph‐Based Heuristic Algorithm for Map Simplification

In this article we present a heuristic map simplification algorithm based on a novel topology‐inferred graph model. Compared with the existing algorithms, which only focus either on geometry simplification or on topological consistency, our algorithm simplifies the map composed of series of polylines and constraint points while maintaining the topological relationships in the map, maximizing the number of removal points, and minimizing error distance efficiently. Unlike some traditional geometry simplification algorithms, such as Douglas and Peucker's, which add points incrementally, we remove points sequentially based on a priority determined by heuristic functions. In the first stage, we build a graph to model the topology of points in the map from which we determine whether a point is removable or not. As map generalization is needed in different applications with different requirements, we present two heuristic functions to determine the priority of points removal for two different purposes: to save storage space and to reduce computation time. The time complexity of our algorithm is which is efficient enough to be considered for real‐time applications. Experiments on real maps were conducted and the results indicate that our algorithm produces high quality results; one heuristic function results in higher removal points saving storage space and the other improves the time performance significantly.     

农作物分类成数的精度检验

选择山西太谷一个 5km× 5km的实验区 ,利用样条采样框架结合GVG农情采样系统调查农作物分类成数。同时借助QuickBird甚高分辨率遥感影像进行地面作物种植地块勾绘 ,并派出地面调查队伍进行作物填图 ,统计汇总出的农作物分类成数的真实值。然后将两种不同方法得出的分类成数进行对比 ,发现利用样条采样框架和GVG农情采样系统对于大宗粮食作物分类成数的调查相对误差在 3%以内 ,能够满足中国农情遥感速报系统的运行需要。而对于小成数作物的调查精度较低 ,且存在漏采现象 ,不能满足需求 ,同时也由于漏采现象的存在和图片判读的主观性。利用样条采样框架和GVG农情采样系统获取的大宗作物分类成数略大于真实值 ,存在少量的系统误差 ,需要进行地面验证并加以克服。     

一种基于共词网络的社交媒体数据主题挖掘方法

对社交媒体所包含文本数据的深入挖掘,有利于有效地进行后续的时空分析。提出了一种新的基于共词网络的社交媒体数据主题挖掘方法,依据词频-逆文档频率分析,自动筛选出与主题相关的关键词汇,基于微博间是否包含相同的关键词汇,提出构建以微博为节点的共词网络,并结合Louvain社区探测算法进行文本主题挖掘。所提出的方法是一种无监督方法,且具有不需要指定聚类数目的优点。实验表明,该方法在主题挖掘表现上,准确率和召回率均优于常用的文档主题生成模型。以收集的2012年北京暴雨期间包含关键词的微博为例,利用提出的方法对微博数据集进行挖掘和时空分析,结果表明所提方法在实际应用中的有效性。     

一种基于Fréchet距离的断裂等高线内插算法

等高线内插是提高地形图精度的一个常用手段，在地图综合等领域中有很重要的作用。在实际地形图数据库中，等高线除了存在完整的计曲线以外，还有一部分断裂的首曲线。已有的等高线内插研究中未考虑对此类数据的处理，为此，本文提出了一种基于Fréchet距离的断裂等高线内插算法。首先提出了等高线度量关系的计算方法，然后对等高线的节点均匀加密，并利用Fréchet距离进行相似度判断以选择参考等高线，最后根据“最近点”的方式进行插值。通过对江苏某地区实际数据的试验，验证了该算法的合理性，对于鞍部地区的内插，有更好的适应性和准确性。     

Interpolation Methods for Scattered Sample Data: Accuracy,Spatial Patterns,Processing Time

Interpolation routines based on polynomials, splines, linear triangulation, proximation, distance weighting, and kriging are tested on their efficacy to visualize spatial patterns. Implementations in commonly available software packages are used in order to yield practical recommendations on the application of current information technology. Two data sets of physical variables containing irregularly distributed sample point values are used as input data. Accuracy of predicted values at unvisited points, preservation of distinct spatial patterns (established from map use tasks), and processing time, are used as criteria to determine the merits of the various interpolation methods. It was found that highly accurate interpolations do not always produce realistic spatial patterns. Effectiveness of distance weighting and kriging methods was found to be largely dependent on the number of neighbors used. For both gradually and abruptly changing data, geographic reality was visualized most satisfactorily with the squared inverse distance weighting (w=d^-2 ) method using respectively few (four to eight) and many (16 to 24) neighbors.     

20世纪初北京地形图研究

本文研究了清末民初时期中国政府的测绘机构及其地形图测绘活动 ,介绍了若干幅由陆地测量总局等权威机构测绘、编制的近现代北京地区地形图及相关测绘档案文献 ,对地形图所记录的土地覆被及环境演变过程开展了信息提取 ,对近代北京城市边缘地区的环境变迁做出了初步分析。