基于小波变换与FCM的甲骨文字图像分割

针对传统FCM(模糊C均值)聚类算法及改进算法无法对背景有大片点状、片状斑纹以及字迹模糊的甲骨文字图像进行有效分割的情况,提出了一种基于二进小波变换与FCM聚类算法的甲骨文字图像分割算法.首先,采用二进小波变换模极大值点对甲骨文字图像进行边缘检测;然后,充分利用二进小波变换模极大值中的边缘信息,从而进一步修改FCM聚类算法中的隶属度函数.将实验结果与传统的FCM聚类算法及改进算法进行比较,证明了该算法能更有效地分割甲骨文字图像,具有更高的正确分割率.     

一种基于模糊聚类的小波图像压缩方法

基于小波变换的图像压缩算法在比特率较低时会出现重构图像边缘模糊现象．在充分考虑高频子带小波系数的分布特性对保存边缘、纹理等信息的影响之后，提出了一种新的基于势函数模糊聚类的方法来解决重构图像边缘模糊问题，实验结果显示：这种方法能较好地保存图像边缘和纹理信息，有效地减少边缘模糊现象和改善重构图像的主观质量．     

基于SAR图像滤波的小波模糊聚类算法

针对合成孔径雷达(SAR:Synthetic Aperture Radar)图像固有的相干斑噪声,提出了基于小波模糊聚类算法的去噪方法.该方法把信号和噪声的小波系数的分割看为一个两类模式分类问题.通过将小波系数幅值和高频子图像中的边缘信息作为聚类特征进行噪声系数分离,实现了精确分离小波系数,滤除相干斑噪声的目的.该算法不需要选择阈值和了解噪声的先验知识,有较强的数据自组织能力.实验结果表明,二维聚类滤波的信噪比提高了近8%,图像显示效果也得到了明显改善.     

基于多尺度小波变换的图像边缘检测

图像边缘是图像中的重要信息,为了检测图像中的边缘信息,提出了一种基于多尺度小波变换的图像边缘检测算法．该算法充分利用了图像边缘在多尺度下的信息,首先选用二次B样条小波对原始图像进行多尺度小波分解,提取出图像中的高频信息,包括真实的图像边缘和噪声,然后根据图像边缘和噪声在不同尺度下具有不同的传递性,抑制噪声分量,保留图像边缘分量．实验结果表明,该算法获得了较好的图像边缘检测效果．     

基于改进二进制小波变换的图像边缘检测算法

针对传统二进制小波变换在图像边缘检测应用中的不足，提出了基于改进二进制小波变换的图像边缘检测算法．该算法首先按水平、垂直和对角方向对图像进行改进的多尺度二进制小波变换，提取三个方向的小波系数，然后采用相邻尺度小波系数相乘的方法去除图像的噪声．再对去噪后的小波系数乘积极大值点进行检测，最后将这3个方向上的极大点进行融合，形成图像的边缘．     

小波变换在图像分割中的应用研究

在讨论基于小波变换的阈值分割算法的同时,提出了Canny算子和小波变换的边缘信息融合的图像分割方法,以及利用小波变换对图像纹理进行分解、特征提取,然后利用模糊C-均值聚类(FCM)进行纹理分割的方法;探讨了各种分割方法的特点、应用范围、及图像分割技术的发展方向.     

基于NSCT和KFCM聚类的图像边缘检测方法

为进一步提高现有图像边缘检测方法的性能,提出了一种基于非下采样Contourlet变换(NSCT)和核模糊c-均值(KFCM)聚类的图像边缘检测方法.首先通过NSCT将原始图像分解成低频分量和高频分量;然后对含噪声较少的低频分量提取边缘信息,并采用KFCM聚类算法进行聚类得到低频边缘图像,以提高定位精度,而对于边缘细节信息较多的高频分量各个子带,通过模极大值检测边缘以减少伪边缘,丰富图像细节;最后对低频和高频图像边缘进行融合得到完整的边缘.实验结果表明,相比于Canny方法、边缘检测算子与模糊聚类结合的方法、边缘信息与混沌粒子群优化的模糊聚类结合的方法、NSCT域模极大值方法,文中方法具有更好的边缘检测效果,边缘定位准确、完整、连续、细节丰富.     

基于轮廓波变换的模糊聚类图像分割

提出基于轮廓波变换的模糊聚类图像分割算法,从变换域的角度提高传统聚类算法的抗噪声能力.首先用轮廓波变换对含噪声图像消嗓,然后再进行聚类图像分割.实验结果表明:新算法能够获得较好的图像分割效果和质量.     

基于聚类的建筑物直线特征提取算法

建筑物图像中提取直线是视觉导航、特征识别等很多应用中的关键步骤。针对建筑物图像。提出了一种新的基于聚类的直线提取算法。该算法在Canny边缘的基础上,使用一个聚类算法将边缘分类,减少了因噪声形成的小短线对直线检测的误检或漏检现象;对于每一个分类使用直线识别准则,进一步剔除图像聚类中的伪直线;最后使用改进的Hough变换（standardHoughtransform）将直线提取出来。克服了传统Hough变换执行速度慢的缺陷。实验结果表明,文章提出的算法具有较快的运算速度,较高的直线提取准确性．较低的漏检和误检情况。其性能优于传统的Hough．变换和相位编组法。     

基于谱聚类的边缘检测算法

区分高频噪声点和边缘点是提取噪声图像边缘的难点之一,为了得到噪声图像的清晰边缘,提出一种基于谱聚类(spectral curvature clustering,SCC)的边缘检测算法.该方法通过将边缘检测问题转化为分类问题,利用图像边缘点、平滑点和噪声点位于不同子空间的性质,在有效地聚类平滑点和边缘点的同时,SCC能够较好地抑制噪声点.另外,该算法通过编辑聚类标签并将其转换为二值图像,对二值化图像进行简单的处理即可得到图像的边缘,成功地避免了传统算法中的阈值选择问题.相比于传统的边缘检测方法,实验结果证明了所提算法的有效性.     

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.