基于双正交小波的快速矢量量化算法

提出了一种用于图象压缩的矢量量化算法．该算法通过构造符合图象小波变换系数特征的跨频带矢量,利用小波系数之间的相关性,提高了图象的编码效率和重构质量．同时,该算法又采用了两种新的矢量量化技术——非线性插补矢量量化（ＮＬＩＶＱ）和渐进构造聚类（ＰＣＣ）,提高了矢量量化的速度和码书质量．实验结果证明,该算法在比特率为０．１７２ｂｐｐ的条件下仍能获得ＰＳＮＲ＞３４ｄＢ的高质量重构图象．研究图象小波变换系数的固有特性是提高矢量量化性能的关键,而提高矢量量化速度是这类算法得以实用的重要前提．     

一种改进的嵌入零树小波编码算法RA-EZW

针对嵌入零树小波编码算法(EZW)中不同阈值下相同系数被多次扫描编码的不足,通过对小波变换后系数幅值的变换调整,减少孤立零点,增加零树的数量,从而提高编码效率.实验结果表明:基于幅值变换的嵌入零树小波编码算法在信噪比、编/解码时间、图像恢复质量等方面都高于EZW算法,在恢复质量方面,比特率较低时效果尤为明显.     

一种基于小波分解与分形编码混合的图象压缩方法

利用双正交小波特性和小波塔式分解数据的多分辨特性、分形的IFS编码高效特性,提出了一种基于小波分解和分形编码压缩图像数据的方法。该方法先用一个小波将图象进行小波变换（分解）;在频域上,对不同频域层用不同的分块方法和比特率分配方法进行分形编码。根据实际需要和视觉特性来控制压缩比。重构时先在频域进行分形重构解,然后再用另外一个正交小波重建原图象。     

用于PACS系统的医学图象量化编码的算法

图象压缩是PACS系统的重要研究部分。作者研究了二维图象小波分解后系数的统计分布与拉普斯分布有很好的一致性；同时，由于不同幅度的小波系数在图象重构中权重的不同，在系数压缩编码时对不同权重的系数采用不同的压缩精度。由此，作者提出了一种适用于PACS系统的图象量化编码算法，该算法以各小波子带图象小波系数的重要统计特征-样本标准差为量化阈值选择依据，精确编码图象重构中权重较大的系数，还利用了人眼的频率视觉特性。实验表明，本算法具有计算简单、不同编码精度时被量化系数可预见的特点，同时在保证图象质量的基础上可获得较高压缩比。     

基于对象的小波变换在MPEG-4任意形状图像编码中的应用

任意形状图象对象的变换编码方法是MPEG-4视频编码实现的核心技术之一.该文对基于对象的小波变换在任意形状图象编码算法中的应用给予了详尽的论述.基于对象的小波变换包含两个步骤一是针对任意形状对象进行外插,使其可以运用规范的小波变换;二是进行小波系数的编码选择,以消除外插所产生的冗余.实验结果表明基于对象的小波变换与诸如SADCT等方法具有相似的低复杂度,性能相当;并且,在低比特率的情况下,其编码效果要优于SADCT.     

基于对象的小波变换的MPEG—4任意形状图像编码中的应用

任意形状图象对象的变换编码方法是MPEG－4视频编码实现的核心技术之一。该文对基于对象的小波变换在任意形状图象编码算法中的应用给予了详尽的论述,基于对象的小波变换包含两个步骤：一是针对任意形状对象进行外插,使其可以运用规范的小波变换;二是进行小波系数的编码选择,以消除外插所产生的冗余,实验结果表明：基于对象的小波变换与诸如SADCT等方法具有相似的低复杂度,性能相当,在低比特率的情况下,其编码效果要优于SADCT。     

基于MATLAB的小波分析方法与图象编码

主要介绍了用基于MATLAB的小波分析方法进行图象编码的原理,并对小波分解和重构及图象压缩和解压缩的必然关系进行了详细阐述.同时给出了较为具体的小波分解与重构实验设计报告.实验表明对图象数据进行小波分解与重构,实际取得了图象压缩与压缩的效果.     

基于MATLAB的小波分析方法与图象编码

主要介绍了用基于MATLAB的小波分析方法进行图象编码的原理,并对小波分解和重构及图象压缩和解压缩的必然关系进行了详细阐述.同时给出了较为具体的小波分解与重构实验设计报告.实验表明:对图象数据进行小波分解与重构,实际取得了图象压缩与压缩的效果.     

图像小波变换编码的误差分析

指出了图像的压缩率与重构图像的失真率存在一定的关联.从均匀标量量化的角度出发,对小波变换编码的方法进行了深入分析,通过引入小波系数的衰减指数λM变量来构建数学模型,经过模型推算,最后以近似估计的形式揭示了小波变换中图像的平均编码比特率与重构图像的失真率之间的关系.     

小波域中的分形图象编码方法

研究了小波变换和分形编码相结合的图象压缩方法,即对小波域（传统发形编码在空间域进行）图象进行分形编码,解决了传统分形编码收敛条件苛刻,解码步数难以确定的问题;同时又提出了类似四叉树分割的变长小波树的分形压缩算法,结合小波系数的分层量化算术编码,几乎可以准确地控制压缩倍数,解决了传统发形压缩倍数难以控制的问题,并且通过自动调整阈值的大小,找到小波域图象的最佳小波树分割,也也就是找到了小波系数和分形系数的最佳折衷,最后对DCT,传统分形编码和新方法进行比较,哪现新方法具有一些明显的优点和特点,尤其在压缩比下更是如此。     

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.