7/5小波滤波器簇及其图像压缩性能研究

构造了包括BT7/5滤波器(Brislawn-Treiber)在内的7/5小波滤波器簇,依据欧几里得算法给出了7/5小波基提升格式的构造过程和提升实现算法.根据7/5小波基优化条件的要求,证明了7/5小波基的、提升系数α为0.08时的图像压缩性能最佳,该小波基为JPEG2000标准第二部分推荐使用的BT7/5小波滤波器组.BT7/5小波的系数为有理数,与无理系数的CDF9/7小波滤波器相比,具有计算复杂度低和便于VLSI硬件实现等优点.实验结果表明,若压缩比在100∶1以内,采用BT7/5小波滤波器的重构图像峰值信噪比只比CDF9/7低0.1dB,而比LT5/3(LeGall-Tabatabai)高1.2dB.因此,在JPEG2000图像压缩系统中,BT7/5是LT5/3和CDF9/7的理想替代者.     

7/5双正交小波的构造及图像编码应用

根据双正交小波精确重构条件,推导出了7/5双正交小波滤波器组的参数化表达式.该表达式参数可随意取值,因此能够任意构造具有不同特征的7/5线性相位小波滤波器.作为构造实例,构造了具有最佳编码增益的有理系数7/5小波滤波器.实验表明,它具有与CDF 9/7小波滤波器相似的图像压缩性能,而且其提升小波变换的计算效率可提高20%.     

提升小波变换二叉树图像编码算法

为进一步提高图像压缩质量,在研究二维离散信号采样的基础上,基于全相位列率滤波理论设计了全相位内插滤波器组,并将其用作小波变换提升格式中的预测和更新滤波器,对图像进行不可分离的二维小波变换.结合各分解子带小波系数金字塔排列的特点,借鉴经典的SPIHT小波编码算法的思想,提出了二叉树小波编码算法.对经典测试图像的实验结果表明,与SPIHT算法在相同编码比特率下做比较,在低比特率下,二叉树小波编码算法重建图像的峰值信噪比平均提高约0.5 dB,并且重建图像的主观质量也较好.     

织物疵点检测中自适应正交小波基的构造

提出了一种用于织物疵点检测的自适应正交小波基的构造方法.该方法从小波滤波器系数满足的正交归一化条件入手,采用一定数量参数角的正弦和余弦函数构造出一定长度的正交小波滤波器系数的统一解析式;以分解子图中像素最大能量值最小作为逼近条件,采用遗传算法作为寻优算法,从而实现针对不同的织物,自适应地构造小波基.同时,实验证明了自适应小波基的对疵点图像分解效果.     

基于ε-SVR的嵌入式小波图像编码算法

针对基于支持向量机的小波图像编码算法难以实现嵌入式特性问题,在小波域构建一种回归树结构作为回归基本数据集合,同时利用子带内和子带间小波系数的相关性,提出一种线性动态阈值选取方法,以利于逐次逼近并保证回归数据的均衡性,并基于选定的阈值动态选取ε误差参数对小波系数进行多次回归,保证了重要系数被优先编码,使压缩算法具有嵌入式特性,对获得的支持向量及其权重进行自适应算术编码.实验结果表明,在压缩比相近的情况下,重构图像的PSNR(Peak Signal to Noise Ratio)比同类算法提高1～3 dB.     

基于整数小波变换的图像处理算法研究

为了以尽可能低的压缩比来得到更好的图像和视频来满足人的视觉系统、网络带宽以及各种不同类型的用户,采用小波变换的图像处理算法进行图像视频压缩.针对浮点数的小波系数,在进行图像编码时会产生精度误差,不能精确地重构图像的不足,提出一种改进方法,将提升算法应用于零树编码,实现了整数小波变换,既保持了原有的小波特性,又实现了小波快速算法,同时得到了比较好的压缩效果.     

基于IE 和AG 的小波图像融合方法

为客观评价几种小波融合图像算法的优劣, 采用了基于信息熵(IE: Information Entropy)和平均梯度(AG: Average Grads)的融合图像质量评价方法。首先选取了两组不同的源图像, 其中一组为曝光度不同的两幅图像, 另一组是焦距不同的两幅图像。然后对图像进行4 层小波分解, 低频系数全部采用像素点平均值法进行融合, 高频系数分别运用区域绝对值最大法、像素点绝对值最大法、区域最大梯度法以及像素点平均值法4 种小波系数融合规则进行小波图像融合, 最后分别比较了4 种融合图像的IE 和AG 值。实验结果表明, 将4 种小波融合方法进行比较, 基于像素点的最大绝对值法IE 和AG 值最大。对于曝光度不同的两幅图像, 其IE为7. 206 5 bit, AG 为5. 983 7 10^-5 , 对于焦距不同的两幅图像, 其IE 为7. 130 8 bit, AG 为4. 794 3 10^-5 。可见, 4 种融合规则相比较, 基于像素点的最大绝对值法融合效果最好, 从而验证了该方法的有效性。     

方向提升小波变换域稀疏滤波的自然图像贝叶斯压缩感知

针对压缩感知(CS)重构算法在实际应用中自然图像的小波变换系数往往无法稀疏的问题,提出了一种方向提升小波变换(DLWT)域稀疏滤波的自然图像贝叶斯压缩感知算法(DLWT-SFTSW-BCS)。首先对自然图像进行方向提升小波变换得到小波变换系数;然后在随机测量之前利用稀疏滤波切除小系数,消除了小系数对大系数重构时的混叠干扰;最后结合小波树结构的贝叶斯压缩感知重构算法得到自然图像的重构图像。实验结果表明,与仅利用尺度间相关性的小波树结构的压缩感知重构算法相比,DLWT-SF-TSW-BCS算法的重构峰值信噪比最大可提高10dB。     

基于完全重构条件的双正交小波构造方法

提出了一种基于完全重构条件的双正交小波滤波器的通用构造方法,在确定滤波器长度和消失矩后,可通过求解方程组得到双正交小波的滤波器系数.该方法构造了应用于JPEG2000的5/3小波、CDF9/7小波以及非常适合于硬件实现的具有简单系数的9/7小波.     

基于提升小波变换的医学图像压缩算法

详细分析小波提升框架算法(L ifting Schem e)的原理和实现步骤,比较了M allat算法和L ifting Schem e算法在运行速度上的差异.推导出JPEG 2000静态图像压缩标准所采用的Le Gall 5/3小波滤波器的提升格式,对Le Gall 5/3小波和CDF 9/7小波滤波器的提升格式应用于医学图像压缩编码进行了分析.本文给出的小波提升算法对JPEG2000静态图象压缩标准在医学影像存储与传输系统中的应用具有参考价值.     

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.