航拍胶片注释信息阈值分割算法研究

航拍胶片注释信息对后续的图像处理非常重要,但是曝光不均、相机抖动或者胶片数字化产生的畸变都会导致注释信息产生背景模糊、泛白、灰度不均等现象,这给注释信息标识符的分割和识别带来很大困难。该文提出了一种基于CASDA与Niblack相结合的阈值分割算法,能够有效解决传统分割方法存在的字符分割断裂问题。实验证明,该算法能够在保证注释信息准确分割的同时兼顾处理速度。     

A parallel algorithm for coverage optimization on multi-core architectures

Location siting is an important part of service provision, with much potential to impact operational efficiency, safety, security, system reliability, etc. A class of location models seeks to optimize coverage of demand for service that is continuously distributed across space. Decision-making and planning contexts include police/fire resource allocation for a community, siting cellular towers to support cell phone signal transmission, locating emergency warning sirens to alert the public of severe weather and other related dangers, and many others as well. When facilities can be sited anywhere in continuous space to provide coverage to an entire region, this is a very computationally challenging problem to solve because potential demand for service is everywhere and there are an infinite number of potential facility sites to consider. This article develops a new parallel solution approach for this location coverage optimization problem through an iterative bounding scheme on multi-core architectures. The developed approach is applied to site emergency warning sirens in Dublin, Ohio, and fire stations in Elk Grove, California. Results demonstrate the effectiveness and efficiency of the proposed approach, enabling real-time analysis and planning. This work illustrates that the integration of cyberinfrastructure can significantly improve computational efficiency in solving challenging spatial optimization problems, fitting the themes of this special issue: cyberinfrastructure, GIS, and spatial optimization.     

一种基于GIS的森林分类专家系统(FCGES)理论与方法

GIS与ES的结合,是GIS发展的重要方向.在GIS基础上建立森林分类专家系统(FCGES)更是林业系统一个崭新的研究领域.通过阐述FCGES的概念及基于贝叶斯概率的一种专家算法,对其设计与实现过程进行了初步探讨.     

无人机航摄生成DEM的高程点快速提取算法

无人机航空摄影技术在近年来得到了迅速的发展,无人机具有起降方便,分辨率高,响应速度快的特点,在抢险救灾,地质灾害监测等方面发挥了重要作用。无人机航空摄影生成的地形图中的高程点提取是地形图制作的重要步骤,本文提出了一种自适应的地形图高程点提取算法,相对于传统的算法,具有精确度高,计算简单,实用性强等特点。该算法的基础是数学形态学中的图像膨胀算法。本文将此算法用于陕西省丹凤县和紫阳县的无人机航摄生成的地形图中,提取了符合要求的高程点。结果表明,提取的高程点完全满足了地形图的要求,说明了该算法的准确性和实用性。     

A shortest path algorithm with novel heuristics for dynamic transportation networks

Finding an optimal route in dynamic real‐time transportation networks is a critical problem for vehicle navigation. Existing approaches are either too complex or incapable of managing complex circumstances where both the location of a mobile object and traffic conditions change over time. In this paper, we propose an incremental search approach with novel heuristics based on a variation of the A* algorithm–Lifelong Planning A*. In addition, we suggest using an ellipse to prune the unnecessary nodes to be scanned in order to speed up the dynamic search process. The proposed algorithm determines the shortest‐cost path between a moving object and its destination by continually adapting to the dynamic traffic conditions, while making use of the previous search results. Experimental results evince that the proposed algorithm performs significantly better than the well‐known A* algorithm.     

一种基于DEM的河网快速提取算法

目前从DEM中提取河网应用最普遍的是径向水流算法,但DEM中存在平地会形成平行水流,存在洼地会造成平行水流形成断流。该文提出一种快速提取算法:首先在DEM中标注山顶、平地、洼地和盆地,以山顶区域周围的低洼点为起点,按照最陡坡降追踪谷地,当追踪到盆地区域或其他谷地区域则结束;连接谷地和盆地,建立初步的河流网络。然后计算出网络中连接点的汇水量,舍弃汇水量小的节点的上游谷地,得到需要提取的网络。该算法避免了平行水流和断流的产生,其仅追踪从山顶区域(而非所有格网点)发育的水流,汇水量计算中仅计算连接点(而非所有格网点)的汇水量,实现了河网的快速提取。     

A methodology with a distributed algorithm for large-scale trajectory distribution prediction

In this paper, we propose a method for predicting the distributions of people’s trajectories on the road network throughout a city. Specifically, we predict the number of people who will move from one area to another, their probable trajectories, and the corresponding likelihoods of those trajectories in the near future, such as within an hour. With this prediction, we will identify the hot road segments where potential traffic jams might occur and reveal the formation of those traffic jams. Accurate predictions of human trajectories at a city level in real time is challenging due to the uncertainty of people’s spatial and temporal mobility patterns, the complexity of a city level’s road network, and the scale of the data. To address these challenges, this paper proposes a method which includes several major components: (1) a model for predicting movements between neighboring areas, which combines both latent and explicit features that may influence the movements; (2) different methods to estimate corresponding flow trajectory distributions in the road network; (3) a MapReduce-based distributed algorithm to simulate large-scale trajectory distributions under real-time constraints. We conducted two case studies with taxi data collected from Beijing and New York City and systematically evaluated our method.     

Finding shortest paths on real road networks: the case for A*

The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficient implementations of the Dijkstra algorithm are the fastest at optimally solving the ‘one‐to‐one’ shortest path problem (Cherkassky et al. 1996 Cherkassky, B. V., Goldberg, A. V. and Radzik, T. 1996. Shortest paths algorithms: theory and experimental evaluation.. Mathematical Programming: Series A and B, 73: 129–174. [Crossref], [Web of Science ®] , [Google Scholar]). We show that the most efficient state‐of‐the‐art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS‐sourced data. The results of this paper, derived from tests of different algorithmic approaches on real road networks, will be extremely valuable for application developers and researchers in the GIS community.     

平面点集凸壳的一个性质

该文揭示了平面点集凸壳的一个性质,即如果一个子凸壳包含东、西、南、北4个方向上的极值点,则其任一条子凸壳边的外点必在该边所确定的外直角三角形中,并对该性质进行了数学证明。在此基础上,利用该性质对快速凸壳算法进行了改进,达到了良好的加速效果。     

A GIS-based method for flooded area calculation and damage evaluation

Using geographic information system to study flooded area and damage evaluation has been a hotspot in environmental disaster research for years. In this paper, a model for flooded area calculation and damage evaluation is presented. Flooding is divided into two types: ‘source flood’ and ‘non-source flood’. The source-flood area calculation is based on seed spread algorithm. The flood damage evaluation is calculated by overlaying the flooded area range with thematic maps and relating the result to other social and economic data. To raise the operational efficiency of the model, a skipping approach is used to speed seed spread algorithm and all thematic maps are converted to raster format before overlay analysis. The accuracy of flooded area calculation and damage evaluation is mainly dependent upon the resolution and precision of the digital elevation model (DEM) data, upon the accuracy of registering all raster layers, and upon the quality of economic information. This model has been successfully used in the Zhejiang Province Comprehensive Water Management Information System developed by the authors. The applications show that this model is especially useful for most counties of China and other developing countries.     

A novel methodology for identifying environmental exposures using GPS data

Aim: While studies using global positioning systems (GPS) have the potential to refine measures of exposure to the neighbourhood environment in health research, one limitation is that they do not typically identify time spent undertaking journeys in motorised vehicles when contact with the environment is reduced. This paper presents and tests a novel methodology to explore the impact of this concern.

Methods: Using a case study of exposure assessment to food environments, an unsupervised computational algorithm is employed in order to infer two travel modes: motorised and non-motorised, on the basis of which trips were extracted. Additional criteria are imposed in order to improve robustness of the algorithm.

Results: After removing noise in the GPS data and motorised vehicle journeys, 82.43% of the initial GPS points remained. In addition, after comparing a sub-sample of trips classified visually of motorised, non-motorised and mixed mode trips with the algorithm classifications, it was found that there was an agreement of 88%. The measures of exposure to the food environment calculated before and after algorithm classification were strongly correlated.

Conclusion: Identifying non-motorised exposures to the food environment makes little difference to exposure estimates in urban children but might be important for adults or rural populations who spend more time in motorised vehicles.     

A GIS-based method for flooded area calculation and damage evaluation

1 IntroductionFlooding simulation and damage evaluation has attracted attention in environmental disaster research fields for many years. Since the 1990s, especially in recent years, using geographic information systems (GIS) technology and its powerful functions of spatial analysis and visualization to simulate and display flooded area and to evaluate disaster damage has become a research hotspot. Most of the papers involved in this field are from hydraulic and hydrologic point of view and b…     

A center-based modeling approach to solve the districting problem

This article deals with the districting problem arising in applications such as political districting, police patrol area delineation and sales territory design. The aim of districting is to group basic areal units into geographic districts such that some set of criteria are satisfied, with basic criteria being district balance, compactness and contiguity. This article proposes a center-based mixed-integer linear programming model to solve the districting problem. Given the central units of districts, the model optimizes weighted objectives of district balance and compactness while satisfying contiguous constraints on districts. The performance of the model was tested using three study areas with 297, 324 and 1297 areal units, respectively. Experimentation shows that, using the district centers identified by a multistart weighted K-medoids algorithm, the model instances can be solved optimally or near-optimally. Compared with local search-based algorithms, the center-based approach outperforms metaheuristics such as simulated annealing, variable neighborhood descent, iterative local search and old bachelor acceptance search in terms of solution quality.     

基于空间化PageRank算法的人口流动空间集聚性分析

提出了一种基于空间化PageRank算法的人口流动空间集聚性分析方法。在PageRank算法的基础上增加空间节点间要素流量大小(F)的加权作用以及距离因子(Dst)所引起的流动成本和阻力效应,使该算法具备针对空间网络模型的分析能力,通过对人口流动网络模型中的节点进行集聚性排序,描述人口流动的空间特征。以华东六省一市人口流动状况为例,PR值、区域人口总流入量(RTI)和流动人口密度区位商(MLQ)的计算结果对比表明:空间化PageRank算法可以客观地评估空间节点吸引力,并弥补了总流入量等简单人口学统计指标对于现象背后驱动机制表达不足的缺点。     

基于格网索引的GIS矢量数据拓扑重建研究

GIS中对原始矢量数据进行拓扑分析和重建是对其进行存储和使用的前提。引入包括规则格网和四叉树格网在内的索引结构,将全局的矢量拓扑分析转化为单个格网范围内足够少的矢量线段求交过程,减少了运算的复杂度;并用一种重组算法实现将原始矢量数据转化为符合“逢交必断”标准的矢量数据。试验表明,该算法适合海量和高散乱度的矢量数据。     

GIS中面积偏差控制下的矢量数据压缩算法

地理信息系统对矢量数据进行处理和应用的过程中,数据压缩是一个必须解决的问题,而通常采用的两种经典曲线数据压缩法:垂距限值法和道格拉斯-普克算法,都存在线段空间偏移过大以及面积偏差不可控的问题。利用曲线空间直线拟合的方法对曲线段中心轴进行空间逼近,通过增加面积偏差限值,提出了面积偏差控制下的矢量数据压缩算法,并以上海市崇明县岛屿边界轮廓矢量为例对该算法进行了验证。试验表明该方法对于解决两种经典压缩算法线段空间偏移过大以及面积偏差不可控的问题效果明显。     

球面等积六边形离散网格的生成算法及变形分析

球面离散网格模型是管理海量数据的有效途径,如何构建球面网格是这类模型的基础问题。利用施奈德等积投影建立平面与球面的对应关系,并在此基础上设计了3种球面等积六边形离散网格的生成算法。结合实验分析这3种网格的最大/最小边长比和单元周长均方差两项指标,结果表明全部网格的指标均收敛,其中C-Ⅰ网格的性质最优。     

A new algorithm based on Region Partitioning for Filtering candidate viewpoints of a multiple viewshed

Selecting the set of candidate viewpoints (CVs) is one of the most important procedures in multiple viewshed analysis. However, the quantity of CVs remains excessive even when only terrain feature points are selected. Here we propose the Region Partitioning for Filtering (RPF) algorithm, which uses a region partitioning method to filter CVs of a multiple viewshed. The region partitioning method is used to decompose an entire area into several regions. The quality of CVs can be evaluated by summarizing the viewshed area of each CV in each region. First, the RPF algorithm apportions each CV to a region wherein the CV has a larger viewshed than that in other regions. Then, CVs with relatively small viewshed areas are removed from their original regions or reassigned to another region in each iterative step. In this way, a set of high-quality CVs can be preserved, and the size of the preserved CVs can be controlled by the RPF algorithm. To evaluate the computational efficiency of the RPF algorithm, its performance was compared with simple random (SR), simulated annealing (SA), and ant colony optimization (ACO) algorithms. Experimental results indicate that the RPF algorithm provides more than a 20% improvement over the SR algorithm, and that, on average, the computation time of the RPF algorithm is 63% that of the ACO algorithm.     

基于出租车轨迹数据的城市空间结构变化研究——以深圳市为例

在地理大数据大量涌现的背景下,利用深圳市2009年5月和2016年9月2期出租车轨迹大数据,通过构建2层空间网络,并使用Infomap社区发现算法,发现网络中的全局空间社区和局部空间社区。通过对比空间社区的变化,并结合遥感数据和规划政策等,探讨深圳市长时期多层空间结构的动态变化,揭示了城市基础设施建设以及规划政策制定等对城市空间结构的影响。结果表明：全局尺度下,城市的空间结构趋向于紧凑式发展,如深圳市郊区的小空间社区合并成了5个大空间社区,这与深圳2020年总体规划有较大的关联。局部尺度下,城市的空间结构趋向于多中心式发展,如围绕深圳高铁北站和南山中心的2个空间社区分裂成了多个小空间社区,这与重大基础设施建设和经济发展有较大的关联。     

基于局部地表形态的可变过水宽度多流向算法

流向是地形分析中的重要内容之一,在分布式水文模型等研究中起着重要作用。文章提出基于局部地表形态的多流向算法,即对每一个DEM栅格,在以其为中心的3×3窗口中进行局部地形分析,确定基于随坡度和过水宽度而变化的水流分配系数。该方法被应用在实际数字地形模型上,并以汇水面积和比汇水面积为研究指标,与目前流行的D8、Dinf等算法进行了相似性分析。结果表明,该方法能够获得更为符合实际的水流汇集的空间分布。