基于分块三维小波变换的盲视频水印算法

针对数字视频的版权保护，提出了一种基于分块三维小波变换的视频水印算法，将视频信号分成三维图像块，根据人类视觉系统的特性，选择纹理复杂的运动块进行三维小波变换，对水印信息进行扩频CDMA编码后，将其嵌入到三维块的小波系数中，利用正交码的自相关函数特性来检测水印信息，实现水印的盲提取，实验结果表明，该水印方案在保证视频视觉质量的同时，对于针对视频水印的特殊攻击具有高鲁棒性。     

一种采用图像融合的鲁棒水印算法

为了提高数字水印技术的鲁棒性和改善嵌入水印信息的视觉特征,提出了一种采用图像融合的水印算法。该水印算法嵌入的水印信息采用作者的肖像,在水印的嵌入和提取过程中采用小波变换和图像融合技术。实验结果表明该水印算法具有以下优点：水印直观;有较好的抗噪声、抗压缩鲁棒性;算法简单。     

基于量化索引调制的鲁棒盲水印设计

针对低比特率的图像中，有损压缩对数字水印的正确提取带来的问题，文章提出了一种基于量化索引调制的鲁棒盲水印设计方法．该方法首先对原始图像进行小波变换，在量化之前，对小波变换后的系数进行水印信息的嵌入．文中详细设计了水印信息的嵌入过程，并在普通的图像编码算法基础上嵌入水印算法．经实验测试表明，该水印算法在抗压缩破坏时，嵌入...     

基于DWT-SVD的视频水印

提出了结合离散小波变换（DWT）和奇异值分解（SVD）的数字视频水印算法。选取规范化质心（NCG）大于阈值的视频进行分帧,利用每帧视频的DWT分解后的中频分量系数进行SVD,修改奇异值,完成二值图像水印的嵌入,提取时利用部分原始视频的边信息,实现了水印的半盲提取。仿真结果表明,该算法具有良好的不可见性,并且保证了对常见的滤波,压缩,剪切等攻击的鲁棒性。     

基于小波变换的鲁棒型数字图像水印算法

提出一种基于小波变换的数字图像水印算法．通过对宿主图像、经过Amold变换加密后的水印图像分别进行多分辨率小波分解，达到自适应嵌入水印信息的目的．实验采用在彩色宿主图像中分别嵌入灰度水印图像及彩色水印图像，表明该算法简便易实现，攻击实验表明该算法能够较好的保证图像质量并能经受一定的攻击，同时由于对原始水印图像进行加密处理，该算法达到了即隐藏信息的存在，又隐藏信息的内容的双重安全效果．     

应用于高清视频的数字水印改进算法

基于高清数字视频对水印的要求,以及对H.264编码和现有的基于DCT变换视频水印算法的研究,提出一种基于DCT变换AC系数的自适应视频水印算法,自适应选择Ⅰ帧纹理块作为嵌入块;通过计算AC系数方差选择修改系数嵌入水印信息;为了减少水印嵌入量和增加水印鲁棒性,采用Arnold置乱和改进的秘密共享方案对水印进行预处理.该算法充分保证了水印的不可见性,同时具有一定的鲁棒性,具有一定的理论和实际应用价值.     

H.264视频压缩域水印嵌入位置的分析

视频水印技术按照水印与视频的结合形式,分为压缩域水印和原始视频水印。压缩域水印可以很好地利用视频序列在时间上的冗余,但嵌入水印信息量较小;原始视频水印技术没有充分利用视频序列时间冗余度,但嵌入水印的信息较多,耗费时间较多。HG算法可以不解码视频而快速嵌入水印信息,但嵌入容量有限。本文改进HG算法通过分析非关键帧运动矢量,选择关键帧嵌入位置,使得在压缩域嵌入水印时,水印嵌入速度和嵌入量有较大幅的改进。     

一种基于MPEG-2标准的数字水印技术

利用MPEG-2标准的压缩及视频流的特点，讨论了基于DCT变换帧内编码的水印嵌入方法，并提出一种改进的算法。实验证明，该算法改善了压缩视频中水印的嵌入性能。     

基于小波变换的鲁棒型数字图像水印算法

提出一种基于小波变换的数字图像水印算法.通过对宿主图像、经过Amold变换加密后的水印图像分别进行多分辨率小波分解,达到自适应嵌入水印信息的目的.实验采用在彩色宿主图像中分别嵌入灰度水印图像及彩色水印图像,表明该算法简便易实现,攻击实验表明该算法能够较好的保证图像质量并能经受一定的攻击,同时由于对原始水印图像进行加密处理,该算法达到了即隐藏信息的存在,又隐藏信息的内容的双重安全效果.     

基于分数阶变换的彩色图像自适应重构水印算法

首先, 采用分数阶Fourier变换算法, 对彩色图像进行分数阶频域变换, 分析图像的频域信息, 筛选出适合嵌入水印的系数, 作为水印的嵌入位置; 其次, 定义频域系数的隐蔽特性, 并对隐蔽特性进行分级, 使水印嵌入系数达到最优; 最后, 对二值化水印图像分块做提升小波变换和压缩感知测量, 将测量结果作为水印信息嵌入到载体图像中, 解决了当前多数水印算法嵌入信息冗余度高, 含水印图像抗攻击能力不足的问题. 实验结果表明, 该算法在抵抗几何攻击、 噪声干扰等方面性能良好, 显著降低了水印信息冗余度, 提高了嵌入的效率和水印信息安全性, 增加了水印算法的可靠性.     

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.