Automatically Conflating Road Vector Data with Orthoimagery

Recent growth of the geospatial information on the web has made it possible to easily access a wide variety of spatial data. The ability to combine various sets of geospatial data into a single composite dataset has been one of central issues of modern geographic information processing. By conflating diverse spatial datasets, one can support a rich set of queries that could have not been answered given any of these sets in isolation. However, automatically conflating geospatial data from different data sources remains a challenging task. This is because geospatial data obtained from various data sources may have different projections, different accuracy levels and different formats (e.g., raster or vector format), thus resulting in various positional inconsistencies. Most of the existing algorithms only deal with vector to vector data conflation or require human intervention to accomplish vector data to imagery conflation. In this paper, we describe a novel geospatial data fusion approach, named AMS-Conflation, which achieves automatic vector to imagery conflation. We describe an efficient technique to automatically generate control point pairs from the orthoimagery and vector data by exploiting the information from the vector data to perform localized image processing on the orthoimagery. We also evaluate a filtering technique to automatically eliminate inaccurate pairs from the generated control points. We show that these conflation techniques can automatically align the roads in orthoimagery, such that 75% of the conflated roads are within 3.6 meters from the real road axes compared to 35% for the original vector data for partial areas of the county of St. Louis, MO.

Automatic and Accurate Extraction of Road Intersections from Raster Maps

Since maps are widely available for many areas around the globe, they provide a valuable resource to help understand other geospatial sources such as to identify roads or to annotate buildings in imagery. To utilize the maps for understanding other geospatial sources, one of the most valuable types of information we need from the map is the road network, because the roads are common features used across different geospatial data sets. Specifically, the set of road intersections of the map provides key information about the road network, which includes the location of the road junctions, the number of roads that meet at the intersections (i.e., connectivity), and the orientations of these roads. The set of road intersections helps to identify roads on imagery by serving as initial seed templates to locate road pixels. Moreover, a conflation system can use the road intersections as reference features (i.e., control point set) to align the map with other geospatial sources, such as aerial imagery or vector data. In this paper, we present a framework for automatically and accurately extracting road intersections from raster maps. Identifying the road intersections is difficult because raster maps typically contain much information such as roads, symbols, characters, or even contour lines. We combine a variety of image processing and graphics recognition methods to automatically separate roads from the raster map and then extract the road intersections. The extracted information includes a set of road intersection positions, the road connectivity, and road orientations. For the problem of road intersection extraction, our approach achieves over 95% precision (correctness) with over 75% recall (completeness) on average on a set of 70 raster maps from a variety of sources.

矢量栅格一体化数据结构设计与应用

针对如何在“3S”集成过程中选择良好数据结构的问题,通过分析矢量数据结构与栅格数据结构的优缺点,以二级划分策略建立具有两种结构优点的矢量栅格一体化数据结构,使空间数据在栅格化的同时能满足矢量精度要求,并给出其逻辑表示。在此基础上,讨论基于该数据结构的空间数据采集与叠加分析策略。     

GIS中实用化矢量栅格一体化技术实现

矢量栅格一体化技术是ＧＩＳ发展的一个方向，作者在实践基础上介绍了一种实用化矢量栅格一体化系统的设计、数据组织、数据匹配以及一体化分析，并列举了若干应用实例。     

Raster to Vector Conversion for Engineering Drawings： Survey and Prospect

1 Introduction Raster to Vector Conversion (RVC) for Engineering Drawings(ED), also known as vectorization, is a procedure to find the vector form of graphic primitives – straight line, circle and arc segments – from the raster engineering drawing. It is an automated process of analyzing and recognizing graphic primitives in the raster engineering drawing, converting them into vector form. A lot of instances need to accomplish the raster to vector recognition and conversion, for example,…     

专题图件编辑软件开发中的MapObjects技术

专题图件编辑软件主要解决栅格数据和矢量数据的叠加匹配、地图信息的分类显示以及矢量信息的物理逻辑结构转换。该文以专题图件编辑软件的部分开发过程为例,总结ESRI公司推出的GIS组件——Mapobjects在开发过程中三项关键技术的应用,为应用MapObjects进行二次开发提供一定参考。     

专题图件编辑软件开发中的MapObjects技术

专题图件编辑软件主要解决栅格数据和矢量数据的叠加匹配、地图信息的分类显示以及矢量信息的物理逻辑结构转换。该文以专题图件编辑软件的部分开发过程为例,总结ESRI公司推出的GIS组件——MapObjects在开发过程中三项关键技术的应用,为应用MapObjects进行二次开发提供一定参考。     

Towards ITS Map Database Interoperability—Database Error and Rectification

One of the impediments to the implementation of ITS is the lack of map database interoperability. Centreline databases are available from a number of sources, but few were designed specifically for ITS. Consequently there are a variety of problems—coordinate inaccuracy, errors of omission and commission, missing or wrong street names, incorrect topology—that are compounded when communicating parties use databases from different vendors. Many ITS applications (e.g., emergency response, ATIS) rely on the exchange of messages in which location is a component. Map error and interoperability problems can result in a variety of practical difficulties, from inappropriate vehicle routing to delays in delivery of critical services. These problems can be addressed by (a) standards for map databases, (b) intelligent messaging, (c) national integration efforts to improve database quality in the long term. This paper examines the dimensions of the problem, and describes solutions currently under development.     

一种基于点模式的指纹分阶段匹配算法的研究

介绍了一个指纹中心点定位（Core）以及用中心点为中心构造特征向量进行初匹配，并且以此作为最佳匹配参考点来进行二次匹配的算法。本算法的特点：1．介绍指纹中心点的准确定位。2．以中心点作为最佳匹配参考点将匹配分为两步进行：初匹配利用了细节点间的结构关系，克服了图像的平移和旋转的影响；二次匹配引用了界限盒思想，增强指纹匹配算法对形变的适应能力。本算法把点模式的优点和基于结构的特征点之间的相对距离不变性、所跨越纹线数目的不变性、特征点类型的不变性很好结合起来。实验结果显示本算法具有较强的适应性和较高的拒识率。     

分布式空间数据库的研究与设计

对分布式空间数据库进行了分析;设计了一个分布式空间数据库的体系结构,结合空间数据的特征和GIS应用,设计了空间数据的分割和分布方法;在上面的设计基础上,提出了一个两级空间数据查询描述规范,并对分布式查询进行了设计。     

针对动车组全生命周期集成管理的多源异构数据融合框架设计

随着我国动车组产业的不断发展,对动车组全生命周期数据的管理成为人们关注的焦点。首先,本文分析动车组全生命周期数据现状与存在问题;其次,针对动车组全生命周期多源异构数据的特点,提出一种利用动车组本体知识库的数据融合框架;最后,针对其中的模式匹配问题,提出一种基于组合模式相似度的模式匹配方法。实验结果表明,该方法对动车组多源异构数据的模式匹配结果良好,能够在很大程度上提高动车组多源异构数据融合的自动化程度。     

基于多尺度特征点识别与局部谱特征的离散数据匹配

为了实现部分重叠且不同视角的测量数据配准,提出多尺度特征点检测算法,可以从大量的原始数据中提取少量特征点。该算法包括离散曲率计算、双边滤波和特征点计算等步骤,特征点个数可以由尺度参数粗略控制。提出局部形状谱描述器来描述每个特征点的局部形状特性,首先利用局域点的距离和曲率信息构造关系矩阵,然后通过计算关系矩阵的特征值来构造谱描述器,利用该描述器可以方便地计算不同点集中各个特征点的对应关系,进而实现两个数据点集的配准。通过实例验证了该算法有较好的抗噪性和运行速度。     

支撑向量机及其在数据挖掘中的应用

首先介绍了数据挖掘的基本概念,然后系统地研究了支撑向量机学习算法,着重分析了支撑向量机的算法的特点。并阐述了支撑向量机的关键技术一核函数。最后讨论了支撑向量中学习算法在数据挖掘中的应用。     

新型图像角度匹配方法及其应用研究

探讨了一种基于机器视觉的PCB自动装配线多焊盘实时定位方法。采用多分辨率图像金字塔匹配策略,利用模板图像与待搜索图像的灰度特性,使用圆投影匹配进行初始候选匹配点的选取,得到一系列的候选匹配子图;使用SIFT算法对候选匹配子图和模板图像进行特征匹配,确定对应匹配点,消除误匹配的候选子图;根据点的模式匹配,确定大致的旋转角度,使用重采样和插值的方法计算精确的旋转角度。实验表明,该方法可以准确、实时地实现目标定位。     

匹配与姿态估计的粒子群优化算法

点模式匹配问题是机器视觉与模式识别领域中一个基础问题,在目标识别、医学图像配准、遥感图像匹配、姿态估计等方面都得到广泛应用。提出一种在仿射变换下利用粒子群优化算法进行图像点模式下的匹配与姿态估计的方法。算法首先把点集匹配问题转化为解空间为仿射参数空间下的目标函数优化问题,然后运用粒子群算法对相应的变换参数进行搜索,获得问题最优解。本文贡献如下：1)给出一种仿射参数的初始估计方法,提高了后续算法搜索效率;2)引入阈值和次近点规则,改进了最近点匹配搜索方法,能较好地拒绝出格点（outliers）,并提高算法有效性;3)从两方面对PSO方法进行了改进,加强了原PSO的全局和局部搜索能力。实验结果表明,算法具有有效性和鲁棒性。     

主动搜索耦合图案匹配的PCB板基准点识别算法

为了解决当前PCB板基准点识别算法在基准点尺寸变化和存在污痕的情况下易产生较高的误识别率等问题,提出主动搜索耦合图案匹配的PCB基准点识别算法。首先,引入高斯中值滤波对图像进行平滑处理,采用阈值处理与形态学分割图像,通过搜索符合特征标准的基准点轮廓,设计主动搜索算子,完成对基准点的首轮识别。然后,通过基准点模板图像和Aforge.NET匹配函数,在图像中定位基准点目标,返回中心点坐标与匹配度,完成对基准点的精准识别。实验结果显示：与当前识别技术相比,本文算法具有更高的识别精度与抗干扰性。     

矢量与栅格结合的三维地质模型编辑方法

三维地质模型主要通过剖面构造．自动建模方法要求这些剖面基本平行,并且相邻剖面地质体的差别不能过大．本文针对剖面数据较少且不平行的情形,设计了人机交互的三维地质模型构造方法,利用普通多面体栅格化算法和由Marching Cubes算法得到的光栅矢量化,实现了光栅和矢量模型的相互转换．在保证模型间拓扑正确的基础上,提高了地质模型的编辑效率,并在实践中得到了检验．     

Multilevel Robustness for 2D Vector Field Feature Tracking,Selection and Comparison

Critical point tracking is a core topic in scientific visualization for understanding the dynamic behaviour of time-varying vector field data. The topological notion of robustness has been introduced recently to quantify the structural stability of critical points, that is, the robustness of a critical point is the minimum amount of perturbation to the vector field necessary to cancel it. A theoretical basis has been established previously that relates critical point tracking with the notion of robustness, in particular, critical points could be tracked based on their closeness in stability, measured by robustness, instead of just distance proximity within the domain. However, in practice, the computation of classic robustness may produce artifacts when a critical point is close to the boundary of the domain; thus, we do not have a complete picture of the vector field behaviour within its local neighbourhood. To alleviate these issues, we introduce a multilevel robustness framework for the study of 2D time-varying vector fields. We compute the robustness of critical points across varying neighbourhoods to capture the multiscale nature of the data and to mitigate the boundary effect suffered by the classic robustness computation. We demonstrate via experiments that such a new notion of robustness can be combined seamlessly with existing feature tracking algorithms to improve the visual interpretability of vector fields in terms of feature tracking, selection and comparison for large-scale scientific simulations. We observe, for the first time, that the minimum multilevel robustness is highly correlated with physical quantities used by domain scientists in studying a real-world tropical cyclone dataset. Such an observation helps to increase the physical interpretability of robustness.     

Modified self-organising maps with a new topology and initialisation algorithm

Mapping quality of the self-organising maps (SOMs) is sensitive to the map topology and initialisation of neurons. In this article, in order to improve the convergence of the SOM, an algorithm based on split and merge of clusters to initialise neurons is introduced. The initialisation algorithm speeds up the learning process in large high-dimensional data sets. We also develop a topology based on this initialisation to optimise the vector quantisation error and topology preservation of the SOMs. Such an approach allows to find more accurate data visualisation and consequently clustering problem. The numerical results on eight small-to-large real-world data sets are reported to demonstrate the performance of the proposed algorithm in the sense of vector quantisation, topology preservation and CPU time requirement.     

带通配符和One-Off条件的序列模式挖掘

很多应用领域产生大量的序列数据。如何从这些序列数据中挖掘具有重要价值的模式,已成为序列模式挖掘研究的主要任务。研究这样一个问题：给定序列S、支持度阈值和间隔约束,从序列S中挖掘所有出现次数不小于给定支持度阈值的频繁序列模式,并且要求模式中任意两个相邻元素在序列中的出现位置满足用户定义的间隔约束。设计了一种有效的带有通配符的模式挖掘算法One-Off Mining,模式在序列中的出现满足One-Off条件,即模式的任意两次出现都不共享序列中同一位置的字符。在生物DNA序列上的实验结果表明,One-Off Mining比相关的序列模式挖掘算法具有更好的时间性能和完备性。