利用一维变分同化方法从地基GPS相位延迟中获取大气折射率

GPS信号相位延迟中包含很多大气信息,通过一定的方法可以从中获取有价值的大气参数。基于地基GPS相位延迟数据,提出了一种结合经验模式的一维变分同化获取大气折射率的方法。利用GPS相位延迟模拟数据进行同化试验,讨论了背景误差的设置对同化结果的影响,采用实测个例对该方法进行了验证。结果表明,该一维变分同化方法可行,并可获取高精度的0~60 km大气折射率。低层大气背景误差设置的准确程度会对整个高度范围内的同化效果产生影响。首次将同化获取的大气折射率应用于无线电波折射修正,取得了很好的修正效果,修正精度可达1 mm量级。     

结合水平集与光流的序列影像运动分割技术研究

提出一种结合变分水平集分割与变分光流的运动分割方法。该方法将光流能量函数与水平集分割能量函数进行整合形成新的运动分割能量函数,并采用变分方法进行优化。采用无人机序列影像对该运动分割方法进行实验分析,实验结果表明该方法在目标运动位移过大时,既能准确地估计出运动矢量,又能精确地分割出目标区域。     

数字化曲线的附有参数的条件平差

本文针对数字化地图的特点,提出一圆曲线拟合方程,采用附有参数的条件平差法来估计拟合曲线的参数,给出了一套严密的计算方法,通过计算实例验证了该方法的有效性和可行性,并对参数进行了精度评定.     

视觉驱动的变分配准方法

针对传统整体配准模型不能充分顾及局部变形的问题,提出了一种视觉驱动的变分配准方法。该方法在变分模型建立中综合考虑了局部变换、整体平滑和视觉约束,同时兼顾了亮度和对比度差异。首先,基于灰度均方根误差建立配准模型的数据项;其次,为了保证整体平滑,模型采用H¹半范数进行自适应约束;最后,为了保证影像中的空间属性满足视觉的要求,不能出现扭曲变形,采用直线特征进行先验约束。在变分模型求解过程中先利用整个影像估计影像之间的整体变换参数,然后采用小的邻域范围进行局部估计。整个过程在多水平差分框架下迭代求解变换参数,进而兼顾了整体平滑和局部变形。笔者利用ZY-3卫星数据进行了试验,采用目视和量化指标进行了评价,验证了本文方法的优越性。     

CHAMP卫星的纯几何定轨及动力平滑中的动力模型补偿研究

探讨了利用CHAMP卫星星载GPS数据实现纯几何PPP定轨的方法 ,对该几何轨道的动力平滑过程进行了分析 ,提出了增加非参数项吸收动力模型误差的半参数动力平滑方法。     

基于改进果蝇算法优化SVM的矿区地表变形预测方法

矿区地表变形呈现出典型的非平稳、突发性和不确定性,而传统支持向量机(Support Vector Machine, SVM)预测模型的预测性能受核参数选取影响较大。针对该问题,本文提出一种改进果蝇算法(Improved fruit fly optimization algorithm, IFOA)优化SVM的矿区地表变形预测方法。首先采用自适应变步长迭代方式代替传统FOA算法的固定迭代步长,提升FOA的收敛速度和全局寻优能力;然后利用IFOA对SVM进行优化,实现最优核参数自动选择的同时提升预测精度;最后采用某矿区实测数据开展试验。结果表明：所提方法相对于传统灰色模型和BP神经网络模型具备更高的预测精度和稳定性,更适合实际工程应用场景。     

变窗口均值限差法的点云噪声滤除方法

利用三维点云数据建模的准确与否很大程度上依赖于点云滤波效果的好坏,通过对滤波方法的研究,可以提供尽量准确的地面点云数据.文章利用C#高级编程语言,结合OpenGL三维图形库对三维激光点云数据进行噪声滤波处理;将三维激光点云投影到格网内的拟合平面上,通过变窗口均值限差法对高差、坡度关键参数进行了分析对比,确定出合适滤波参数,模拟表达实际地形的原貌.实验证明,变窗口的均值限差法可以滤除绝大部分噪声,对于紧邻地面的部分噪声,可以通过进一步拟合最小二乘曲面或加入先验信息等方法去除.该方法不仅能够有效去除噪声,而且还能较大程度地保留地形的特征信息.     

应用于面状地理实体聚类分析的线段链形状相似性准则

提出了一种满足旋转与平移不变性的线段链形状相似性评价方法。该方法计算简便，适用于面状地理实体聚类分析，并给出了该评价方法的实现算法，分析了参数对评价方法可能产生的影响及影响程度。     

改进的参数统计机载雷达点云滤波方法

针对基于高程的偏度参数统计的LiDAR数据滤波对地形起伏城区滤波适应性不强的弱点,文章对该方法进行了改进,提出基于二次曲面高程残差的偏度参数统计法的LiDAR数据滤波。实验结果表明改进的方法不仅延续了参数统计法无需阈值的优势,而且对城区滤波更具适应性、合理性和稳定性,能够明显提高滤波精度。     

一种改进的支持向量机参数优化方法

为了保证支持向量机在提高核参数寻优效率的同时,拥有较高的学习精度,深入研究了核参数对支持向量机分类的影响,分析了网格搜索法和双线性搜索法的优缺点,并以此为基础提出了一种改进的参数优化方法。实验结果表明,该算法在保证支持向量机获得较高学习精度的同时能大大缩短参数寻优的时间,证明了该算法的优越性。     

Robust estimation of geodetic datum transformation

The robust estimation of geodetic datum transformation is discussed. The basic principle of robust estimation is introduced. The error influence functions of the robust estimators, together with those of least-squares estimators, are given. Particular attention is given to the robust initial estimates of the transformation parameters, which should have a high breakdown point in order to provide reliable residuals for the following estimation. The median method is applied to solve for robust initial estimates of transformation parameters since it has the highest breakdown point. A smooth weight function is then used to improve the efficiency of the parameter estimates in successive iterative computations. A numerical example is given on a datum transformation between a global positioning system network and the corresponding geodetic network in China. The results show that when the coordinates are contaminated by outliers, the proposed method can still give reasonable results. Received: 25 September 1997 / Accepted: 1 March 1999     

A coordinate-invariant model for deforming geodetic networks: understanding rank deficiencies,non-estimability of parameters,and the effect of the choice of minimal constraints

By considering a deformable geodetic network, deforming in a linear-in-time mode, according to a coordinate-invariant model, it becomes possible to get an insight into the rank deficiency of the stacking procedure, which is the standard method for estimating initial station coordinates and constant velocities, from coordinate time series. Comparing any two out of the infinitely many least squares estimates of stacking unknowns (initial station coordinates, velocity components and transformation parameters for the reference system in each data epoch), it is proven that the two solutions differ only by a linear-in-time trend in the transformation parameters. These pass over to the initial coordinates (the constant term) and to the velocity estimates (the time coefficient part). While the difference in initial coordinates is equivalent to a change of the reference system at the initial epoch, the differences in velocity components do not comply with those predicted by the same change of reference system for all epochs. Consequently, the different velocity component estimates, obtained by introducing different sets of minimal constraints, correspond to physically different station velocities, which are therefore non-estimable quantities. The theoretical findings are numerically verified for a global, a regional and a local network, by obtaining solutions based on four different types of minimal constraints, three usual algebraic ones (inner or partial inner) and the lately introduced kinematic constraints. Finally, by resorting to the basic ideas of Felix Tisserand, it is explained why the station velocities are non-estimable quantities in a very natural way. The problem of the optimal choice of minimal constraints and, hence, of the corresponding spatio-temporal reference system is shortly discussed.     

直线特征约束下利用Plücker坐标描述的LiDAR点云无初值配准方法

经典的基于点状特征匹配的地面激光雷达（light detection and ranging,LiDAR）点云配准算法实现过程中,点状特征的提取精度对算法运行结果的影响通常较大;基于迭代运算的LiDAR点云配准算法计算量大,对未知参数的初值依赖程度较高,在求解大转角刚体变换参数时算法不稳定。对此,提出了一种线状特征约束下基于Plücker直线坐标描述的LiDAR点云配准算法。立足于经典的向量代数与对偶四元数的相关理论与方法,分析并确定了Plücker直线坐标与对偶四元数之间的相互转换关系以及模型描述方法;以LiDAR点云配准前后同名线状特征的Plücker直线坐标相等为约束条件,构建了线状特征约束下基于Plücker直线坐标描述的刚体变换模型;立足于最小二乘基本准则,通过目标函数的极值化分析实现了线状特征约束下地面LiDAR点云配准参数的直接求解。实验结果表明,所构建的基于Plücker直线坐标描述的地面LiDAR点云配准模型,无需事先确定变换参数的初值,避免了多元函数的线性化过程,解除了参数结果对于迭代初值的依赖,理论上克服了迭代法在求解大转角相似变换参数时的算法不稳定问题。此外,较之单纯基于点状特征匹配的LiDAR点云配准算法,该算法可以有效地增强LiDAR点云配准过程的约束,达到提高配准质量的目的。     

A dual quaternion-based,closed-form pairwise registration algorithm for point clouds

The representation of similarity transformation in three-dimensional (3D) space, especially of orientation, is a crucial issue in navigation, geodesy, photogrammetry, robot arm manipulation, etc. Considering the large amount of computer resources required by iterative algorithms designed for spatial similarity transformation, the high dependence on initial values of unknown parameters, and the instability of solving transformation parameters for large-angle registration, a closed-form solution for pairwise light detection and ranging (LiDAR) point cloud registration is proposed. In this solution, dual-number quaternions are used to represent the 3D rotation. The relationship between the rotation matrix-based representation of similarity transformation and the dual quaternion-based representation is described first. Considering that the same features from two neighboring stations coincide after pairwise registration, a dual quaternion-based error norm, which is associated with the sum of the position errors, is constructed. Based on theory of least squares and by extreme value analysis of the error norm, detailed derivations of the model and the main formulas are obtained. Once the similarities between the same features from the two neighboring LiDAR stations are constructed, the rotation matrix, the scale parameter, and the translation vector are simultaneously derived. Two experiments are conducted to verify the feasibility and effectiveness of the proposed algorithm. The proposed algorithm has the advantages of simplicity and ease of implementation, making it better than the traditional methods that use matrices to describe spatial rotation. Moreover, it solves the transformation parameters without the initial estimates of unknown parameters, making it better than iterative algorithms. Most importantly, in contrast to unit quaternion-based algorithms, the proposed algorithm solves seven unknown parameters simultaneously. Therefore, it effectively avoids the accumulation of introduced error in calculation and the negative impact from the inappropriate choice of initial values.     

基于中位参数初值的等价权抗差估计方法

等价权抗差估计法保留最小二乘估计处理正常观测值的优良特性,但其抗差性与初值关系极大,若用最小二乘估值作初值,必定会影响其抗差性.中位数法具有很好的抗差特性,但它只用部分观测数据计算参数估值,丢失大量有效信息.基于中位参数的抗差估计方法,在有限样本时,给出其崩溃污染率的估算方法.根据中位参数法和等价权抗差估计法的各自优点...     

基于BP神经网络的GPS导航算法

GPS导航解算中常用最小二乘算法。随着高动态用户需求精度的不断提高，且由于线性化忽略高次项，初始值精度低以及差分后剩余或放大误差的存在。导航解精度很难满足高动态用户的需求。为此，本文基于BP神经网络的非线性逼近性能。给出了基于BP神经网络的GPS导航算法。实测数据计算结果表明该算法能够真实地反映载体运动轨迹，其导航解的精度和可靠性有明显的提高。     

星载SAR成像参数联合估计方法

通信系统的不可靠性会造成SAR卫星下发数据出现误码或丢失,从而导致几何参数的解译、计算出现较大的误差或者缺失,限制了SAR数据成像处理及后续利用。针对该问题,提出一种基于回波数据的成像参数联合估计方法。首先通过回波数据进行多普勒中心频率估计和多普勒调频斜率估计;然后,根据SAR多普勒参数特性,建立多普勒参数与几何参数之间的超定方程组,并利用多普勒参数估计值求解方程组反演几何参数;最后,利用多普勒参数估计值和几何参数估计值完成SAR数据成像处理。实验结果表明,本文方法可以获得可靠的多普勒参数估计值和几何参数估计值,从而有效地解决像参数欠缺情况下的星载SAR成像处理问题。     

窄巷FCB估计方法改进及时变特性分析

窄巷波长相对较短,受观测数据质量和未模型化误差的影响较大,导致参考站计算的窄巷FCB估值的互差较大,窄巷FCB稳定性较差。针对窄巷FCB估值出现较大偏差的参考站,本文提出了基于抗差初值的窄巷FCB抗差估计方法,该方法取当前历元所有参考站窄巷FCB估值的中位数作为抗差初值,采用IGGⅢ方案降低了有偏差的窄巷FCB估值的权比。采用IGS全球跟踪站网的数据进行验证,改进的方法提高了窄巷FCB的精度和稳定性,采用每天估计的一组卫星端的窄巷FCB即可满足窄巷模糊度固定的精度要求。同时,采用本文改进方法估计的窄巷FCB,可以提高用户端仿动态单天解的窄巷模糊度固定成功率和定位精度。     

Comparison of Raindrop Size Distribution Estimates From X-Band and S-Band Polarimetric Observations

This letter evaluates the consistency of rainfall drop size distribution (DSD) parameters that were estimated from attenuation-corrected X-band dual-polarization (XPOL) radar measurements with estimates from a colocated S-band dual-polarization radar (S-Pol). The DSD retrieval technique uses reflectivity and differential reflectivity, and a constrained relationship to estimate the three parameters of a ldquonormalizedrdquo gamma distribution model. The more definitive S-Pol DSD parameter estimates are used as a reference to assess the performance of the corresponding XPOL estimates for different rain-path attenuation values. Results show that XPOL attenuation-corrected profiles can provide rainfall DSD estimations that are consistent to an S-band dual-polarization radar, even in cases of moderate to high rain-path attenuation.     

Least squares adjustment and collocation

Summary For the estimation of parameters in linear models best linear unbiased estimates are derived in case the parameters are random variables. If their expected values are unknown, the well known formulas of least squares adjustment are obtained. If the expected values of the parameters are known, least squares collocation, prediction and filtering are derived. Hence in case of the determination of parameters, a least squares adjustment must precede a collocation because otherwise the collocation gives biased estimates. Since the collocation can be shown to be equivalent to a special case of the least squares adjustment, the variance of unit weight can be estimated for the collocation also. This estimate gives the scale factor for the covariance matrices being used in the collocation. In addition, the methods of testing hypotheses and establishing confidence intervals for the parameters of the least squares adjustment may be applied to the collocation.