基于小波变换的JPEG编码方法的探讨

小波变换是近几年在图象处理领域中新兴的一种变换方法，以性能优越而日益受到人们注意。本文通过实验方法探讨了小波变换与现有ＪＰＥＧ编码体系相结合的可能性，并与采用了其它编码方法的小波变换编码和ＪＰＥＧ编码进行了比较，对三种编码方法在图象压缩 效果及性能进行了评估。     

基于小波系数结构特征的高倍率图像压缩方法

针对图像小波系数在各子带内显著性分布的聚簇特征,提出了在SPIHT算法的输出环节引入游程编码,对游程编码算法的性能进行分析后,基于算法的最优编码条件,对SPIHT算法中LIS的初始化操作进行了优化,提出了一种改进的多分辨系数扫描方法,使得显著系数在LISLIP中的一维分布更趋集中,从而使游程编码获得了更高的压缩效率．实验结果表明,与SPIHT相比,在几乎不影响压缩时间的同时,在高倍率压缩应用中提高了图像的重建质量近1dB．     

用于图像压缩的小波系数的上下文模型

结合GlicBawls编码方法的线性预测思想和CALIC编码方法通过量化减少上下文个数的思想，提出了一种新的用于图像压缩的小波系数的上下文模型。它通过量化当前系数的线性预测值形成上下文，进行自适应的算术编码。实验结果表明，利用这种模型获得的无损压缩比高于无损的SPIHT和用于JPEG2000的无损的EBCOT。另外，这种模型充分利用了小波变换的多分辨率性质，能以渐近分辨率(progressive resolution)方式压缩图片，并且它获得的原图片的各个比例尺(scale)的小图片的压缩比也高于EBCOT。     

语音DCT变换的一种小波编码方法

语音信号离散余弦变换的小波变换编码方法是根据DCT变换和小波变换特点，并结合语音信号的特征而提出的一种高效简便的语音编码方法，在编码中，对不同层次小波系数分配不同的量化位，可灵活、方便地控制重构话音的质量，以汉语语音音节为例的实验表明，在16kbps的编码数据率时，重构(或再生)的话音质量与原始话音质量基本相同。     

基于方向剖分的小波域分形图象压缩

该文提出一种新的分形和小波混合编码方法－基于方向剖分的小波域分形图象压缩方法：在将图象分解到小波域后，对各子图象，根据其所占能量的大小和所代表的方向纹理信息，采用不同大小、形状与类别的定义域块和值域块进行分形编码，经实验证明，这种基于方向剖分的小波域分形编码方法，在保证一定的还原图象质量的前提下，可以大大地提高了分形编码的速度，如果结合多层小波分解的分形压缩编码的预测法和零树法，还能进一步提高压缩率，从而使分形图象编码向实时应用迈进了一步。     

图像压缩编码技术及其国际标准

作者在本文论述了现存的图像压缩编码技术，并将其方法分为两大类，即经典压缩编码方法和现代压缩编码方法，分析其优缺点，并着重论述现代编码方法和图像压缩编码的国际标准。     

对“码率压缩技术”的分析与评价

本文介绍了数字码率压缩的分类，码率压缩的基本原理，对预测编码、变换编码、矢量量化、子频带编码、霍夫曼编码和运动补偿做了一些分析。内容以介绍基本原理为主，并对不同的编码方法做了简要的评价     

分形压缩编码算法的改进

在分析总结分形理论的基础上，提出了一种将小波变换压缩编码与迭代函数系统（IFS）分形编码相结合的图象压缩方法，研究结果表明，与一般的分形图象编码方法相比，运算时间下降而压缩比提高。     

基于小波变换的图像压缩编码方法研究

介绍了小波变换的基本理论以及基于小波变换的图像压缩编码与解码恢复过程。为了研究基于小波变换的图像压缩编码方法的优越性,通过实验与传统的离散余弦变换编码方法进行了性能的对比分析,实验结果表明：由于小波变换具有时间-频率局部化特性和多分辨率特性等优点,其能够更加有效地应用于图像数据压缩,可以达到更高的压缩效率,而且理论上可以获得任意压缩比的压缩图像。     

采用视觉加权自适应阈值量化的彩色图像小波编码方法

提出了一种基于视觉特性的彩色图像小波变换编码方法.该方法是以一种简单的灰度图像小波编码方法为基础,首先通过小波变换将图像进行多分辨率分解;然后对彩色分量的高频子带数据进行适当的抛弃;对小波图像的高频数据采取自适应阈值量化方法克服恢复图像中的分量独立点噪声污染现象;最后根据小波系数的码字分布特征,采用行程编码结合Huffman编码.该方法可保证重建图像的主观视觉效果良好,而且具有较高的压缩倍率.     

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.