Novel image encryption algorithm based on multiple-parameter discrete fractional random transform

A new method of digital image encryption is presented by utilizing a new multiple-parameter discrete fractional random transform. Image encryption and decryption are performed based on the index additivity and multiple parameters of the multiple-parameter fractional random transform. The plaintext and ciphertext are respectively in the spatial domain and in the fractional domain determined by the encryption keys. The proposed algorithm can resist statistic analyses effectively. The computer simulation results show that the proposed encryption algorithm is sensitive to the multiple keys, and that it has considerable robustness, noise immunity and security.     

Image sharing scheme based on discrete fractional random transform

We present a novel image sharing algorithm based on the discrete fractional random transform (DFRNT). The secret image is shared into several shadow images in the DFRNT domain together with some noise images as the encryption keys to increase the security. The decryption only requires a part of shadow images and therefore is independent of those noise images. The (t,n) threshold sharing scheme can be implemented completely by the proposed algorithm. The numerical simulations have demonstrated the effectiveness of this image sharing scheme.     

Double-image encryption based on discrete fractional random transform and chaotic maps

A novel double-image encryption algorithm is proposed, based on discrete fractional random transform and chaotic maps. The random matrices used in the discrete fractional random transform are generated by using a chaotic map. One of the two original images is scrambled by using another chaotic map, and then encoded into the phase of a complex matrix with the other original image as its amplitude. Then this complex matrix is encrypted by the discrete fractional random transform. By applying the correct keys which consist of initial values, control parameters, and truncated positions of the chaotic maps, and fractional orders, the two original images can be recovered without cross-talk. Numerical simulation has been performed to test the validity and the security of the proposed encryption algorithm. Encrypting two images together by this algorithm creates only one encrypted image, whereas other single-image encryption methods create two encrypted images. Furthermore, this algorithm requires neither the use of phase keys nor the use of matrix keys. In this sense, this algorithm can raise the efficiency when encrypting, storing or transmitting.     

Image encryption based on the multiple-order discrete fractional cosine transform

A novel scheme for image encryption based-on the multiple-order discrete fractional cosine transform (MODFrCT) is proposed. The DFrCT has a similar relationship with the discrete fractional Fourier transform (DFrFT). Not only has the DFrCT many useful properties similar to the conventional discrete cosine transform, but it also has another property, namely its fraction, or its transform order. The image to be encrypted is transformed with the multiple-order DFrCT using a random row cipher key vector and a random column key vector successively, and the corresponding cipher key vectors of decryption are also very sensitive. The transmission of the encrypted image with the algorithm of the multiple-order DFrCT is faster due to its reality. The digital simulation results proved the validity and safety of this algorithm.     

不对称离散分数傅里叶变换实现数字图像的加密变换

利用不对称分数傅里叶变换的特性,提出了一种图像加密变换的新方法。对图像的x,y方向分别实施不同级次的一维分数傅里叶变换,得到加密图像。解密方法就是对变换后的图像实施对应级次的分数傅里叶逆变换,只有当x,y方向的逆变换级次分别与原变换级次都相同或者满足周期条件时,才能恢复原图像。加密变换有效地提高了图像加密和防伪力度。数值计算验证了方法的正确性和可行性。     

Image encryption algorithm based on the multi-order discrete fractional Mellin transform

A multi-order discrete fractional Mellin transform (MODFrMT) is constructed and directly used to encrypt the private images. The MODFrMT is a generalization of the fractional Mellin transform (FrMT) and is derived by transforming the image with multi-order discrete fractional Fourier transform (MODFrFT) in log-polar coordinates, where the MODFrFT is generalized from the closed-form expression of the discrete fractional Fourier transform (DFrFT) and can be calculated by fast Fourier transform (FFT) to reduce the computation burden. The fractional order vectors of the MODFrMT are sensitive enough to be the keys, and consequently key space of the encryption system is enlarged. The proposed image encryption algorithm has significant ability to resist some common attacks like known-plaintext attack, chosen-plaintext attack, etc. due to the nonlinear property of the MODFrMT. Additionally, Kaplan-Yorke map is employed in coordinate transformation process of the MODFrMT to further enhance the security of the encryption system. The computer simulation results show that the proposed encryption algorithm is feasible, secure and robust to noise attack and occlusion.     

The multiple-parameter discrete fractional Hadamard transform

Discrete fractional Hadamard transform (DFrHaT) is a generalization of the Hadamard transform, which has been widely used in signal processing. In this paper, we present the multiple-parameter discrete fractional Hadamard transform (MPDFrHaT), which has multiple order parameters instead of only one in DFrHaT. The proposed MPDFrHaT is shown to possess all of the desired properties of DFrHaT. In fact, it will reduce to DFrHaT when all of its order parameters are the same. We also propose a novel encryption technique, double random amplitude (DRA) encoding scheme, by cascading twofold random amplitude filtering. As a primary application, we exploit the multiple-parameter feature of MPDFrHaT and double random amplitude encoding scheme for digital image encryption in the MPDFrHaT domain. Results show that this method can enhance data security.     

A blind color image watermarking based on DC component in the spatial domain

Color image watermarking has become essential and important copyright protection or authentication scheme. It is noted that most of the existing color image watermarking algorithms are performed only in the single domain (spatial domain or frequency domain), and not to integrate these merits of the different domains. By utilizing the generating principle and distribution feature of the direct current (DC) coefficient, a novel blind watermarking algorithm is proposed for color host images in this paper. Firstly, the Y luminance of host image is divided into 8 × 8 sub-blocks and the DC coefficients of each block are directly calculated in the spatial domain without DCT transform. Secondly, according to the watermark information and the quantization step, the DC coefficients are calculated and their increments are further utilized to modify directly the values of all pixels in the spatial domain instead of the DCT domain to embed watermark. When watermark extraction, only the watermarked image and the quantization step are needed in the spatial domain. Experimental results show that the proposed method not only can resist both traditional signal processing attacks and geometric attacks, but also has more efficient in computational complexity. Comparisons also demonstrate the advantages of the method.     

A novel image tamper localization and recovery algorithm based on watermarking technology

In this paper, an effective self-embedding fragile watermarking scheme is presented. The watermark is generated by encoding the DCT coefficients of each 2 × 2 block and embedded into another block according to the block mapping. A non-linear chaotic sequence is used for generating the block mapping which can enhance the security of the algorithm. An improved tamper localization and recovery algorithm are performed. The experiment results show that the watermarked image has a high average peak signal-to-noise ratio. Furthermore, the tamper region can be successfully localized and exactly recovered, even if for the content-only tampering.     

一种基于混沌和分数阶傅里叶变换的数字水印算法

基于混沌序列及离散分数阶傅里叶变换,提出了一种基于混沌和分数阶傅里叶变换的数字水印算法,并对算法及抗攻击性能进行了仿真分析.结果表明,该算法简单有效,对JPEG压缩、噪声、滤波等攻击具有良好的鲁棒性. 关键词： 数字水印 混沌 分数阶傅里叶变换 鲁棒性     

Image encryption based on the multiple-parameter discrete fractional Fourier transform and chaos function

In recent years, the chaos-based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. In this paper, we propose a new approach for image encryption based on the multiple-parameter discrete fractional Fourier transform and chaotic logistic maps in order to meet the requirements of the secure image transmission. In the proposed image encryption scheme, the image is encrypted by juxtaposition of sections of the image in the multiple-parameter discrete fractional Fourier domains and the alignment of sections is determined by chaotic logistic maps. This method does not require the use of phase keys. The new method has been compared with several existing methods and shows comparable or superior robustness to blind decryption.     

基于Radon变换和四元数实矩阵的彩色图像零水印算法

为了提高空间域彩色图像零水印算法的水印嵌入和检测精度以及抵抗旋转几何变换的能力,提出了一种基于Radon变换和四元数实矩阵表示的抗旋转攻击空间域零水印算法。首先将原始彩色图像使用四元数实矩阵来表征,并计算实数字矩阵的Radon变换不变矩;然后利用少量低阶Radon变换不变矩来设计和构建零水印信息;在水印检测前,通过Radon变换几何校正算法对可能遭受旋转攻击的待检测图像进行旋转角度的校正,然后进行水印的提取。实验结果表明,该方法可以获得良好的图像视觉效果,对于旋转几何攻击具有很强的鲁棒性,同时对滤波、JPEG压缩和剪切攻击也具有一定的鲁棒性。     

Triple color images encryption algorithm based on scrambling and the reality-preserving fractional discrete cosine transform

An image encryption algorithm to secure three color images simultaneously by combining scrambling with the reality-preserving fractional discrete cosine transform (RPFrDCT) is proposed. The three color images to be encrypted are converted to their indexed formats by extracting their color maps, which can be considered as the three components of a color image. These three components are affected each other by scrambling the interims obtained from vertically and horizontally combining the three indexed formats with the help of the chaos-based cyclic shift. The three scrambled components are separately transformed with the RPFrDCT, in which the generating sequences are determined by the Chirikov standard chaotic map. Arnold transform is used to further enhance the security. Due to the inherent properties of the chaotic maps, the cipher keys are highly sensitive. Additionally, the cipher image is a single color image instead of three color ones, and is convenient for display, storage and transmission due to the reality property of RPFrDCT. Numerical simulations are performed to show the validity of the proposed algorithm.     

基于分数阶Fourier变换的数字图像实值加密方法

构造了一种新的保实化的分数阶Fourier变换,提出了一种基于该变换的数字图像实值加密方法。利用保实分数阶Fourier变换的保实特性和阶数可加性等完成了数字图像的加密与解密,明文和密文分别位于空域和由密钥决定的保实分数阶Fourier变换域中,具有较强的抗统计破译能力。密图是一个实值图像,便于显示和存储。仿真实验结果表明,该加密方法密钥简单,无数据膨胀,对参数敏感度高,具有一定的鲁棒性和安全性。在信息安全领域具有良好的研究前景和实用价值。     

A robust watermarking algorithm based on salient image features

A feature-based robust watermarking algorithm against geometric attacks is proposed in this paper. It is well-known that geometric attacks such as rotation, scaling, and translation on a watermarked image will destroy the synchronization between the processes of watermark embedding and detection. In other words, the locations for embedding the watermark are lost due to geometric attacks, which results in the failure of watermark detection. Since salient features in an image are relatively stable under geometric attacks, they may serve as reference points to synchronize the embedding and detection processes and the detection rate of the watermark could be increased significantly. Another problem for feature-based watermarking is that the repeatability of feature detection tends to be low; that is, the features detected during the embedding process may not be detected again during the detection process. To overcome such a problem, a novel feature enhancement technique is developed to increase the repeatability rate of feature detection, in which image moments are used to achieve geometric invariance between the embedding and detection processes. Experimental results demonstrate that the proposed watermarking algorithm is able to survive various geometric attacks and common image processing operations. And the visual quality of the watermarked image is well preserved as well.     

基于HVS的小波变换数字图像水印算法

为实现图像水印在数据认证、访问控制和版权保护等领域发挥作用,提出一种人眼视觉感知特性的小波变换数字图像水印算法。首先对二值图像水印进行Arnold变换,并采用行堆叠的方法,转换成一维序列,然后根据密钥生成的高斯序列中值的正负来确定水印信息嵌入时是采用那种调制方式,最后对原始图像进行3级DWT分解,在小波图像的第二层中频子带中,结合人眼视觉特性将水印正向或负向调制叠加在宿主图像大于JND 值的小波系数上。实验结果表明:该算法能抵抗JPEG压缩、加噪、剪切等多种攻击,具有良好的透明性,鲁棒性和安全性。     

Novel image fusion method based on discrete fractional random transform

We introduce a new spectrum transform into the image fusion field and propose a novel fusion method based on discrete fractional random transform （DFRNT）. In DFRNT domain, high amplitude spectrum （HAS） and low amplitude spectrum （LAS） components carry different information of original images. For different fusion goals, different fusion rules can be adopted in HAS and LAS components, respectively. The proposed method is applied to fuse real multi-spectral （MS） and panchromatic （Pan） images. The fused image is observed to preserve both spectral information of MS and spatial information of Pan. Spectrum distribution of DFRNT is random and uniform, which guarantees that good information is reserved.     

Displacement measurement based on joint fractional Fourier transform correlator

A displacement measurement technology based on joint fractional Fourier transform is firstly proposed. Contrast to conventional displacement measurement based on joint Fourier transform correlator, the position of cross correlation peak in the proposed technology could be fixed arbitrarily according to the order of fractional Fourier transform. The optical setup in the proposed technology is more flexible and easier to implement. Simulation and experiment results are given out to verify the analysis.     

Novel optical image encryption scheme based on fractional Mellin transform

A novel nonlinear image encryption scheme is proposed by introducing the fractional Mellin transform (FrMT) into the field of image security. As a nonlinear transform, FrMT is employed to get rid of the potential insecurity of the optical image encryption system caused by the intrinsic object-image relationship between the plaintext and the ciphertext. Different annular domains of the original image are transformed by FrMTs of different orders, and then the outputs are further encrypted by comprehensively using fractional Fourier transform (FrFT), amplitude encoding and phase encoding. The keys of the encryption algorithm include the orders of the FrMTs, the radii of the FrMT domains, the order of the FrFT and the phases generated in the further encryption process, thus the key space is extremely large. An optoelectronic hybrid structure for the proposed scheme is also introduced. Numerical simulations demonstrate that the proposed algorithm is robust with noise immunity, sensitive to the keys, and outperforms the conventional linear encryption methods to counteract some attacks.     

Performance analysis on a watermarking method based on double random phase encoding technique

When digital watermarking is used for piracy tracking, different watermarks are needed to be embedded into different distributions of a digital product. Based on double random phase encoding (DRPE) technique, cascaded-phases iterative algorithm and random-phase-shift algorithm, Chen et al. proposed a method to generate many different embedded watermarks from one reference watermark, while the embedded watermark can be recognized by testing the correlation between the recovered watermark and the original reference watermark. In this way, only the reference watermark instead of the embedded watermarks needs to be stored and managed. However, since the recovered watermark may be different from the embedded watermark, especially under any image processing, the correlation between the recovered watermark and the reference watermark may be different from the correlation between the embedded watermark and the reference watermark, which may result in wrong recognition. In this paper, the performance of Chen's method was analyzed with numerical simulations. The results indicated that, to correctly recognize the embedded watermark, the number of generated embedded watermarks with Chen's method is limited.