决策树学习方法应用于生境景观分类

遥感影像分类是进行景观生态学研究以及区域景观规划的基础工作,是获取环境资源与信息的主要手段。研究选取秦岭南坡地区100km2范围为实验区域,综合遥感影像、数字高程模型等空间数据,利用C5.0决策树学习算法从750个实地调查样点中自动提取分类知识、建立规则库并实现计算机自动景观分类;同时分析根据不同数量样点得到的决策树规则以及决策树分类精度变化的趋势。分析结果表明,在样点信息充分的条件下,利用决策树学习方法能够实现高景观分类精度;随着样点数量的增加,分类精度也随之提高,该研究中景观分类精度最高达到79.0%。     

基于C4.5算法的敏感图像检测方法

提出一种基于2次C4.5分类的敏感图像检测方法.该方法利用Daubechies小波和灰度共生矩阵提取图片的纹理信息,在HSI空间和YCbCr空间提取颜色特征,进行第1次基于C4.5算法的训练和分类;对分类生成的0,1二值空间进行特征提取,将所有特征分量融合进行基于C4.5算法和2次训练和分类.基于2次训练生成的规则进行敏感图片的检测.实验结果表明,该方法对于敏感图片分类正确率达93.3%以上,与基于颜色和纹理特征的直接检测方法相比,进一步提高了正确识别率.     

基于模糊C均值和BP神经网络的遥感影像自动分类算法

针对非监督分类算法分类精度不高、监督法分类算法的训练样本需要人工选择且容易误选的问题,提出了一种基于模糊C均值聚类(FCM)和BP神经网络相结合的遥感影像自动分类算法。首先利用FCM对影像进行初始聚类,然后根据聚类结果,由该算法自动选取其中的纯净像元作为训练样本,并送入BP网络进行学习,用最终训练得到的BP神经网络分类器对TM遥感影像进行分类,实验结果表明该算法具有较高的分类精度,能够满足大尺度地物类别判定的需要。     

面向对象的遥感影像矢量编辑系统的设计与实现

在对遥感影像进行自动分割之后,需要对分割后的数据进行编辑,以用于后期的影像分类。本文针对遥感影像分割后的边界数据,设计相应的数据结构和算法,构建了面向对象的遥感影像矢量编辑系统,重点介绍了该系统的结构及实现过程中的关键算法,包括大数据量的快速显示、撤销与重做的实现等。同时,将该系列算法封装成为组件,以API的形式供其他遥感影像分类系统使用。     

基于ENVI＋IDL断裂构造遥感影像自动解译探讨

工程地质遥感解译的重要内容之一是从遥感影像中自动提取断裂构造信息。通过对比研究现有断裂构造自动提取的方法和技术,首先对比研究了基于主成分变换和波段运算的图像处理方法在目标信息提取中的优劣;其次通过对预处理影像进行不同的滤波去噪处理;最后利用Canny运算和霍夫变换算法基于ENVI＋IDL编程实现了断裂构造信息的自动提取。通过实验验证,结果表明：基于主成分变换、LEEFILT滤波处理和霍夫变换算法可有效地提取TM影像中的断裂构造信息。     

一种基于特征选择的面向对象遥感影像分类方法

针对GF—1多空间分辨率遥感数据空间信息丰富,传统影像分类方法无法满足实际应用需要的问题,提出了一种基于特征选择的面向对象遥感影像分类方法——object-RJMC算法,即在影像分割及特征提取的基础上,运用Relief F算法和J-M(Jeffries-Matusita)距离算法去除无关及冗余特征,筛选出适于各类别分类的特征,然后利用CART算法建立分类规则,完成分类过程。以GF-1号2 m、8 m和16 m空间分辨率的三组影像进行算法验证,并与object-CART和pixel-CART影像分类方法进行对比分析。实验结果显示object-RJMC算法的分类精度均高于object-CART和pixel-CART算法的分类精度;且对高空间分辨率的影像分类效果要优于对中低空间分辨率影像的分类效果。该算法减少了特征选择及规则建立的人工干预,克服了以像素为单位的分类算法中由于缺少空间邻域信息而产生孤立、离散、不连通分类结果的问题,可有效地提高GF-1遥感影像分类精度。     

面向对象的高分辨率遥感影像变化检测方法

变化信息是遥感图像中的一类重要信息,变化信息的自动检测是遥感图像智能解译的重要研究领域.利用面向对象分类技术,对一种同一地区不同数据源的高分辨率遥感影像采用了分类后比较的变化检测方法.介绍了方法原理,建立规则以及实现过程;最后利用提出的方法对同一地区不同时相的QuickBird影像和IKONOS高分辨率遥感影像实施了变化检测实验,结果表明将基于面向对象技术的变换检测方法用于不同数据源的高分辨率遥感影像变化信息的检测是切实可行的,并具有较高的提取精度.     

基于属性相关的智能学习指导模型的设计与实现

决策树分类算法是智能指导系统实现"智能"的一种有效工具。通过对数据的分析和挖掘,能够实现对数据的精确分类。另外,对于决策树和产生式规则集的计算相对简单而且高效。提出了智能指导系统,并介绍了该系统的主要功能模块。在比较了ID3算法和C4.5算法后,结合个性化教学的需求,提出了新的基于规则属性相关的C4.5r算法。同时,给出了系统的计算评估模块。实验结果表明,新的C4.5r算法在运算时间、产生式规则集的规模及计算产生式规则的开销方面明显优于传统的C4.5算法。     

基于均值漂移的海岛(礁)岸线快速提取

为了解决海岛(礁)岸线提取的自动化问题,提高海岛(礁)岸线提取的速度与精度,提出了基于均值漂移的海岛(礁)岸线快速提取方法。首先在保证影像整体轮廓的同时构建低分辨率影像,从而缩短算法的运行时间;然后利用均值漂移技术进行高斯低通滤波处理,提高算法的抗噪性;最后通过区域增长法自动选择种子点,结合区域合并差异性度量准则实现对遥感影像的形状和颜色的识别,从而完成对海岸线的自动提取。使用该方法对海岛(礁)影像进行了海岛(礁)岸线提取实验,实验结果表明,该算法能够实现所有岛礁岸线的自动提取,相比于通过人工方式,提取时间从729s缩短为3s,极大地缩短岸线提取的时间,同时能较好地满足成图效果。     

基于自适应标注样本的高分辨率影像道路提取

针对现有道路提取算法中难以大规模人工标注样本类别标签的问题,提出了一种基于自适应标注样本提取遥感影像道路的方法。首先通过改进的模糊C均值聚类算法提取道路区域,进行初步的样本标注;然后利用基于二次投票的集成去噪算法定位标签噪声样本,更新样本数据集;然后将更新后的样本集投入随机森林训练并预测影像的分类结果;最后对道路提取结果进行多方向形态学滤波去除非道路区域,得到精确的道路提取结果。通过不同分辨率、不同场景、不同方法的实验结果表明,本文方法可以自主选择并标注样本,相比传统算法具有较高的提取精度,对于高分辨率遥感影像中直线型、曲线型道路均有较好的道路提取效果。     

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.