一种基于数学形态学的遥感图像边缘检测算法

为有效提取边缘密度大的遥感图像中的边缘信息，提出了一种利用灰度形态变换原理进行检测的 有效算法，首先利用开-闭形态滤波器降低输入图像的噪声，然后将二值图像的边缘提取算法推广到灰度 图像中加以应用。实验结果证明，此方法优于灰度形态梯度法+同时也优于Canny算子。     

一种基于数学形态学的遥感图像边缘检测算法

为有效提取边缘密度大的遥感图像中的边缘信息，提出了一种利用灰度形态变换原理进行检测的有效算法，首先利用开-闭形态滤波器降低输入图像的噪声，然后将二值图像的边缘提取算法推广到灰度图像中加以应用。实验结果证明，此方法优于灰度形态梯度法。同时也优于Canny算子。     

基于空间形态特征遥感边缘信息的提取方法

边缘信息是地物间波谱差异的反映.仅仅考虑灰度差异并不能满足专题信息-地物边缘提取的需要.加入地物的空间形态特征依据,可以使边缘信息提取更准确.在灰值形态学梯度算法和多方位形态结构元素形态学理论分析基础上,提出了提取遥感图像边缘信息的新方法.叙述了结构元素的设计和边缘提取过程,给出了应用实例并得到良好的视觉效果.     

基于数学形态学滤波的灰度图像边缘检测

针对灰度图像边缘检测,提出组合二值形态滤波结合边缘检测算子的新算法。该算法通过阈值分解把灰度图像形态学滤波问题转换为对二值图像形态学滤波,具有简便且适合逻辑电路实现等优点。仿真结果表明,选取适当的结构元素,该算法能够有效消除椒盐噪声、保留图像边缘。     

基于数学形态学的图像边缘检测

讨论了图像数学形态学的基本原理及形态学在灰度图像边缘检测中的应用，并成功构造了一种新型形态边缘检测算法，该算法具有较好的抗噪和边缘提取能力．对一幅加有椒盐噪声的灰度图像的仿真试验结果表明，该方法比传统的基于模板的图像边缘检测算法和形态学常用边缘检测算法具有更好的图像边缘提取效果．     

基于图像掩模和击中击不中变换的优化边缘提取算法

为了解决传统Sobel算法在边缘提取时存在的定位不准确、边缘线条较粗、细节缺失的问题,提出了一种改进算法。首先使用增加方向模板后的Sobel算子对图像进行卷积,再对梯度图像进行边缘检测得到双线条图像,并以此作为掩膜来消除原梯度图中的伪边缘,从而对边缘线宽进行细化,然后使用Otsu算法将图像进行二值分割,最后通过数学形态中基于击中击不中变换的细化对图像进行全局处理来消除图像纹理干扰点。实验表明,与传统的边缘提取算法相比,改进后的算法定位准确,边缘较细,并保持了原图像的细节。     

一种不受光照和阴影影响的图像边缘检测方法

对于灰度图像和使用越来越多的彩色图像,已有的算法中存在着边缘检测效果不理想、计算复杂以及对光照或阴影的敏感等问题.针对于此,提出用主成分分析算法对灰度图像进行边缘提取;对于彩色图像,提出先用独立成分分析算法得出一幅具有全局特性的灰度图,再利用主要成分分析算法进行边缘特征提取.检测实验结果显示边缘特征清晰,计算简单,且不受光照和阴影的影响.     

基于边缘方向和梯度的图像特征匹配算法

主动形状模型(Active shape model,ASM)是一种基于统计参数化的图像特征匹配算法,它主要应用于提取图像的特征点.在分析传统方法不足的基础上,提出一种基于改进主动形状模型的图像特征匹配新算法.传统的ASM直接采样灰度值信息建立局部纹理模型,灰度值对光照、姿态等因素是非常敏感的,常会带来较大匹配误差或者导致模型匹配失败.采用基于每个像素的边缘方向和强度来代替灰度值,改进的表示方法是利用边缘方向和强度的信息去建模,并且加入了边缘结构的方向和强度.改进的表示方法增加了纹理表示的边缘特征,边缘特征能有效地让模型收敛到图像的外轮廓,当外轮廓精准匹配后可以有效抑制和促进图像内部特征点定位更加准确.实验结果表明,改进的方法可以有效提高模型的匹配精度.     

柔性形态边缘检测算法在菌类显微图像中的应用

在灰度图像的柔性形态学概念及特性的基础上,根据菌类显微图像的边缘特点,提出了均衡化的柔性形态边缘检测方法.以霉菌图像为例,通过实验结果和传统的canny算子、LOG算子边缘提取结果进行对比,证明了算法的有效性,为菌类识别打下了良好的基础.     

染色体条纹提取算法研究及应用

提出一种基于灰度阈值的染色体条纹提取方法.利用染色体内部的灰度差异,采用改进的Bernsen算法求取局部阈值;通过迭代二分算法进行染色体区域标定,划分图像的灰度等级,锐化图像;利用锐化图像的灰度直方图提取有效灰度段,获得准确的染色体条纹.最后,应用本文的算法对200张染色体样本图进行测试,试验证明本文算法所提取的条纹清晰准确、噪声干扰小,对染色体的分离算法研究有一定的指导意义.     

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.     

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.     

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).     

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.