分数傅里叶域数字水印算法

基于离散分数傅里叶变换(DFRFT)快速算法发展了一种分数傅里叶谱域图像水印算法.该算法根据分数傅里叶变换谱具有空域和频域双域信息表达能力,分别对原始图像和所加水印信息进行不同级次的分数傅里叶变换,提取水印分数傅里叶谱的低频成分并直接将其叠加到原始图像的分数傅里叶谱中的对角像元上,然后再进行逆变换得到水印图像.在JPEG压缩、图像旋转及剪切等攻击方式下,对该水印算法进行了鲁棒性分析,数值实验表明该水印算法具有良好的抗攻击性和安全性.     

球面折射系统和复合厚透镜的分数傅里叶变换

提出单球面折射系统可以作为光学分数傅里叶变换的最基本单元。在此基础上可以构造多种厚透镜或复合厚透镜分数傅里叶变换系统。推导了系统结构参数与分数傅里叶变换的级次的关系。指出单球面折射系统及其构造的透镜系统对输入物函数的分数傅里叶变换输出可以位于自由空间,也可在球面折射材料内部或折射材料端面。输出平面位置的灵活性及其构造复杂系统的多样性,对于分数傅里叶变换的应用和光学信息处理必定具有潜在的实用价值。     

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

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

分数傅里叶变换计算全息

在计算全息和分数傅里叶变换的基础上提出了不对称分数傅里叶变换计算全息和双随机相位不对称分数傅里叶变换计算全息。在这种方法中,首先用一随机相位函数乘以输入图像信息,然后沿x方向实施α级次的一维分数傅里叶变换,再乘以第二个随机相位函数,最后,沿y方向实施β级次的一维分数傅里叶变换。采用迂回位相编码法对变换后的结果编码,绘出计算全息图。为了恢复原始图像,需要知道变换级次和随机相位函数。利用这种方法进行图像加密,使加密图像的密钥由原来两重增加到四重,从而提高了系统的保密性能。     

基于光学相关的多目标检测

运用傅里叶变换相关识别技术实现了无畸变、有平移多目标的检测。在此基础上讨论了图像边缘信息和非边缘信息对相关性能的影响。运用分数傅里叶变换相关识别技术实现了目标图像存在尺度、旋转畸变而无平移变化时的目标检测。结果表明,分数傅里叶变换的级次选择对目标图像的旋转和尺度畸变有一定的补偿作用。在分数傅里叶变换相关中,通过简单的级次调节可实现一定范围内的旋转、尺度畸变不变识别。     

用变形全息透镜实现变形分数傅里叶变换

利用一发散点光源和一束倾斜平行光制作出在两个垂直方向上具有不同焦距的变形全息透镜,且用此全息元件实现了变形分数傅里叶变换。变形全息透镜两个方向上的焦距随全息记录条件和再现条件而变化,分析了用这种全息透镜实现变形分数傅里叶变换的条件。实验表明,用该元件能够方便地实现任意级次的变形分数傅里叶变换。     

基于分数傅里叶变换的分数相关峰值特性

本文通过理论分析和计算机仿真研究了分数傅里叶变换的级次对分数相关峰值特性的影响并优化了分数相关的级次。结果表明分数相关输出在旁辩和峰值宽度方面与传统相关相比有了较大的改善,因而可以提高目标探测的灵敏性。     

利用分数傅里叶变换相关实现散斑相关测量

提出了一种在匹配滤波相关中利用分数傅里叶变换代替傅里叶变换实现散斑相关测量的方法.利用分数傅里叶变换的指数性质,采用把移变后的散斑图像先进行相位调制,再进行分数傅里叶变换的方法,有效地解决了分数傅里叶变换的移变性带来的谱移问题.编程模拟和拉伸试件位移场测量的结果表明,只要选择合适的分数傅里叶变换级次和相位调制函数,可以得到优于傅里叶变换相关的理想输出.     

求解分数傅里叶变换衍射积分的一种快速算法

在对Lohmann 二型分数傅里叶变换(FRT)和菲涅耳衍射积分进行比较的基础上,给出基于快速傅里叶变换(FFT)求解该分数傅里叶变换和菲涅耳衍射积分的快速算法及算法适用范围.数值模拟实验证明了理论的可靠性和算法的高效性.此快速算法为分数傅里叶变换在工程实际中的进一步广泛应用奠定了基础.     

一种基于角谱理论的光学FRFT的数值模拟算法

以角谱传播理论和分数傅里叶变换(FRFT)的单透镜和双透镜光学实现单元为理论基础,提出了一种基于实际光学结构的光学FRFT的数值模拟算法,推导了该算法中采样间隔的选取方法,并利用Matlab语言编写了相应的处理程序,将该程序对方孔分数傅里叶变换的计算结果与实际实验结果相比较,结果表明该算法是实际光学结构在理想情况下的模拟,因此,该数值计算在一定程度上可以代替柱面镜对光场实现分数傅里叶变换,也可以为实际实验提供很好的参考和指导。     

Image recovery from double amplitudes in fractional Fourier domain

The classical Gerchberg--Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg--Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].     

Asymmetric multiple-image hiding using phase retrieval technique based on amplitude- and phase-truncation in fractional Fourier domain

We propose a multiple-image hiding scheme based on the amplitude- and phase-truncation approach, and phase retrieval iterative algorithm in the fractional Fourier domain. The proposed scheme offers multiple levels of security with asymmetric keys. Multiple input images multiplied with random phase masks are independently fractional Fourier transformed with different orders. The individual keys and common keys are generated by using phase and amplitude truncation of fractional spectrum. After using two fractional Fourier transform, the resultant encrypted image is hided in a host image with phase retrieval iterative algorithm. Using the correct universal keys, individual keys, and fractional orders, one can recover the original image successfully. Computer simulation results with four gray-scale images support the proposed method. To measure the validity of the scheme, we calculated the mean square error between the original and the decrypted images. In this scheme, the encryption process and generation of decryption keys are complicated and should be realized using computer. For decryption, an optoelectronic setup has been suggested.     

Double image encryption based on iterative fractional Fourier transform

We present an image encryption algorithm to simultaneously encrypt two images into a single one as the amplitudes of fractional Fourier transform with different orders. From the encrypted image we can get two original images independently by fractional Fourier transforms with two different fractional orders. This algorithm can be independent of additional random phases as the encryption/decryption keys. Numerical results are given to analyze the capability of this proposed method. A possible extension to multi-image encryption with a fractional order multiplexing scheme has also been given.     

Color image encryption and decryption for twin images in fractional Fourier domain

We propose a method for the encryption of twin color images using fractional Fourier transform (FRT). The color images to be encrypted are converted into the indexed image formats before being processed through twin image encryption algorithm based on the FRT. The proposed algorithm uses one random code in the image domain and one random phase code in the FRT domain to perform double image encryption. The conversion of both the input RGB images into their indexed formats facilitates single-channel processing for each image, and is more compact and robust as compared to multichannel techniques. Different fractional orders, the random masks in image- and FRT domain are the keys to enhance the security of the proposed system. The algorithms to implement the proposed encryption and decryption schemes are discussed, and results of digital simulation are presented. We examine sensitivity of the proposed scheme against the use of unauthorized keys (e.g. incorrect fractional orders, incorrect random phase mask etc.). Robustness of the method against occlusion and noise has also been discussed.     

Fractional Fourier plane image encryption technique using radial hilbert-, and Jigsaw transform

A new method for image encryption using integral order radial Hilbert transform (RHT) filter in the fractional Fourier transform (FRT) domain has been proposed. The technique is implemented using the popular double random phase encoding method in the fractional Fourier domain. The random phase masks (RPMs), integral orders of the RHT, fractional orders of FRT, and indices of the Jigsaw transform (JT) have been used as keys for encryption and decryption. Simulation results have been presented and the schematic representation for optical implementation has been proposed. The mean-square-error and signal-to-noise ratio between the decrypted image and the input image have been calculated for the correct as well as incorrect orders of the RHT. Effect of occlusion and noise on the performance of the proposed scheme has also been studied. The robustness of the technique has been verified against attack using partial windows of the correct random phase masks. Similar investigations have also been carried out for the chosen-, and the known-plain-text attacks.     

Optical color image hiding scheme by using Gerchberg–Saxton algorithm in fractional Fourier domain

We proposed an optical color image hiding algorithm based on Gerchberg–Saxton retrieval algorithm in fractional Fourier domain. The RGB components of the color image are converted into a scrambled image by using 3D Arnold transform before the hiding operation simultaneously and these changed images are regarded as the amplitude of fractional Fourier spectrum. Subsequently the unknown phase functions in fractional Fourier domain are calculated by the retrieval algorithm, in which the host RBG components are the part of amplitude of the input functions. The 3D Arnold transform is performed with different parameters to enhance the security of the hiding and extracting algorithm. Some numerical simulations are made to test the validity and capability of the proposed color hiding encryption algorithm.     

Color image encryption and decryption using fractional Fourier transform

We propose the encryption of color images using fractional Fourier transform (FRT). The image to be encrypted is first segregated into three color channels: red, green, and blue. Each of these channels is encrypted independently using double random phase encoding in the FRT domain. The different fractional orders and random phase masks used during the process of encryption and decryption are the keys to enhance the security of the proposed system. The algorithms to implement the proposed encryption and decryption scheme are discussed, and results of digital simulation are presented. The technique is shown to be a powerful one for colored text encryption. We also outline the implementation of the algorithm and examine its sensitiveness to changes in the fractional order during decryption.     

Double image encryption using double pixel scrambling and random phase encoding

A novel double image encryption method is proposed by utilizing double pixel scrambling technique and random fractional Fourier domain encoding. One of the two original images is encoded into the phase of a complex signal after being scrambled by one matrix, and the other original image encoded into its amplitude after being scrambled by another matrix. The complex signal is then encrypted into stationary white noise by utilizing double random phase encoding in fractional Fourier domain. By applying the correct keys with fractional orders, the random phase masks and the pixel scrambling operation, the two original images can be retrieved without cross-talk. Numerical simulations have been done to prove the validity and the security of the proposed encryption method.