A multi‐criteria decision‐making approach for geometric matching of areal objects

We propose a method for geometric areal object matching based on multi‐criteria decision making. To enable this method, we focused on determining the matched areal object pairs that have all relations, one‐to‐one relationships to many‐to‐many relationships, in different spatial data sets by fusing geometric criteria without user invention. First, we identified candidate corresponding areal object pairs with a graph‐based approach in training data. Second, three matching criteria (areal hausdorff distance, intersection ratio, and turning function distance) were calculated in candidate corresponding pairs and these criteria were normalized. Third, the shape similarity was calculated by weighted linear combination using the normalized matching criteria (similarities) with the criteria importance through intercriteria correlation method. Fourth, a threshold (0.738) of the shape similarity estimated in the plot of precision versus recall versus all possible thresholds of training data was applied, and the matched pairs were determined and identified. Finally, we visually validated the detection of similar areal feature pairs and conducted statistical evaluation using precision, recall, and F‐measure values from a confusion matrix. Their values were 0.905, 0.848, and 0.876, respectively. These results validate that the proposed classifier, which detects 87.6% of matched areal pairs, is highly accurate.     

A building polygonal object matching method based on minimum bounding rectangle combinatorial optimization and relaxation labeling

Volunteered geographic information (VGI) is an emerging phenomenon where anyone can create geographic information and share it with others. Compared with traditional authoritative geospatial data, it has several advantages, such as enriched data, instant updates, and low cost. The object matching method is widely used in VGI quality assessment and data updates. However, VGI matching faces certain challenges, such as the levels of detail that vary from object to object, the uneven distribution of data quality, and the automated matching requirement. To resolve these problems, this article proposes a new matching method that effectively combines the advantages of minimum bounding rectangle combinatorial optimization (MBRCO) and relaxation labeling. The proposed method (1) avoids setting the similarity threshold and weights and does not require training samples. This process is realized based on contextual information and optimization. (2) It overcomes the disadvantage that the MBRCO algorithm cannot distinguish adjacent buildings with similar shapes. Our approach is experimentally validated using two publicly available spatial datasets: OpenStreetMap and AutoNavi map. The experimental studies show that the proposed automatic matching method outperforms all the threshold-based MBRCO methods and achieves high accuracy with a precision of 97.8% and a recall of 99.2%.     

A geometric-based approach for road matching on multi-scale datasets using a genetic algorithm

Object matching is used in various applications including conflation, data quality assessment, updating, and multi-scale analysis. The objective of matching is to identify objects referring to the same entity. This article aims to present an optimization-based linear object-matching approach in multi-scale, multi-source datasets. By taking into account geometric criteria, the proposed approach uses real coded genetic algorithm (RCGA) and sensitivity analysis to identify corresponding objects. Moreover, in this approach, any initial dependency on empirical parameters such as buffer distance, threshold of spatial similarity degree, and weights of criteria is eliminated and, instead, the optimal values for these parameters are calculated for each dataset. Volunteered geographical information (VGI) and authoritative data with different scales and sources were used to assess the efficiency of the proposed approach. According to the results, in addition to an efficient performance in various datasets, the proposed approach was able to appropriately identify the corresponding objects in these datasets by achieving higher F-Score.     

Optimal spatial data matching for conflation: A network flow‐based approach

Spatial data conflation involves the matching and merging of counterpart features in multiple datasets. It has applications in practical spatial analysis in a variety of fields. Conceptually, the feature‐matching problem can be viewed as an optimization problem of seeking a match plan that minimizes the total discrepancy between datasets. In this article, we propose a powerful yet efficient optimization model for feature matching based on the classic network flow problem in operations research. We begin with a review of the existing optimization‐based methods and point out limitations of current models. We then demonstrate how to utilize the structure of the network‐flow model to approach the feature‐matching problem, as well as the important factors for designing optimization‐based conflation models. The proposed model can be solved by general linear programming solvers or network flow solvers. Due to the network flow formulation we adopt, the proposed model can be solved in polynomial time. Computational experiments show that the proposed model significantly outperforms existing optimization‐based conflation models. We conclude with a summary of findings and point out directions of future research.     

A multi‐modal transportation data‐driven approach to identify urban functional zones: An exploration based on Hangzhou City,China

Recent urban studies have used human mobility data such as taxi trajectories and smartcard data as a complementary way to identify the social functions of land use. However, little work has been conducted to reveal how multi‐modal transportation data impact on this identification process. In our study, we propose a data‐driven approach that addresses the relationships between travel behavior and urban structure: first, multi‐modal transportation data are aggregated to extract explicit statistical features; then, topic modeling methods are applied to transform these explicit statistical features into latent semantic features; and finally, a classification method is used to identify functional zones with similar latent topic distributions. Two 10‐day‐long “big” datasets from the 2,370 bicycle stations of the public bicycle‐sharing system, and up to 9,992 taxi cabs within the core urban area of Hangzhou City, China, as well as point‐of‐interest data are tested to reveal the extent to which different travel modes contribute to the detection and understanding of urban land functions. Our results show that: (1) using latent semantic features delineated from the topic modeling process as the classification input outperforms approaches using explicit statistical features; (2) combining multi‐modal data visibly improves the accuracy and consistency of the identified functional zones; and (3) the proposed data‐driven approach is also capable of identifying mixed land use in the urban space. This work presents a novel attempt to uncover the hidden linkages between urban transportation patterns with urban land use and its functions.     

一种改进Hausdorff距离和自适应遗传搜索的遥感目标匹配方法

采用快速点提取算子SIFT算子提取特征点,减少图像数据量,针对传统Hausdorff距离对噪声、出格点较敏感的问题对其进行改进,并以改进后的鲁棒Hausdorff距离作为匹配测度,利用非遍历而又有效的遗传搜索策略进一步提高了匹配速度。对发生旋转变形和灰度变化的遥感影像进行模拟实验,实验结果证明了该算法的有效性和快速性。     

倾斜影像自适应初始物方面元优化匹配算法

采用基于物方面元的最小二乘影像匹配方法匹配倾斜影像时,常出现深度不连续或高差较大区域影像连接点度数低或空三点过少问题。针对此问题,本文提出一种基于自适应初始物方面元的倾斜影像匹配算法。算法利用倾斜影像已有的初始内外方位元素及匹配过程中产生的物点信息,采用多片前方交会和物方差分的方法自适应计算物方面元的高程及法向量方向角初值,进而解决采用物方面元最小二乘影像匹配方法匹配地物高差较大区域的倾斜影像时,因初值不准导致在像方匹配同名点困难的问题。分别采用本文算法和物方面元初始状态为水平面元的最小二乘影像匹配方法对两组倾斜影像进行对比匹配验证。试验结果证明了本文算法的有效性。     

An iterative approach for inverse transformation of map projections

ABSTRACT

Map projections are given by forward transformation equations. Inverse transformation is derived from forward transformation analytically or numerically. In this paper, a numerical approach for inverse transformation of map projections is proposed, which is based on numerical differentiation and Newton–Raphson root finding method. This approach can facilitate the program developments for map projections when inverse transformation is needed. Numerical differentiation is tested with three map projections. It is seen that seven-digit precision or more can be reached. Boundary conditions and initial guess problem in inverse transformation are discussed. In terms of initial guess, map projections are divided into three categories, and appropriate initial guess values for cylindrical, pseudocylindrical, azimuthal, and conical projections in normal aspect are suggested. Newton–Raphson method with numerical differentiation is tested with 20 different map projections by using test data sets. The results show that the proposed approach is applicable if appropriate initial guess is available.     

基于非线性尺度空间的多源遥感影像匹配

针对遥感影像匹配中经典SIFT算法提取特征点时,高斯分解易造成边缘模糊和纹理细节信息丢失,从而使得边缘匹配稳定性差和误匹配点多的问题,文章引入最新的基于非线性尺度空间的KAZE算法并提出了限以空间约束的方法进行多源遥感影像匹配:通过特征点优选并进行特征匹配来计算几何变换模型,并对匹配点的搜索空间进行约束来提高匹配速度和精度,最后通过均方根误差迭代剔除误配点。实验结果表明KAZE算法提取特征点比SIFT稳定性高,易于后期误配点剔除;限以空间约束的匹配策略优于传统匹配策略;对于细节及纹理模糊的影像,KAZE算法相比SIFT算法有独特的优势。     

基于Web Service的空间信息服务技术探讨

WebService是目前炙手可热的和已经进入实用化的信息共享技术,在电子商务中被广泛推崇,本文简要介绍了WebService技术的概念、组成及其特点,探讨基于WebService的空间信息服务技术的技术实现方法,提出了利用WebService技术构建空间信息服务共享技术方案。     

局部特征信息的航拍图像匹配算法

针对快速定向和描述符构建（oriented fast and rotated brief,ORB）算法对航拍图像匹配稳定较差、保留内点较少等问题,提出一种基于非线性尺度空间的改进ORB算法。首先借助非线性扩散滤波算法构建非线性尺度空间,相较高斯尺度空间可更好的保护图像细节信息,增强匹配算法的鲁棒性;然后借助Fast算法提取特征点,再以特征点为中心选择合适的窗口提取描述符;最后通过网格运动统计算法筛选内点。实验得出：所提算法匹配准确率相较ORB算法提高5%左右,相较加速“风”算法匹配效率提高65%左右,表明所提算法具有更高匹配正确率和效率,可更好应用在航拍图像匹配中。     

物方多视影像密集匹配方法

针对多视影像由于遮挡导致的匹配不确定性问题,该文提出一种特征点和物方地面元相结合的多视影像密集匹配方法。该方法利用规则格网划分的空间平面作为基础,通过特征点匹配获取同名像点和高程赋值的格网平面,为后续匹配提供初始的DSM。在此基础上,利用铅垂线轨迹法对平面上规则分布的平面元进行匹配,加密特征点匹配结果。通过对某区域UCX影像的匹配实验表明,该文提出的算法能高效、准确地得到匹配结果,特别对较大影像计算快速,适用于实时处理。     

Multi‐scale approach to mining significant spatial co‐location patterns

Spatial co‐location pattern mining aims to discover a collection of Boolean spatial features, which are frequently located in close geographic proximity to each other. Existing methods for identifying spatial co‐location patterns usually require users to specify two thresholds, i.e. the prevalence threshold for measuring the prevalence of candidate co‐location patterns and distance threshold to search the spatial co‐location patterns. However, these two thresholds are difficult to determine in practice, and improper thresholds may lead to the misidentification of useful patterns and the incorrect reporting of meaningless patterns. The multi‐scale approach proposed in this study overcomes this limitation. Initially, the prevalence of candidate co‐location patterns is measured statistically by using a significance test, and a non‐parametric model is developed to construct the null distribution of features with the consideration of spatial auto‐correlation. Next, the spatial co‐location patterns are explored at multi‐scales instead of single scale (or distance threshold) discovery. The validity of the co‐location patterns is evaluated based on the concept of lifetime. Experiments on both synthetic and ecological datasets show that spatial co‐location patterns are discovered correctly and completely by using the proposed method; on the other hand, the subjectivity in discovery of spatial co‐location patterns is reduced significantly.     

基于尺度空间理论的定性光谱特征匹配方法研究

本文利用尺度空间理论对高光谱遥感数据中包含的精细光谱信息进行多尺度观察,在特定的尺度层次下提取能够对地物类别属性做出判断的定性约束特征,在此基础上结合光谱相似性测度最终确定像元所属类别。试验结果表明该方法可有效减少传统匹配算法由于噪声、成像环境等因素引起的误判、错分问题,提高分类识别的精度。     

一种容积信息滤波局部迭代相位解缠方法

本文针对低信噪比干涉图相位解缠难题,提出了一种容积信息滤波局部迭代相位解缠方法.先采用基于修正矩阵束模型的局部相位梯度估计算法获取待解缠像元局部窗口相位梯度信息,通过引入堆排序的质量图指引相位解缠路径,再利用容积信息滤波算法在待解缠像元局部窗口内逐像元递推进行一维状态估计,直至遍历局部窗口内所有相邻像元,即可获得待解缠...     

顾及结构特征的建筑物图形迭代凸分解方法

针对建筑物图形,该文提出了一种结合其形态表达特点的迭代凸分解方法.该方法利用Delaunay三角网提取建筑物图形凹部层次化结构和骨架线定义图形节点凹度,并依据建筑物图形直角化和简洁表达的特点选取分割线迭代消除当前图形中凹度最大节点实现图形凸分解.实验结果表明,该文方法能有效实现带洞(或岛)建筑物图形的凸分解,结果符合视...     

最优分割尺度的滑坡信息提取

针对面向对象的遥感影像分析技术这一热点问题,通过研究滑坡的地学特征和影像特征,基于QuickBird多光谱影像,提出了一种先对Quickbird影像进行多尺度分割,然后利用改进的分割质量评价函数来选择滑坡最优分割尺度,最后在最优分割尺度上构建滑坡提取规则集并进行滑坡信息提取的方法。该方法通过对提取的滑坡信息进行精度验证与分析,能使对象内部异质性和对象之间异质性达到综合效果最好。结果表明:滑坡体的正确提取率为75.86%,本文方法具有一定的可靠性和准确性。     

An innovative support vector machine based method for contextual image classification

Several remote sensing studies have adopted the Support Vector Machine (SVM) method for image classification. Although the original formulation of the SVM method does not incorporate contextual information, there are different proposals to incorporate this type of information into it. Usually, these proposals modify the SVM training phase or make an integration of SVM classifications using stochastic models. This study presents a new perspective on the development of contextual SVMs. The main concept of this proposed method is to use the contextual information to displace the separation hyperplane, initially defined by the traditional SVM. This displaced hyperplane could cause a change of the class initially assigned to the pixel. To evaluate the classification effectiveness of the proposed method a case study is presented comparing the results with the standard SVM and the SVM post-processed by the mode (majority) filter. An ALOS/PALSAR image, PLR mode, acquired over an Amazon area was used in the experiment. Considering the inner area of test sites, the accuracy results obtained by the proposed method is better than SVM and similar to SVM post-processed by the mode filter. The proposed method, however, produces better results than mode post-processed SVM when considering the classification near the edges between regions. One drawback of the method is the computational cost of the proposed method is significantly greater than the compared methods.     

A high accuracy surface modeling method based on GPU accelerated multi‐grid method

A high accuracy surface modeling method (HASM) has been developed to provide a solution to many surface modeling problems such as DEM construction, surface estimation and spatial prediction. Although HASM is able to model surfaces with a higher accuracy, its low computing speed limits its popularity in constructing large scale surfaces. Hence, the research described in this article aims to improve the computing efficiency of HASM with a graphic processor unit (GPU) accelerated multi‐grid method (HASM‐GMG). HASM‐GMG was tested with two types of surfaces: a Gauss synthetic surface and a real‐world example. Results indicate that HASM‐GMG can gain significant speedups compared with CPU‐based HASM without acceleration on GPU. Moreover, both the accuracy and speed of HASM‐GMG are superior to the classical interpolation methods including Kriging, Spline and IDW.