边角权匹配对城市大型导线网平差结果精度影响分析

通过某工业城市大型一级导线网观测成果的限差检验、观测数据处理，探讨导线网平差时、，边、角验权的合理选择和匹配，及其对平差结果的精度影响，从中得出一些认识和有益的经验。     

向斜构造煤层开采地表移动规律研究

现行的地表移动预计方法，都是建立在开采工作面主断面为线性分布的基础上，因此，对于非线性分布煤层的预计将会产生较大的误差。本文以随机介质理论为基础，利用曲线积分的方法建立了地表移动与变形预计公式，并且利用数值积分法和叠加原理解算地表移动与变形值，扩大了地表移动预计理论的应用范围，同时也大大提高了预计值的精度     

中国海洋上空细粒子气溶胶与短寿命痕量气体的时空关系

定量分析气溶胶与痕量气体之间的时空变化关系有助于进一步研究气粒转化。本文采用2006年—2015年MODIS气溶胶光学厚度(AOD)、细粒子模态比(FMF)和OMI痕量气体(SO_2、NO_2和HCHO)数据,对黄海、东海和南海区域上空的细粒子气溶胶与痕量气体进行定量分析。先对气溶胶和痕量气体作均值分析发现:AOD_(fine)、SO_2、NO_2和HCHO的均值在黄海、南海、东海均依次减小;再对气溶胶对痕量气体的敏感度分析发现:黄海地区的AOD_(fine)对SO_2最敏感,敏感度为0.424,这与中国东部沿海城市的人为排放有关;而东海和南海地区对HCHO的敏感度较高,依次为0.664和0.545,主要受东南亚和中国南方地区生物质燃烧影响。最后,对3个区域的气溶胶与痕量气体按季节作相关性分析发现:黄海地区AOD_(fine)在夏秋两季与SO_2的相关性较强(R0.5),主要由于夏秋两季的温湿度大,利于发生气—粒转化;东海地区夏季HCHO与AOD_(fine)相关性较明显(R=0.57);南海春季HCHO与AOD_(fine)相关性较好(R=0.57),呈现出区域与季节性的变化。最终发现,气溶胶与痕量气体随着时空变化存在相关关系。     

高分五号热红外传感器多通道SST反演

2018-05高分五号（GF-5）卫星发射升空,其上搭载的全谱段成像仪在热红外8—13 μm谱段范围内具有4个温度反演通道（B09,B10,B11,B12）,空间分辨率设计优于40 m,在国内民用传感器领域实现了由单通道向多通道、中空间分辨率向高空间分辨率的跨越式突破,使得GF-5卫星热红外数据在地表热环境遥感领域具有极其重要应用价值。本研究基于GF-5的4个热红外通道的通道响应函数,利用全球742条TIGR（Thermodynamic Initial Guess Retrieval）探空廓线数据,进行不同观测角度、水汽含量和海表发射率条件下的MODTRAN4.0（Moderate resolution atmospheric Transmittance and Radiance code4.0)辐射传输过程模拟,基于模拟结果分别对两通道、三通道和四通道劈窗算法海表温度SST（ Sea Surface Temperature）反演系数进行修订,并分析观测角度、水汽含量和海表发射率对不同通道组合的精度影响,并通过GF-5卫星实际反演的SST结果进行验证。GF-5全谱段成像仪SST反演两通道劈窗算法组合共有6种,即B09-B10、B09-B11、B09-B12、B10-B11、B10-B12、B11-B12;三通道劈窗算法组合共有4种,即B09-B10-B11、B09-B10-B12、B09-B11-B12、B10-B11-B12;四通道劈窗算法组合1种,即B09-B10-B11-B12。通过对不同通道组合形式研究发现,水汽含量对SST反演精度有较大的影响,且温度反演的精度随着水汽含量的增加而降低;其次是观测角度,SST反演精度随着观测天顶角的增大而降低;最后是发射率的影响,两通道、三通道和四通道劈窗算法SST反演精度随着发射率的变化总体在0.1 K以内变化。最后以大亚湾核电站周围海域为验证区,用GF-5热红外遥感影像进行SST的反演并做误差分析,结果表明B09-B10通道SST反演实际误差为0.57 K,反演精度较高,实际误差与理论模拟误差相差0.24 K,差异的来源主要包括辐射定标和传感器噪声等要素影响,其他通道形式反演精度有待于传感器响应稳定后进一步验证。     

Tile‐based polygon overlay of vector data in a virtual globe

The demand for analysis of large‐scale data has increased with increased access to spatial vector data. Polygon overlay of vector data in a virtual globe requires proprietary data structures and proprietary analysis algorithms. A vector data structure is designed for rapid polygon overlay in a virtual globe by recording the metadata of the triangles (TriMeta) that constitute polygons. A polygon overlay algorithm is proposed based on this data structure. The overlay of two complex GIS polygons is transformed into the intersection computation of their 3D triangular presentations. The intersection computation of two sets of triangles is reduced considerably by utilizing TriMeta to filter out the disjoint triangle pairs and rapidly identify the contained triangle. The new method improves the overlay efficiency in a virtual globe because the amount of computation required to calculate the intersections of two large polygons and drape the intersections onto a terrain surface is reduced.     

A probabilistic framework for improving reverse geocoding output

Reverse geocoding, which transforms machine‐readable GPS coordinates into human‐readable location information, is widely used in a variety of location‐based services and analysis. The output quality of reverse geocoding is critical because it can greatly impact these services provided to end‐users. We argue that the output of reverse geocoding should be spatially close to and topologically correct with respect to the input coordinates, contain multiple suggestions ranked by a uniform standard, and incorporate GPS uncertainties. However, existing reverse geocoding systems often fail to fulfill these aims. To further improve the reverse geocoding process, we propose a probabilistic framework that includes: (1) a new workflow that can adapt all existing address models and unitizes distance and topology relations among retrieved reference data for candidate selections; (2) an advanced scoring mechanism that quantifies characteristics of the entire workflow and orders candidates according to their likelihood of being the best candidate; and (3) a novel algorithm that derives statistical surfaces for input GPS uncertainties and propagates such uncertainties into final output lists. The efficiency of the proposed approaches is demonstrated through comparisons to the four commercial reverse geocoding systems and through human judgments. We envision that more advanced reverse geocoding output ranking algorithms specific to different application scenarios can be built upon this work.     

Small‐area patch‐merging method accounting for both local constraints and the overall area balance

Small‐area patch merging is a common operation in land use data generalization. However, existing research on small‐area patch merging has mainly focused on local compatibility measures, which often lead to area imbalances among land use types from a global perspective. To address the shortcomings of previous studies by resolving local and global concerns simultaneously, this article proposes a merging method that considers both local constraints and the overall area balance. First, a local optimization model that considers three constraints—namely, the areas of neighboring patches, the lengths of shared arcs, and semantic similarity—is established. The areas of small patches are first pre‐allocated. Subsequently, in accordance with an area change threshold for individual land use types, land use types with area changes that exceed this threshold are identified. The patches corresponding to these land use types are subjected to iterative adjustments while considering the overall area balance. Based on their area splitting abilities, the split lines for small‐area patches are determined, and small‐area patches are merged. Finally, actual data from Guangdong Province are used for validation. The experimental results demonstrate that the proposed method is capable of preserving the local compatibility of patches while balancing the overall area associated with each land use type.     

A hierarchical indexing strategy for optimizing Apache Spark with HDFS to efficiently query big geospatial raster data

ABSTRACT

Earth observations and model simulations are generating big multidimensional array-based raster data. However, it is difficult to efficiently query these big raster data due to the inconsistency among the geospatial raster data model, distributed physical data storage model, and the data pipeline in distributed computing frameworks. To efficiently process big geospatial data, this paper proposes a three-layer hierarchical indexing strategy to optimize Apache Spark with Hadoop Distributed File System (HDFS) from the following aspects: (1) improve I/O efficiency by adopting the chunking data structure; (2) keep the workload balance and high data locality by building the global index (k-d tree); (3) enable Spark and HDFS to natively support geospatial raster data formats (e.g., HDF4, NetCDF4, GeoTiff) by building the local index (hash table); (4) index the in-memory data to further improve geospatial data queries; (5) develop a data repartition strategy to tune the query parallelism while keeping high data locality. The above strategies are implemented by developing the customized RDDs, and evaluated by comparing the performance with that of Spark SQL and SciSpark. The proposed indexing strategy can be applied to other distributed frameworks or cloud-based computing systems to natively support big geospatial data query with high efficiency.     

车辆轨迹数据的道路学习提取法

车辆轨迹数据的道路信息提取是地理信息领域的热点也是难点之一,深度学习的快速发展为该问题的解决提供了一种思路与方法。本文针对车辆轨迹数据的车行道级道路提取问题,引入深度学习领域的生成式对抗网络,利用残差网络构建深层网络和多尺度感受野感知轨迹数据不同细节特征,构建了基于条件生成式对抗网络的轨迹方向约束下车行道级道路提取模型。首先提出了朝向-颜色映射栅格化转换方法,实现轨迹朝向信息向HSV颜色空间的转换;然后利用样本数据学习模型参数;最后将训练模型应用到郑州、成都、南京3个试验区域提取车行道级道路数据。试验结果表明,本文方法能够有效地提取完整的车行道级道路数据。     

一种移动视频与地理场景的融合方法

快速准确地了解灾害现场状况是救灾过程中的重中之重。通常发生灾害都会使用无人机进行现场勘察,但是无人机视频难以与实际的地理场景关联起来,为此本文提出了一种移动视频与地理场景的融合方法。该方法首先采用具有仿射不变性的ASIFT算法检测特征点,将匹配后的特征点采用RANSAC算法进行迭代剔除噪点,计算视频与地理场景最优的透视变换矩阵模型参数;然后将计算得到的透视变换参数应用到视频数据,恢复视频角点坐标;最后通过内插得出所有视频帧的角点坐标,实现视频与DOM的精确融合。试验结果表明,对视频数据匹配的间隔帧越短,其整体融合精度越高,通过本文方法进行视频与地理场景融合的误差标准差低于10 m。