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.     

InSAR相位解缠算法的比较

相位解缠作为合成孔径雷达干涉测量(InSAR,Interferometric Synthetic Aperture Radar)中一个关键的步骤,为获取地形高程提供了基础。相位解缠的质量将直接影响着DEM生成的质量。对现有的几类算法进行实验分析,并对解缠结果的质量进行比较,分析其精确性。结果表明:统计耗费网络流算法具有较好的解缠连续性以及较高的精度,可以获得一个较优的全局解。     

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

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

一种快速二维 Delaunay 三角网点定位算法

在构建二维Delaunay三角网的逐点插入法中,定位待插点所在三角形的快慢是影响整个算法构网速度的关键因素。针对目前已有算法存在的搜索路径长、搜索路径求解计算量大等问题,结合三角形重心的几何性质,对点定位算法进行改进,避免求三角形重心和相交边的过程。实验结果表明,文中算法较目前其他点定位算法能够有效地缩短搜索路径,减少点定位的计算时间,提高Delaunay三角网构网过程中点定位的效率。     

An efficient application of fusion approach for hot spot detection with MODIS and PALSAR-1 data

Hot spot detection with satellite images, especially with synthetic aperture radar (SAR) images is still a challenging task. Several researchers have used TM/optical data for identification of hot spot but the use of SAR data is very limited for this type of application. The fusion of SAR data with TM/optical data may add additional information which in turn will lead for enhancement of detection capability of the hot spot. Therefore, this study explores the possibility of fusion of Moderate Resolution Imaging Spectroradiometer (MODIS) and Phased Array L-band Synthetic Aperture Radar (PALSAR) satellite images for the hot spot detection. Image fusion is emerging as a powerful tool where information of various sensors can be used for obtaining better results. For this purpose, vegetation greenness and roughness information which is obtained from MODIS and PALSAR satellite images, respectively, are used for fusion, and then, a contextual-based thresholding algorithm is applied to the fused image for hot spot detection. The proposed approach comprises of two steps: (1) application of genetic algorithm-based scheme for image fusion of MODIS and PALSAR satellite images, and (2) classification of the fused image as either hot spot or non-hot spot pixels by employing a contextual thresholding technique. The algorithm is tested over the Jharia Coal Field region of India, where hot spot is one of the major problems and it is observed that the proposed thresholding technique classifies the each pixel of the fused image into two categories: hot spot and non-hot spot and the proposed approach detects the hot spot with better accuracy and less false alarm.     

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.     

Tessellations in GIS: Part II–making changes

Abstract

We attempt to describe the role of tessellated models of space within the discipline of Geographic Information Systems (GIS) – a speciality coming largely out of Geography and Land Surveying, where there was a strong need to represent information about the land’s surface within a computer system rather than on the original paper maps. We look at some of the basic operations in GIS, including dynamic and kinetic applications. We examine issues of topology and data structures, and produced a tessellation model that may be widely applied both to traditional “object” and “field” data types. The Part I of this study examined object and field spatial models, the Voronoi extension of objects, and the graphs that express the resulting adjacencies. The required data structures were also briefly described, along with 2D and 3D structures and hierarchical indexing. The importance of graph duality was emphasized. Here, this second paper builds on the structures described in the first, and examines how these may be modified: change may often be associated with either viewpoint or time. Incremental algorithms permit additional point insertion, and applications involving the addition of skeleton points, for map scanning, contour enrichment or watershed delineation and simulation. Dynamic algorithms permit skeleton smoothing, and higher order Voronoi diagram applications, including Sibson interpolation. Kinetic algorithms allow collision detection applications, free-Lagrange flow modeling, and pen movement simulation for map drawing. If desired these methods may be extended to 3D. Based on this framework, it can be argued that tessellation models are fundamental to our understanding and processing of geographical space, and provide a coherent framework for understanding the “space” in which we exist.     

建筑物立面分类与DIM点云滤波

针对目前基于近景摄影测量方法构建建筑物立面模型过程中因密集影像匹配(DIM)点云噪声所引起的建筑物立面TIN网格模型畸变问题,本文借鉴机器学习中样本学习的思想,对建筑物立面进行了分类并对DIM点云提出了相应的滤波方法,以达到去除DIM点云噪声和改善其TIN网格模型畸变的目的.其中,针对平面结构立面,采取先对点云样本进行...     

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

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

PEIV模型参数估计新算法

PEIV(Partial Errors-In-Variables)模型是EIV模型的扩展,它能解决系数矩阵含有非随机元素或存在结构特性的问题。针对常规PEIV模型算法的复杂性,提出了一种PEIV模型参数估计的新算法。该算法将系数矩阵含误差的元素看成是一类观测值,与平差模型原观测值构成两类观测值,将PEIV平差模型表示为类似于传统的最小二乘间接平差模型,再通过非线性最小二乘平差理论,推导出了算法的迭代公式和精度评定公式。算法迭代格式与间接平差类似,通过算例验证了算法的可行性和正确性。