捷联惯性导航系统算法简化机制

随着低精度惯性导航系统的广泛使用,算法简化也成了研究热点。本文通过实验来验证简化导航算法对于不同惯导尤其是低精度惯导的可行性,这对实时性应用有很大影响。通过对以上内容的介绍,希望可以为进一步研究捷联算法、低精度惯导的实时应用提供一定的参考。     

一种复杂地理环境越野通行路径寻优算法

设计了基于障碍距离的优化算法,解决突发事件应急联动中复杂地理环境下最短路径的寻优求解问题。在详细分析地理空间高程、坡度、障碍物等空间信息的基础上,通过计算搜索空间、搜索方向和网络弧段权值构建网络拓扑关系网,并利用遗传算法对最优路径进行寻优求解。     

基于距离权重的分块MASK匀光算法

匀光处理是遥感影像处理中十分重要的一个步骤,现有的MASK匀光算法对消除影像内部光照不均匀现象有较好的效果。但是,MASK算法仍具有一定的局限性,如高斯滤波器最佳尺寸的选择问题,匀光后影像依然存在反差分布不一致问题。针对这些问题,本文提出了一种基于距离权重的分块MASK匀光算法。通过实验,与传统MASK算法进行对比分析,证明本方法得到的结果影像质量更好,反差也趋于一致。     

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.     

基于规则库和网格算法的土地利用现状图自动数字注记

图形自动注记可极大地提高制图的工作效率。针对土地利用现状图数字注记的特点,本文从地图认知角度出发,建立注记自动配置的规则库,提出面状要素自动注记的一种新的算法——网格法。该算法最大的优点是容易实现、效率高,可方便地解决注记压盖冲突等问题。通过开发一个程序实例,对图斑要素进行了自动数字注记,实验表明95％以上的图形注记效果都较为理想。     

VC环境下最短路径算法的实现

设计了一种方便查找及显示最短路径的数据结构,对仅研究计算一条最短路径的Dijkstra算法加以了改进,并在VC下实现一个顶点到另一个顶点的所有最短路径的查找。     

一种随机增量式地形建模算法设计

Delaunay三角网是DEM主要表示方式，一直以来，因其数据结构和构造算法的复杂性导致应用受限。本文结合随机增量式算法理论，提出一种全新的有向无环图（directed acyclic graph，DAG）查找数据结构（search data structure）和随机增量式Delaunay三角网构造算法，并对算法作了简要证明和深入分析。该算法最大的特点是具有随机特性，能够支持地形特征数据的动态更新。     

Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition

We develop and apply an efficient strategy for Earth gravity field recovery from satellite gravity gradiometry data. Our approach is based upon the Paige-Saunders iterative least-squares method using QR decomposition (LSQR). We modify the original algorithm for space-geodetic applications: firstly, we investigate how convergence can be accelerated by means of both subspace and block-diagonal preconditioning. The efficiency of the latter dominates if the design matrix exhibits block-dominant structure. Secondly, we address Tikhonov-Phillips regularization in general. Thirdly, we demonstrate an effective implementation of the algorithm in a high-performance computing environment. In this context, an important issue is to avoid the twofold computation of the design matrix in each iteration. The computational platform is a 64-processor shared-memory supercomputer. The runtime results prove the successful parallelization of the LSQR solver. The numerical examples are chosen in view of the forthcoming satellite mission GOCE (Gravity field and steady-state Ocean Circulation Explorer). The closed-loop scenario covers 1 month of simulated data with 5 s sampling. We focus exclusively on the analysis of radial components of satellite accelerations and gravity gradients. Our extensions to the basic algorithm enable the method to be competitive with well-established inversion strategies in satellite geodesy, such as conjugate gradient methods or the brute-force approach. In its current development stage, the LSQR method appears ready to deal with real-data applications.     

模拟退火算法在控制网平差中的应用

线性最小二乘估计在对非线性函数进行线性近似的过程中会产生模型误差,而一些非线性参数估计方法可能因为函数复杂而难以求导,法方程系数矩阵秩亏或呈病态矩阵时难以求解,非线性迭代解法有时对初始值的选择存在依赖性,不恰当的初始值会导致迭代无法收敛。针对这些问题,引入了模拟退火算法,介绍了该算法的基本原理、计算步骤和收敛性,并以3个控制网平差应用为例,说明该算法具有无需求导求逆,简洁实用,易于编程等优势,并能实现全局优化,获得高精度的平差结果。     

基于局部地球重力场模型的水下目标被动定位

提出了一种基于局部地球重力场模型的水下被动定位新模式。这种方法无需使用常用的匹配算法,因而也就摆脱了匹配算法的诸多限制。以分辨率为2′×2′的某区域重力异常数据为背景场进行仿真,仿真结果表明,局部重力场模型的平均误差小于0.133 1 mGal,潜器的平均经纬方向定位误差分别小于0.777 0nmile和1.244 4 nmile。