基于QDCT和HVS的双彩色图像水印算法

针对水印中信息容量、不可见性和鲁棒性相互制约的问题,文中提出了一种基于QDCT和HVS的双彩色图像水印算法。该算法首先将彩色载体图像和彩色水印图像进行QDCT;然后根据HVS的特性决定水印信息的嵌入位置与嵌入强度,并结合广义Arnold变换和冗余嵌入策略, 将水印QDCT系数嵌入到载体图像QDCT系数的实部和虚部。实验结果表明,通过该算法嵌入水印后的彩色图像在PSNR为35 dB时,在常见攻击下提取出的水印大部分NC值高于0.95,水印信息具有更好的不可见性与鲁棒性。     

Valuations and multiplier ideals

We present a new approach to the study of multiplier ideals in a local, two-dimensional setting. Our method allows us to deal with ideals, graded systems of ideals and plurisubharmonic functions in a unified way. Among the applications are a formula for the complex integrability exponent of a plurisubharmonic function in terms of Kiselman numbers, and a proof of the openness conjecture by Demailly and Kollár. Our technique also yields new proofs of two recent results: one on the structure of the set of complex singularity exponents for holomorphic functions; the other by Lipman and Watanabe on the realization of ideals as multiplier ideals.

     

一种基于DCT变换的自适应彩色图像水印算法

提出了一种基于离散余弦变换的彩色图像数字水印算法.首先原始彩色图像的绿色分量进行8 x 8分块DCT变换.计算每块的噪声阈值,相应调整每块选取的两个中频系数的大小,把经过Arnold置乱加密的二值水印图像嵌入.水印提取时,不需要原始图像.实验结果表明,该算法能有效抵抗JPEG压缩、裁剪、加噪、图像增强等攻击,具有良好的透明性和较强的稳健性.     

Siegel discs, Herman rings and the Arnold family

We show that the rotation number of an analytically linearizable element of the Arnold family , , , satisfies the Brjuno condition. Conversely, for every Brjuno rotation number there exists an analytically linearizable element of the Arnold family. Along the way we prove the necessity of the Brjuno condition for linearizability of and , , at 0. We also investigate the complex Arnold family and classify its possible Fatou components. Finally, we show that the Siegel discs of and are quasidiscs with a critical point on the boundary if the rotation number is of constant type.

     

A fast chaos-based symmetric image cryptosystem with an improved diffusion scheme

In recent years, a number of chaos-based image cryptosystems have been proposed to meet the increasing demand for real-time secure image transmission. In this paper, an improved diffusion scheme named continuous diffusion strategy is proposed to promote the efficiency of the conventional permutation–diffusion type image cipher. The new scheme contains a supplementary diffusion procedure after the conventional diffusion process and the control parameters are altered by the cipher image after the first diffusion procedure. As a result, the difference can be introduced at the beginning and spread out to the whole image, and hence the same level of security can be achieved with fewer overall rounds. Moreover, to further enhance the confusion effect of the diffusion operation, an intensive diffusion approach is proposed, using stretched key stream elements to perform a cyclic shift to the cipher pixels. Extensive cryptanalysis has been performed using differential analysis, key space analysis, key sensitivity analysis and various statistical analyses. Experiment results demonstrate that the new scheme has a high level of security and fast encryption speed for practical image encryption.     

A novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism

This paper proposes a novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism, in which permuting the positions of image pixels incorporates with changing the gray values of image pixels to confuse the relationship between cipher-image and plain-image. In the permutation process, a generalized Arnold map is utilized to generate one chaotic orbit used to get two index order sequences for the permutation of image pixel positions; in the diffusion process, a generalized Arnold map and a generalized Bernoulli shift map are employed to yield two pseudo-random gray value sequences for a two-way diffusion of gray values. The yielded gray value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results are carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack as well.     

基于Arnold变换和Lorenz混沌系统的彩色图像加密算法

针对Arnold变换易被破解,而Lorenz混沌系统置乱的水印图像难以抵抗图像处理攻击的缺点,提出基于Arnold变换和Lorenz混沌系统的彩色图像加密算法,以充分利用了Arnold变换能够较好的分散图像的像素相关性,具有较高置乱度的特性,以及Lorenz混沌系统具有极强初值敏感性和更大的密匙空间和安全性的特点。通过水印信息的加密和解密实验、算法初值敏感性分析以及抗攻击性能对比实验,表明使用本文算法加密后的彩色水印信息能够提高载体图像的抗攻击性能,具有更高的安全性。