多尺度地图的水系面目标与线目标匹配方法与实验

目标匹配是实现多比例尺地图数据变化探测和更新的一个关键技术,它是依据几何、拓扑、语义等来进行判断的。同一地物在多比例尺地图中表达方式各异,甚至差异很大,可将较大比例尺面目标与较小比例尺线目标间的匹配模式归纳为6种：1∶0、1∶1、0∶1、1∶M、N∶1和N∶M。本文通过计算较小比例尺线目标的最小约束矩形(简记为MBR)...     

突发事件的地理信息定位匹配方法研究

当前针对突发事件发生地的地理信息定位论述、研究相对比较薄弱,而突发事件与地理位置密切相关,如果能够实现突发事件发生地的文字描述信息与地理信息的快速匹配,完成事件发生地的地理定位既具有重要的现实意义也具有重要的理论意义。文章论述了突发事件文字描述信息的习惯特点和地理信息组织方式,提出了基于突发事件的地理信息定位的几种匹配...     

基于局部相似的地籍宗地图斑匹配方法

地籍管理工作中,不同来源的宗地数据通常存在着诸多差异,识别和匹配不同数据源中的同名宗地图斑是提高数据更新精度与速度的关键,对地籍数据库的集成与信息共享有着非常重要的意义。该文针对地籍数据中宗地图斑的形状及变化特点,提出了一种基于局部相似的简单而有效的匹配方法来提高匹配率,基本原理是通过搜索两个面实体间最优的点对应或特征对应关系判断两个面实体是否匹配,采用形状相似度作为局部相似的判断指标。     

Enhanced Destriping of Satellite Data of Ice Surface in Antarctica

1　Introduction TheAntarcticcontinentissurroundedbyPacificOcean,theAtlanticOceanandthe IndianOcean,itistheisolatedcontinentfarthestfromthemankind.ItsSpecialgeography andclimateenvironmentmakethemankindverydifficulttobeclosetoit,whichlimits mankind'sinvestigationofitandstudytoagreatextent.Restrictioncausedofthegeograph icalenvironmentandtheclimatecanbebrokentoagreatextentwiththeaidofthemodern remotesensingtechnology,itdemonstratesincomparablesuperioritythatremotesensing technologyisusedin…     

社会感知视角下基于“头尾划分”的游憩热点识别新方法

作为游憩空间的核心研究对象,游憩热点在研判居民游憩偏好、落实城市游憩规划等方面具有重要作用。该文从“社会感知”视角,结合“头尾划分”理论,提出基于时空轨迹数据识别城市游憩热点的新方法。首先基于个人轨迹数据识别停留点,然后基于“头尾划分”理论划定游憩停留点簇群,最后整合停留点簇群并赋值于邻近道路形成游憩热点;以广州市老城区为例进行实证分析,并与两种既有点数据聚类方法进行对比。结果显示:1)广州市老城区的游憩热点整体集中于中、西部,热点类型可分为蓝绿空间、历史风貌、商业街区、批发市场和新兴网红场所5类;2)相比DBSCAN和CFSFDP算法,该文方法在识别游憩热点数量、捕捉游憩热点核心、明确游憩热点边界和运行简洁程度等方面表现更好,有利于后续游憩热点的深度分析与整合。研究成果可为城市游憩热点的识别提供新思路,也可为国土空间规划语境下游憩系统的重塑与提升提供重要分析基础。     

Map-matching algorithm for large-scale low-frequency floating car data

Large-scale global positioning system (GPS) positioning information of floating cars has been recognised as a major data source for many transportation applications. Mapping large-scale low-frequency floating car data (FCD) onto the road network is very challenging for traditional map-matching (MM) algorithms developed for in-vehicle navigation. In this paper, a multi-criteria dynamic programming map-matching (MDP-MM) algorithm is proposed for online matching FCD. In the proposed MDP-MM algorithm, the MDP technique is used to minimise the number of candidate routes maintained at each GPS point, while guaranteeing to determine the best matching route. In addition, several useful techniques are developed to improve running time of the shortest path calculation in the MM process. Case studies based on real FCD demonstrate the accuracy and computational performance of the MDP-MM algorithm. Results indicated that the MDP-MM algorithm is competitive with existing algorithms in both accuracy and computational performance.     

A linear road object matching method for conflation based on optimization and logistic regression

The purpose of object matching in conflation is to identify corresponding objects in different data sets that represent the same real-world entity. This article presents an improved linear object matching approach, named the optimization and iterative logistic regression matching (OILRM) method, which combines the optimization model and logistic regression model to obtain a better matching result by detecting incorrect matches and missed matches that are included in the result obtained from the optimization (Opt) method for object matching in conflation. The implementation of the proposed OILRM method was demonstrated in a comprehensive case study of Shanghai, China. The experimental results showed the following. (1) The Opt method can determine most of the optimal one-to-one matching pairs under the condition of minimizing the total distance of all matching pairs without setting empirical thresholds. However, the matching accuracy and recall need to be further improved. (2) The proposed OILRM method can detect incorrect matches and missed matches and resolve the issues of one-to-many and many-to-many matching relationships with a higher matching recall. (3) In the case where the source data sets become more complicated, the matching accuracy and recall based on the proposed OILRM method are much better than those based on the Opt method.     

An assessment of independent component analysis for detection of military targets from hyperspectral images

Hyperspectral data acquired over hundreds of narrow contiguous wavelength bands are extremely suitable for target detection due to their high spectral resolution. Though spectral response of every material is expected to be unique, but in practice, it exhibits variations, which is known as spectral variability. Most target detection algorithms depend on spectral modelling using a priori available target spectra In practice, target spectra is, however, seldom available a priori. Independent component analysis (ICA) is a new evolving technique that aims at finding out components which are statistically independent or as independent as possible. The technique therefore has the potential of being used for target detection applications. A assessment of target detection from hyperspectral images using ICA and other algorithms based on spectral modelling may be of immense interest, since ICA does not require a priori target information. The aim of this paper is, thus, to assess the potential of ICA based algorithm vis a vis other prevailing algorithms for military target detection. Four spectral matching algorithms namely Orthogonal Subspace Projection (OSP), Constrained Energy Minimisation (CEM), Spectral Angle Mapper (SAM) and Spectral Correlation Mapper (SCM), and four anomaly detection algorithms namely OSP anomaly detector (OSPAD), Reed–Xiaoli anomaly detector (RXD), Uniform Target Detector (UTD) and a combination of Reed–Xiaoli anomaly detector and Uniform Target Detector (RXD–UTD) were considered. The experiments were conducted using a set of synthetic and AVIRIS hyperspectral images containing aircrafts as military targets. A comparison of true positive and false positive rates of target detections obtained from ICA and other algorithms plotted on a receiver operating curves (ROC) space indicates the superior performance of the ICA over other algorithms.     

基于有向属性关系图的典型道路交叉口结构识别方法

提出采用有向属性关系图描述道路交叉口结构,形成典型道路交叉口结构模板库.通过将道路网矢量表示转化成有向属性关系图表示,采用图匹配技术识别道路网中的典型交叉口.实现有关算法,通过试验验证该方法的有效性,并分析其局限性和适用范围.该方法可在基于结构的交叉口简化过程中用于典型交叉口结构识别.     

基于向量匹配的稀疏深度图生成算法

在基于序列影像获取三维空间数据的方法中,需要提取影像中每个像素的三维值,但由此得到的三维数据用在三维地理信息系统(3DGIS)建模时需要进行大量简化,同时当影像中存在非特征区域时,易产生大量的错误匹配.提出一种基于向量的匹配算法,将图像看成是一个连续的三维曲面,主要以特征区域匹配为核心,通过计算每个曲面点处的法向量,再...