基于二维直方图的改进的PCM聚类分割方法

相对于模糊C均值算法,可能性C均值(PCM)聚类方法具有更好的抗干扰能力.提出一种基于二维直方图的改进的PCM聚类图像分割方法,该方法除了考虑图像的点灰度信息外,还考虑像素点的邻域相关信息,利用改进的PCM聚类算法得到各象素点的隶属度对图像进行分割.实验表明,该方法能够对噪声图像有效地进行分割,具有较高的鲁棒性.     

改进的基于模糊C-均值聚类的图像分割算法

目前的FCM类型的算法聚类数目的确定需要聚类原形参数的先验知识,否则算法就会产生误导.为了提高图像分割算法的抗噪性能,用K均值聚类算法简单、快速的优点对模糊C均值聚类算法进行改进.结合图像的邻域信息,对图像的直方图作均衡化处理,改善图像质量,通过自适应滤波,降低噪声对分割效果的影响.先用K均值聚类算法对图像进行分割,快速的获得较为准确的聚类中心和初次分割图像,避免了FCM算法中初始聚类中心选择不当造成的死点问题.用邻域灰度均值信息代替传统模糊C均值聚类算法中的灰度信息,对K均值聚类得到的图像作二次分割.该方法能更好的抑制噪声的干扰,提高了聚类算法的分割精确度.     

基于模糊C均值聚类能量最小化的超声图像分割

 提出了基于模糊C均值能量最小化的活动轮廓模型.该模型首先对待分割图像进行模糊C均值聚类得到前景和背景的模糊隶属度值,然后将待分割目标的局部像素信息和它的隶属度值作为活动轮廓模型的水平集函数的初始值,改进了传统的求解Euler-Lagrange方程使活动轮廓的能量极小化的模型,利用快速算法直接计算模糊C均值能量最小化驱动传统活动轮廓模型的曲线演化.将提出算法与经典的活动轮廓模型分割算法比较,对仿真和临床的超声图像分割实验结果表明：提出算法能很好地分割像素不均匀、边界模糊、含有斑点噪声的超声图像,具有较好的分割性能和较快的分割速度.     

一种改进的粘连颗粒图像分割算法

针对颗粒图像分割中产生过分割、欠分割及粘连区域存在孔洞从而导致分割不理想的情况,提出了一种改进算法.该算法在基于边界跟踪的分割算法的基础上,采用根据真实欧氏距离所提取的局部极大值点信息对分割策略进行控制,以减少过分割、欠分割的产生,同时对含有孔洞的粘连区域增加内边界跟踪处理.实验结果表明,算法获得了更好的分割效果.     

基于均值漂移的SAR图像分割方法研究

本文主要讨论了均值漂移算法在图像分割中的应用,指出均值漂移算法是一个稳定的图像分割算法,该算法具有很强的适应性.对于遭受噪声污染的图像,它的分割效果会受到很大的影响.因此针对噪声特性,提出了用滤波器来改善基于均值漂移的SAR图像分割的方法.该方法的关键是设计合适的滤波器.基于该方法进行了图像分割实验表明,该方法可以改进图像分割效果.     

结合模糊C均值聚类和边缘检测算法的彩色图像分割

图像分割是计算机视觉的最核心技术之一,是图像处理到图像分析的关键步骤.深入研究了C均值聚类分割算法,该算法已广泛应用于彩色图像分割领域,在真实彩色图像分割中,由于C均值的初始化对分割效果有很大影响,故对C均值分割算法进行改进.然后引入边缘检测算法以及RGB彩色模型,对边缘检测算子Roberts、Sobel算子和Prewitt算子进行了研究,对Sobel算子进行改进,对模糊聚类算法的分割结果进行进一步处理,通过在合成图像上及大量真实自然彩色图像上进行实验,结果证明通过C均值聚类和边缘检测算法相结合,能够有效提高分割结果的准确性.最后对彩色图像分割技术将来的发展方向进行了展望.     

基于曲率和活动轮廓模型的重叠细胞分割算法

提出了一种基于曲率和活动轮廓模型的重叠细胞分割算法,用于解决重叠细胞显微图像边界难以自动分离的问题.该算法使用Otsu算法和形态学滤波得到重叠细胞整体轮廓,并根据其曲率信息来定位细胞边界接触点,再采用活动轮廓模型分割得到重叠区域轮廓,最后结合边界接触点信息将其与整体轮廓拼接得到单个细胞轮廓.实验结果表明,算法实现了重叠细胞的分割,分割得到的细胞完整度高,且算法具有一定的鲁棒性,表明该算法用于重叠细胞的分割是可行、有效的.     

基于改进GAC模型的二值水平集前列腺超声图像自动分割算法

提出了一种基于改进测地线主动轮廓(geodesic active contour,GAC)的自动分割算法.首先通过结合径向浅浮槽和区域填充算法得到滤波后图像的大致轮廓,然后通过构造基于区域信息的符号压力函数代替边界停止函数,并且加入了基于边界梯度信息的能量项,有效地克服了弱边界的问题.该模型用二值水平集方法实现,使算法的稳定性更高,计算量大大降低.对前列腺直肠超声图像的实验结果表明:本算法迭代收敛速度快,有效避免了边界泄露问题.     

改进遗传算法优化模糊均值聚类中心的图像分割

针对传统模糊均值聚类算法存在的问题, 提出一种改进遗传算法优化模糊均值聚类中心的图像分割算法. 首先在标准遗传算法的交叉操作中引入方向因子, 使参与交叉的个体向最佳个体靠近, 加快算法的收敛速度, 并通过增强群体间的信息共享机制提高算法的全局搜索能力, 避免了早熟收敛, 改善了全局解的精度; 然后采用改进遗传算法选择模糊均值聚类算法的初始聚类中心, 实现图像分割; 最后采用仿真实验测试算法性能. 实验结果表明, 相对于传统模糊均值聚类算法及其他图像分割算法, 本文算法在分割正确率、 分割速度及鲁棒性上均更优.     

基于改进的高斯混合模型牙齿图像分割研究

针对边界模糊和对比度低的口腔CT图像中牙齿目标区域提取难的问题,提出了一种基于高斯混合模型与K-均值的改进聚类分割算法.该算法首先通过各向异性滤波对图像预处理,实现去噪平滑的同时增强图像的细节;然后利用K-均值完成初始划分,并根据分类后的像素值给出EM算法迭代的初始值,加快算法迭代到最优解,从而大大降低算法迭代次数,有效解决EM算法求解参数时随机选取初值点易导致GMM陷入局部最优解的问题,进而使分割区域完整;最后利用EM算法学习GMM,完成ML分割.实验结果表明:改进方法降低了计算复杂度,对噪声具有较强的鲁棒性,可获得更为理想的分割结果.     

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.