基于遥感数据的山西东部油松林蓄积量估测方法研究

为了探讨油松林遥感估测模型的精度和适用性,以山西省晋东土石山立地亚区的170个油松样地作为研究对象,获取研究区的SPOT影像和DEM(Digital Elevation Model,数字高程模型)数据,提取170个样地的遥感波段信息和地形信息,结合地面调查数据,分别采用多元逐步回归模型、偏最小二乘回归模型和神经网络模型,建立油松林蓄积量的遥感估测方法,并进行精度验证。结果表明:1)基于遥感影像和DEM影像估测油松林蓄积量是可行的,三种方法都取得了满意的结果;2)三种方法相比,神经网络模型对油松林蓄积量估算的精度为82.13%,多元逐步回归模型的精度为76.73%,偏最小二乘回归模型的精度为77.09%,神经网络模型的估测精度更高。     

内蒙古草地放牧强度遥感估测

以内蒙古草地为研究区, 应用MODIS-NDVI数据, 结合地面野外调查以及统计数据, 建立载蓄量估算模型, 并对2012年放牧强度进行估测。结果表明: 草地的载畜量和相邻两旬的NDVI差值显著正相关。通过两个旬度的NDVI差值与载畜量之间的回归分析, 建立载蓄量估算模型为: Y = 4.203(X_i - X_j) + 956.572; 内蒙古各草地类型的放牧强度都呈现自西向东逐渐减少的趋势, 放牧强度表现为草甸草原<典型草原<荒漠草原。利用遥感影像得到的放牧强度估测结果, 经过地面的野外实验数据验证, 精度可达70.7%。     

基于移动二维激光扫描的单木三维绿量测定

【目的】单木三维绿量的有效测定为森林资源调查、森林生态环境效益评价、林业精准管理提供有用信息,对现代林业发展具有重要意义。为提高单木三维绿量测量效率与测量精度,提出一种基于移动二维激光扫描的低成本单木三维绿量测定方法。【方法】采用二维激光扫描仪对单木进行多角度直线扫描,获取树冠三维形貌信息;融合不同角度的采集数据,建立激光扫描线的向量参数方程;建立树冠体素模型,将待测空间离散化为体素,体素尺寸与扫描系统分辨率一致,以未被扫描线穿透的体素集合表达树冠体积,求取单木三维绿量。【结果】实验选取6株单木,体素分辨率为0.022 m,6株单木三维绿量平均测算时间为105.94 s,平均帧处理时间为0.039s。【结论】基于移动二维激光扫描的单木三维绿量测定,无需人工筛选点云,可自动处理数据,测量效率高,改进后的体素模型充分利用测量数据,能真实反映树冠内部体积及空隙。     

结合树冠体积的油茶树高与产量估测研究

【目的】以长沙县明月村油茶林基地为研究区,探讨利用无人机倾斜摄影提取树冠体积进行油茶树高和产量估测的可行性。【方法】基于无人机正射影像和密集匹配点云,提取波段反射率、植被指数、纹理因子、高度特征等遥感变量和冠幅等冠层参数,同时利用克里金法、反距离权重法、自然邻近点法和过滤三角网法分别获取油茶树冠体积,建立多元线性回归、随机森林、K最邻近模型估测油茶树高和产量,并以地面三维激光点云获取的树冠体积、样地实测树高和产量作为实测值分别对估测结果进行精度评价。【结果】过滤三角网是获取油茶树冠体积最有效的方法,其平均相对误差(31.54%)优于反距离权重法(36.73%)、克里金法(37.04%)和自然邻近点法(38.54%)。将树冠体积作为特征变量参与建模后,树高和产量的多元线性回归、随机森林、K最邻近模型的精度均有所提升(树高相对均方根误差分别减小了3.77%、0.78%、0.64%,产量相对均方根误差分别减小了1.32%、0.34%、0.16%)。对比3种估测模型,随机森林模型的决定系数均优于多元线性回归和K最邻近(树高决定系数分别为0.78、0.51和0.19,产量决定系数分别为0.61、0.48和0.24)。研究发现,分别使用估测树高和实测树高参与产量建模的精度无明显差异。【结论】结合树冠体积和树高参与建模可有效提高油茶产量估测精度,研究结果可为区域范围内利用无人机遥感技术开展油茶树高和产量调查提供参考。     

基于BP神经网络的森林可燃物负荷量估测

森林可燃物负荷量是决定林火行为的一个重要因子,因此,森林可燃物负荷量估测对于森林防火管理具有重要意义。该文利用BP神经网络方法和多元回归方法对大兴安岭地区落叶松林32块森林样地数据构建森林可燃物负荷量预测模型,用以研究利用林龄、郁闭度、平均高、胸径等林分因子估测该地区森林可燃物负荷量的方法。通过MATLAB软件实现BP神经网络森林可燃物负荷量估测模型;通过SPSS软件建立多元回归森林可燃物负荷量估测模型。BP神经网络森林可燃物负荷量估测模型拟合精度为99.9%、外推精度为65.51%;多元回归可燃物负荷量估测模型拟合精度为68.29%、外推精度为62.1%。通过比较分析,得出结论:利用BP神经网络方法估测森林可燃物负荷量是可行的;BP神经网络模型精度高于多元回归模型;由于训练样本太少,2种模型外推精度低于70%。     

基于无人机遥感的绿化园林三维绿量估算与分析——以福州大学校区为例

三维绿量能够从立体空间上描述城市绿地的空间分布和定量评价城市绿化的环境效益。本文以福州大学为研究区，探讨了利用可见光无人机影像估算绿化树木三维绿量的方法，并对校园生态效益进行定量分析。首先获取高于10cm分辨率的无人机可见光遥感影像；其次结合可见光波段的光谱特征与无人机数据点云的高程特征获得研究区的冠层高度模型；然后通过局部最大值算法与标记控制分水岭算法提取单木树高、株数以及冠径参数，通过野外实测数据构建“树高-冠高”关系模型得到冠高；最后结合树种分布情况，按照不同的树冠形状构建三维绿量估算模型，并基于三维绿量估算校园不同树种的生态效益。结果表明：研究区内三维绿量总量达到了804405m3，其中休闲区的三维绿量总量为428566m3，占总绿量的53.3%，而科技园区的三维绿量总量为26568m3，仅占总绿量的3.3%；而常见树种中，三维绿量贡献最大的为榕树，达到404405m3，占三维绿量总量的50.3%，而丹桂贡献的三维绿量仅为509m3，占总绿量的0.063%。研究认为：基于无人机遥感数据，能够较好的估算出研究区内绿化树木的三维绿量。     

基于多源数据的甘南草地植被覆盖度遥感监测研究

选取甘南藏族自治州为研究区域,以2016-2017年野外实测样方盖度数据和无人机照片提取的草地植被覆盖度数据为基础,对基于像元二分模型计算的草地植被覆盖度进行精度校正,分析并探讨无人机用于野外草地植被覆盖度调查的可行性,构建基于不同遥感数据源草地植被覆盖度的回归模型,并对模型进行精度评价.结果表明,利用无人机在草地上空一定距离(25 m)获取的照片可以多时相匹配Landsat 8等中分辨率遥感影像,动态监测野外大面积草地植被覆盖度;乘幂模型对以像元二分法计算的陆地卫星-8陆地成像仪(Landsat 8 OLI)产品的草地植被覆盖度校正效果最佳,模型的估测精度高达93.60%,在进行空间小尺度研究时模型计算精度最高;对数模型对以二分法计算的MOD13Q1产品的草地植被覆盖度校正效果最佳,模型的估测精度为91.97%;用中分辨率遥感数据Landsat 8 OLI校正低分辨率MODIS模型,修正后的模型R2=0.64,比原始的中分辨率成像光谱仪(MODIS)估测模型(R2=0.23)明显提高,在进行空间大尺度研究时该模型更适应.     

影像采集参数对无人机遥感估测树高精度的影响

以福州大学旗山校区为研究区,采集不同地面分辨率/航向/旁向重叠率无人机影像（5 cm/90%/80%、10 cm/90%/80%、5 cm/65%/60%）,并实测树高及冠幅. 无人机影像经处理生成正射影像和三维点云;然后评价数字高程模型(DEM）的精度,并采用基于点云的局部最大值法提取树高;最后比较不同影像重叠率及地面分辨率下的树高估测精度. 实验结果表明： 较小的地面分辨率及较大的重叠率下的采集参数不仅生成的点云密度较高,重建更为完整,单木检测的F测度及树高估测精度更高,尤其是对于高度和冠幅较小的梧桐,而当林下无灌木丛时有助于减小DEM误差.     

基于无人机与机器学习的黄河源高寒草地植被覆盖度反演技术

针对高原高寒地区大面积草地植被覆盖度调查与实验过程中地面测量效率低下,遥感数据质量不佳、数量源受限与反演结果不确定等问题,在黄河源地区利用低空无人机(unmanned aerial vehicle, UAV)遥感技术、统计建模与机器学习方法,开展基于可见光影像的高寒草地植被覆盖度反演与验证。结果表明:基于可见光构建的过绿指数与植被覆盖度的相关系数达0.676,比归一化差异指数高出近5.2%,具有较高的可靠性;利用过绿指数建立的高寒草地植被覆盖度统计模型中,对数模型和Gamma模型精度较高,但具有显著的地域差异性;直接利用低空无人机遥感波段值建立的机器学习模型精度显著优于各个统计模型,获得的均方根误差、估算精度、相对偏差和决定系数比统计模型中表现最优的对数模型分别提高2.68%、3.75%、7.35%和13.91%,且无需计算植被指数,在成本、效率和精度等方面具有较大的优势。     

基于RS、GIS及k-近邻法的森林蓄积量估测

为了解决利用空间技术(RS、GIS)以及数量化方法进行森林蓄积估测预报精度较低或是应用范围有限等问题,提出了一种新的森林蓄积估测方法以提高估测精度,即基于遥感(RS)及地理信息系统(GIS)技术提取光谱信息及地形信息作为估测的自变量,利用k-近邻法进行估测.通过在白河林业局调查取样,进行实例分析,方法精度达到90%以上.最后对于使用该方法应该注意的条件及问题进行了说明.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.