基于连续阈值函数的小波去噪方法

文章分析传统软、硬阈值函数在图像去噪中的缺陷,提出了一个基于连续阈值函数的小波去噪方法.采用不同阈值函数的去噪方法对图像进行去噪处理,结果表明:基于连续阈值函数的方法的去噪效果优于其他非连续阈值函数的去噪方法.     

针对医学图像的小波阈值去噪方法

为了改善小波阈值去噪算法中硬阈值和软阈值存在的不足,提出一种新的小波阈值去噪方法.该算法在进行小波阈值去噪前,先将图像分割成背景平坦区域和细节区域两部分,然后分别进行小波阈值去噪,最后融合两图像从而获得去噪图像.在分别进行小波阈值去噪时,利用迭代法进行阈值选择,采用"软、硬阈值折中"阈值函数.根据对医学图像去噪的仿真实验结果表明,该算法在去噪效果上均优于传统的软硬阈值方法.     

基于改进阈值的小波包图像去噪方法研究

介绍了小波包分解重构的算法及小波阈值消噪的基本原理,并针对软、硬阈值化方法存在的不足,构造了一个新的阈值化函数,该函数采用两个调节参量α和β,通过调整这两个参数,以获得较优的小波系数的阈值估计.经仿真实验表明,新的小波包阈值化方法能对含噪图像进行有效去噪,且较好地克服了原来软、硬阈值存在的振荡和边界模糊等缺陷.统计结果表明,其性能明显优于原有的软、硬阈值化方法,消噪效果较好.图2,表1,参11.     

基于小波阈值收缩的图像降噪

采用双正交小波,利用VisuShrink阈值和BayesShrink阈值,分别通过硬阈值函数和软阈值函数对混入高斯白噪声的图像进行去噪实验.结果表明,硬VisuShrink阈值的降噪效果好于软VisuShrink阈值,软BayesShrink阈值的降噪效果好于硬BayesShrink阈值,并且BayesShrink阈值只有在软阈值函数下才能取得很好的降噪效果.     

基于提升小波变换的心音去噪新方法

针对传统的小波阈值函数去噪无法有效滤除信号中的特定噪声,结合软、硬阈值函数的优点,提出了一种基于提升小波新阈值函数算法对心音信号进行去噪.首先利用提升小波变换对心音信号进行分解;然后利用新阈值函数更新其小波系数进行重构;最后与提升小波软、硬阈值函数去噪后的心音进行了希尔伯特包络提取验证其去噪效果.实验结果表明,提出的提升小波去噪新方法较软、硬阈值方法有更好的滤波效果,且提取的曲线包络更加清晰、平滑.     

一种改进的小波阈值去噪算法

在对软阈值和硬阈值去噪方法分析的基础上,提出一种改进的阈值函数,并且对阈值做了适当的调整,克服软阈值和硬阈值去噪方法的缺点.Matlab仿真结果表明,提出的改进算法在信噪比增益和最小均方差方面均优于软阈值和硬阈值去噪方法.该改进方案具有更大的有效性和优越性.     

改进阈值函数在图像去噪中的应用研究

针对传统阈值函数在图像去噪中存在的缺点和阈值选取的不确定性,为进一步研究小波去噪处理算法,提出了一种新的改进阈值函数的去噪算法,分别对Circuit、Eight、Road 3幅图像采用传统的硬阈值、软阈值、半软阈值方法和文中方法进行Matlab仿真实验。对比分析,文中方法既获得了较好的视觉效果和更高的峰值信噪比,又克服了软阈值信号失真和硬阈值信号不连续、振荡等缺点,且能够在消噪和保留原有信号的弱特征之间获得较好的平衡,明显地改进了传统硬、软阈值函数去噪算法存在的诸多不足,在实际应用中更为有效。     

基于小波变换的一种图像增强去噪算法

利用小波变换的自适应特征,将小波的多分辨理论应用于图像的去噪、增强处理中,针对传统的阈值去噪和子带增强的缺点,提出了一种改进的自适应图像去噪增强算法.该算法对图像的噪音进行了估计,采用软阈值和硬阈值相结合的处理方法,利用3次B样条插值函数的特性,设计一个平滑的过渡区,有效地避免了单独使用软阈值或硬阈值处理的缺点,保证了图像达到比较好的去噪效果;同时引入的增益因子,可以自适应地补充图像的弱信息.     

改进小波阈值图像去噪算法

图像去噪问题一直是图像处理领域关注的问题之一。在图像去噪过程中,由于软阈值函数获得的去噪估计系数与原小波系数具有的恒定差,进而影响了重建图像的质量。为了有效地解决这一问题,在软阈值函数的基础上,本文提出了一种新的阈值函数用于图像的去噪重建。同时,新提出的阈值函数也有效地解决了硬阈值函数的不连续性问题。为了增加新阈值函数的灵活性,新阈值函数中添加了两个调节因子。实验结果表明,本文的阈值函数优于经典的软、硬阈值函数,有效地解决了软、硬阈值函数存在的缺陷,获得的重建图像质量和峰值信噪比有显著提高。     

基于小波收缩的神经网络图像“去噪”算法研究

提出一种基于小波收缩的神经网络图像“去噪”的新方法。此算法引入了一种新的小波收缩函数（3次样条曲线）对小波系数进行处理。由于此算法中的小波收缩函数具有较好的光滑特性,它克服了小波收缩中硬阈值和软阈值方法所带来的缺点,并且神经网络模型实现此算法。实验表明：此算法比用传统的硬阈值和软阈值方法图像“去噪”有更好的峰值信噪比且具有比传统算法更好的学习特性。     

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…     

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.     

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

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

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.