Re-parameterization of a quasi-analytical algorithm for colored dissolved organic matter dominant inland waters

Quasi-Analytical Algorithms (QAAs) are based on radiative transfer equations and have been used to derive inherent optical properties (IOPs) from the above surface remote sensing reflectance (R_rs) in aquatic systems in which phytoplankton is the dominant optically active constituents (OACs). However, Colored Dissolved Organic Matter (CDOM) and Non Algal Particles (NAP) can also be dominant OACs in water bodies and till now a QAA has not been parametrized for these aquatic systems. In this study, we compared the performance of three widely used QAAs in two CDOM dominated aquatic systems which were unsuccessful in retrieving the spectral shape of IOPS and produced minimum errors of 350% for the total absorption coefficient (a), 39% for colored dissolved matter absorption coefficient (a_CDM) and 7566.33% for phytoplankton absorption coefficient (a_phy). We re-parameterized a QAA for CDOM dominated (hereafter QAA_CDOM) waters which was able to not only achieve the spectral shape of the OACs absorption coefficients but also brought the error magnitude to a reasonable level. The average errors found for the 400–750 nm range were 30.71 and 14.51 for a, 14.89 and 8.95 for a_CDM and 25.90 and 29.76 for a_phy in Funil and Itumbiara Reservoirs, Brazil respectively. Although QAA_CDOM showed significant promise for retrieving IOPs in CDOM dominated waters, results indicated further tuning is needed in the estimation of a(λ) and a_phy(λ). Successful retrieval of the absorption coefficients by QAA_CDOM would be very useful in monitoring the spatio-temporal variability of IOPS in CDOM dominated waters.     

顾及拓扑一致性的水系三维曲线化简

鉴于常规曲线化简方法应用于水系曲线化简时难以顾及水系要素的三维特征及其拓扑关系,本文提出了一种顾及拓扑一致性的水系三维曲线化简方法。该方法首先对D-P算法进行三维扩展,实现水系中单条河流三维曲线化简,然后构建水系树结构表达其拓扑关系,最后按照水系树的层次顺序依次进行河流曲线化简和干流与支流的拓扑关系重构。试验结果表明,该方法化简精度高,既能保持水系的三维形态特征,又能保证河流交汇处的拓扑一致性。     

Grid pattern recognition in road networks using the C4.5 algorithm

Pattern recognition in road networks can be used for different applications, including spatiotemporal data mining, automated map generalization, data matching of different levels of detail, and other important research topics. Grid patterns are a common pattern type. This paper proposes and implements a method for grid pattern recognition based on the idea of mesh classification through a supervised learning process. To train the classifier, training datasets are selected from worldwide city samples with different cultural, historical, and geographical environments. Meshes are subsequently labeled as composing or noncomposing grids by participants in an experiment, and the mesh measures are defined while accounting for the mesh’s individual characteristics and spatial context. The classifier is generated using the C4.5 algorithm. The accuracy of the classifier is evaluated using Kappa statistics and the overall rate of correctness. The average Kappa value is approximately 0.74, which corresponds to a total accuracy of 87.5%. Additionally, the rationality of the classifier is evaluated in an interpretation step. Two other existing grid pattern recognition methods were also tested on the datasets, and comparison results indicate that our approach is effective in identifying grid patterns in road networks.     

强跟踪抗差自适应滤波算法及其在无人机导航定位中的应用

针对Sage-Husa自适应滤波算法在无人机导航定位应用中存在滤波发散和定位精度低的问题,本文提出一种强跟踪抗差自适应滤波算法.该算法在Sage-Husa自适应滤波算法基础上,引入强跟踪技术,通过自适应渐消因子降低历史数据对当前滤波的影响,从而抑制滤波发散,增强算法的稳健性;结合量测噪声和系统噪声进行实时估计,并且在估...     

多匹配策略融合的无人机影像匹配方法

针对AKAZE算法在无人机影像匹配过程中存在的匹配精度低和稳定性较差问题,本文提出一种基于多匹配策略融合的改进影像匹配方法。该方法首先对影像降采样并利用AKAZE算法检测多尺度特征。然后采用一种稳定的RootSIFT描述符进行特征描述。其次,融合最近邻距离比值、双向匹配和余弦相似度约束匹配策略进行特征匹配以降低误匹配率。最后,采用随机抽样一致性(RANSAC)算法确定最终的特征对应关系,并求得几何变换模型。实验结果表明,该方法在获得更多正确匹配点对的同时具有较高的匹配正确率和精度,能够更好适用于无人机影像匹配。     

基于车载激光点云的高精地图矢量化成图

针对车载激光点云中对各特征物提取结果后矢量化成图时的自动化问题,本文基于双方向积分法实现了边缘检测及矢量化成图,旨在保证特征物基本特征的同时,也保证点云的绝对精度。将输入的特征点云进行离群点过滤,以保证外包框算法特征点云的准确度;将三维点云按照外包框算法投影至最优平面,为后续沿各方向积分提供输入;利用八邻域KD-tree算法求出样本特征点云的均值邻域半径,依据邻域半径对各方向积分提供积分域中的微分元;根据提供的微分元沿各方向进行积分,在该积分元内找到距平面最值的最优解;按照积分结果构建点云索引,并根据点云特征构建模型,最终得到高精地图的矢量化点云。试验证明了该方法在处理实际问题时的可行性。     

BPSA混合策略在GPS高程拟合中的应用

针对误差反向传播(BP)算法训练速度慢和易于陷入局部最小值的缺点,利用BP算法监督学习特点,模拟退火算法(SA)在局部极小处的概率突变性,有效结合BP和SA算法,提出一种BPSA混合学习策略。将其应用于GPS高程拟合,并以实例验证了该算法的有效性。     

基于A*算法的路网数据组织

路网的数据组织是路径规划算法设计的基础。采用C++标准模板库实现基于A*算法的路网数据组织,着重从路网的拓扑结构、空间索引、A*算法数据结构、分层和分网格组织几方面来讨论。最后给出实例证明其有效性。     

一种拓扑保持的折线简化算法研究

通过分析Douglas-Peucker折线简化算法之不足,提出了一种基于二叉树数据结构的折线简化算法,解决了传统算法的自相交问题。对于GIS数据简化压缩及制图综合具有很高的实用价值。     

矢量电子地图的线目标在线简化

为了适应实时GIS的变比例尺显示与网络GIS的快速矢量数据传输,提出了数字地图的在线综合概念,讨论了对线目标的在线简化算法。提出的两个在线简化算法都是对DP简化算法进行改造,使算法对时间的复杂度从θ(n)~θ(n²)的乘法运算改进为θ(1)~θ(n)的赋值运算,并讨论了减少算法所涉及的空间复杂度的可能性。