Vortex Stagnation problem in iterative Fourier transform algorithms

Optical vortex stagnation problem in Iterative Fourier Transform Algorithm occurs due to the termination of the process of self annihilation of optical vortices. The role played by propagation and inverse propagation operators combined with the Fourier domain constraint in this vortex annihilation process in the initial stage of the iterative procedure is studied. The understanding of this process recommends the process of forced annihilation as a solution to this stagnation problem and is demonstrated in this paper.     

A comparison of the iterative Fourier transform method and evolutionary algorithms for the design of diffractive optical elements

Three methods of designing diffractive optical elements (DOE) are compared. The iterative Fourier transform algorithm (IFTA) is compared to an evolutionary strategy (ES) approach and a combination of both methods. It is shown that the combination of both methods produces a better solution than the iterative method and is faster than using the evolutionary strategy only.     

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.     

Optical image asymmetric cryptosystem using fingerprint based on iterative fraction Fourier transform

A novel asymmetric cryptosystem for optical image is proposed using fingerprint based on iterative fractional Fourier transform. To enhance the security, a hyperchaotic phase generated by a 4D Lorenz system is considered as the public key in the proposed encryption system, while the private key is emerged by the retrieved phase and fingerprint. In the encryption process, the secret information is hid into the hyperchaotic phase. Subsequently, the private key can be obtained by a reversible operation. To decrypt the original image, the ciphertext and private key are imported into the input plane of fractional Fourier system. This system is also applicable for information authentication because the fingerprint is used both in encryption and decryption approach. Some numerical simulations have been done to test the validity and capability of the encryption system.     

Weighting iterative Fourier transform algorithm of the kinoform synthesis

Two object-dependent filters (an amplitude and a phase filter) are used in the object plane on the iterative calculation of a kinoform instead of a single (phase) filter as usual. The amplitude filter is a system of weight coefficients that vary in the process of iterations and control the amplitude of an input object. The advantages of the proposed method over other ones are confirmed by computer-based experiments. It is found that the method is most efficient for binary objects.     

基于图像的三维刚体运动估计算法比较

基于图像特征点对应估计三维刚体运动是计算机视觉的一个基本问题。对四种常用的运动估计算法,包括基于三维特征点的奇异值分解法、正交分解法、单位四元数法和基于二维特征点的"8点算法",通过大量仿真实验和一个机载目标运动光测系统进行了精度,稳定性和效率的比较。结论表明,基于三维特征的算法比基于二维特征的算法精度高、稳定性好,效率高。其中在基于三维特征的算法中,奇异值分解法效率更高,单位四元数法稳定性更好,在基于二维特征的算法中采用非线性优化是必须的,而增加特征点数和降低噪声水平对四种算法都能提高精度。讨论了这些结论对解决实际问题的作用。     

Double image encryption based on phase-amplitude hybrid encoding and iterative phase encoding in fractional Fourier transform domains

A new method for double image encryption is proposed that is based on amplitude-phase hybrid encoding and iterative random phase encoding in fractional Fourier transform (FrFT) domains. In the iterative random phase encoding operation, a binary random matrix is defined to encode two original images to a single complex-valued image, which is then converted into a stationary white noise image by the iterative phase encoding with FrFTs. Compared with the previous schemes that uses fully phase encoding, the proposed method reduces the difference between two original images in key space and sensitivity to the FrFT orders. The primitive images can be retrieved exactly by applying correct keys with initial conditions of chaotic system, the pixel scrambling operation and the FrFT orders. Computer simulations demonstrate that the encryption method has impressively high security level and certain robustness against data loss and noise interference.     

The extended Fourier transform for 2D spectral estimation.

We present a linear algebraic method, named the eXtended Fourier Transform (XFT), for spectral estimation from truncated time signals. The method is a hybrid of the discrete Fourier transform (DFT) and the regularized resolvent transform (RRT) (J. Chen et al., J. Magn. Reson. 147, 129-137 (2000)). Namely, it estimates the remainder of a finite DFT by RRT. The RRT estimation corresponds to solution of an ill-conditioned problem, which requires regularization. The regularization depends on a parameter, q, that essentially controls the resolution. By varying q from 0 to infinity one can "tune" the spectrum between a high-resolution spectral estimate and the finite DFT. The optimal value of q is chosen according to how well the data fits the form of a sum of complex sinusoids and, in particular, the signal-to-noise ratio. Both 1D and 2D XFT are presented with applications to experimental NMR signals.     

基于快速傅里叶变换的四种相位解包裹算法

为了快速准确地对含有噪声的包裹相位图进行相位展开,采用理论分析与计算机模拟及实验验证相结合的方法,对基于快速傅里叶变换（FFT）的四种典型算法四次FFT算法(4-FFT)、二次FFT算法（2-FFT）、四次离散余弦变换算法(4-DCT)及横向剪切干涉与FFT相结合的算法(LS-FFT)作了对比研究。结果表明:2-FFT算法运行速度最快,4-FFT算法次之,LS-FFT算法速度最慢;4-FFT算法对含有较强噪声和轻微欠采样的实验数据的处理效果是最好的;LS-FFT算法对强噪声数据的处理效果最差。     

基于快速傅里叶变换的四种相位解包裹算法

为了快速准确地对含有噪声的包裹相位图进行相位展开,采用理论分析与计算机模拟及实验验证相结合的方法,对基于快速傅里叶变换（FFT）的四种典型算法四次FFT算法(4-FFT)、二次FFT算法（2-FFT）、四次离散余弦变换算法(4-DCT)及横向剪切干涉与FFT相结合的算法(LS-FFT)作了对比研究。结果表明：2-FFT算法运行速度最快,4-FFT算法次之,LS-FFT算法速度最慢;4-FFT算法对含有较强噪声和轻微欠采样的实验数据的处理效果是最好的;LS-FFT算法对强噪声数据的处理效果最差。     

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

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

A comparison of iterative algorithms and a mixed approach for in-line X-ray phase retrieval

Previous studies have shown that iterative in-line X-ray phase retrieval algorithms may have higher precision than direct retrieval algorithms. This communication compares three iterative phase retrieval algorithms in terms of accuracy and efficiency using computer simulations. We found the Fourier transformation based algorithm (FT) is of the fastest convergence, while the Poisson-solver based algorithm (PS) has higher precision. The traditional Gerchberg-Saxton algorithm (GS) is very slow and sometimes does not converge in our tests. Then a mixed FT-PS algorithm is presented to achieve both high efficiency and high accuracy. The mixed algorithm is tested using simulated images with different noise level and experimentally obtained images of a piece of chicken breast muscle.     

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

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

Resolution-enhanced Fourier transform method for the estimation of multiple phases in interferometry

A phase shifting method based on high-resolution frequency estimation and Fourier transform technique is introduced. This method, also referred to as the eigenvector method, draws on the complementary strengths of both these methods. The salient feature of the method lies in its ability to handle nonsinusoidal wave-forms, multiple piezoelectric transducers, and arbitrary phase steps in an optical configuration. The method does not need the addition of carrier fringes to separate the spectral contents in the intensity fringes. The proposed concept thus overcomes the limitations of methods based on Fourier transform techniques. The robustness of the proposed method is studied in the presence of noise.     

基于不对称非标准傅里叶变换的光学图像加密

针对以往光学图像加密系统中输入面和频谱面对称性的缺点，在不增加系统元件的基础上，利用球面波照射不对称非标准傅里叶变换系统进行图像加密。通过把相位掩模置于该系统的傅里叶变换平面，利用不对称非标准傅里叶变换系统的输入面和频谱面的不对称性以及频谱面对于点光源相关参数的依赖性，克服了以前光学加密系统中输入面和频谱面的对称性所带来的安全隐患，并且获得了除相位掩模以外的另外四重密匙。理论分析和模拟实验表明：该方法不仅可行，而且多增加了几重密匙，增强了系统的安全性能。     

基于背景光调制的复合光傅里叶变换轮廓术

提出一种基于背景光调制的用于傅里叶变换轮廓术测量范围的复合光栅,该光栅通过调制一正弦条纹和不含任何相位信息的背景光来抑制零频,较基于相移技术的复合光栅有更大的优势:背景光只含直流分量,使得复合光栅的频谱更加简单,有利于滤出载波信息,提高测量精度;对从复合光栅中解调出来的背景光只涉及平均值校准,校准过程更为简单;解调出的背景光与物体表面的反射率成正比,具有潜在的应用价值。采用Matlab程序对该复合光栅进行了数值模拟,并对该光栅实用性进行了实验研究,结果证实了该光栅用于抑制零频、扩大傅里叶变换轮廓术测量范围的有效性,且提高了测量精度。     

基于背景光调制的复合光傅里叶变换轮廓术

提出一种基于背景光调制的用于傅里叶变换轮廓术测量范围的复合光栅,该光栅通过调制一正弦条纹和不含任何相位信息的背景光来抑制零频,较基于相移技术的复合光栅有更大的优势：背景光只含直流分量,使得复合光栅的频谱更加简单,有利于滤出载波信息,提高测量精度;对从复合光栅中解调出来的背景光只涉及平均值校准,校准过程更为简单;解调出的背景光与物体表面的反射率成正比,具有潜在的应用价值。采用Matlab程序对该复合光栅进行了数值模拟,并对该光栅实用性进行了实验研究,结果证实了该光栅用于抑制零频、扩大傅里叶变换轮廓术测量范围的有效性,且提高了测量精度。     

Optical image encryption using fractional Fourier transform and chaos

We propose a new method for image encryption using fractional Fourier transform and chaos theory. Random phase masks are generated using iterative chaos functions. The input image is combined with the first random phase mask at the object plane and is then transformed using the fractional Fourier transform. After the first fractional Fourier transform, the second random phase mask, again generated by using the chaos functions, is used at the fractional plane. The second fractional Fourier transform operation is then carried out to obtain the encrypted image. Three types of chaos functions have been used: the logistic map, the tent map and the Kaplan–Yorke map. The mean square error and the signal-to-noise ratio between the decrypted image and the input image for the correct order and the incorrect order of the fractional Fourier transform have been calculated. The computer simulations are presented to verify the validity of the proposed technique.     

教学用自组式傅里叶变换光谱仪

对原有的傅里叶变换光谱实验进行了全面的升级改造，研制了一种新型的教学用自组式傅里叶变换光谱仪，波长精度较原有实验提高了两个数量级，由该仪器构成的傅里叶变换光谱实验内涵丰富，不但可以使学生学习一种重要的光谱技术，更可以很好地培养学生综合运用所学知识解决实际问题的能力。