Simplified fractional Fourier transforms

The fractional Fourier transform (FRFT) has been used for many years, and it is useful in many applications. Most applications of the FRFT are based on the design of fractional filters (such as removal of chirp noise and the fractional Hilbert transform) or on fractional correlation (such as scaled space-variant pattern recognition). In this study we introduce several types of simplified fractional Fourier transform (SFRFT). Such transforms are all special cases of a linear canonical transform (an affine Fourier transform or an ABCD transform). They have the same capabilities as the original FRFT for design of fractional filters or for fractional correlation. But they are simpler than the original FRFT in terms of digital computation, optical implementation, implementation of gradient-index media, and implementation of radar systems. Our goal is to search for the simplest transform that has the same capabilities as the original FRFT. Thus we discuss not only the formulas and properties of the SFRFT's but also their implementation. Although these SFRFT's usually have no additivity properties, they are useful for the practical applications. They have great potential for replacing the original FRFT's in many applications.     

Optical implementations of two-dimensional fractional fourier transforms and linear canonical transforms with arbitrary parameters

We provide a general treatment of optical two-dimensional fractional Fourier transforming systems. We not only allow the fractional Fourier transform orders to be specified independently for the two dimensions but also allow the input and output scale parameters and the residual spherical phase factors to be controlled. We further discuss systems that do not allow all these parameters to be controlled at the same time but are simpler and employ a fewer number of lenses. The variety of systems discussed and the design equations provided should be useful in practical applications for which an optical fractional Fourier transforming stage is to be employed.     

Eigenfunctions of the offset Fourier,fractional Fourier,and linear canonical transforms

The offset Fourier transform (offset FT), offset fractional Fourier transform (offset FRFT), and offset linear canonical transform (offset LCT) are the space-shifted and frequency-modulated versions of the original transforms. They are more general and flexible than the original ones. We derive the eigenfunctions and the eigenvalues of the offset FT, FRFT, and LCT. We can use their eigenfunctions to analyze the self-imaging phenomena of the optical system with free spaces and the media with the transfer function exp[j(h2x2 + h1x + h0)] (such as lenses and shifted lenses). Their eigenfunctions are also useful for resonance phenomena analysis, fractal theory development, and phase retrieval.     

Perspective projections in the space-frequency plane and fractional Fourier transforms

Perspective projections in the space-frequency plane are analyzed, and it is shown that under certain conditions they can be approximately modeled in terms of the fractional Fourier transform. The region of validity of the approximation is examined. Numerical examples are presented.     

Optical correlation based on the fractional Fourier transform

Some properties of optical correlation based on the fractional Fourier transform are analyzed. For a particular set of fractional orders, a filter is obtained that becomes insensitive to scale variations of the object. An optical configuration is also proposed to carry out the fractional correlation in a flexible way, and some experimental results are shown.     

Optical transformation from chirplet to fractional Fourier transformation kernel

We find a new integration transformation which can convert a chirplet function to a fractional Fourier transformation kernel; this new transformation is invertible and obeys Parseval theorem. Under this transformation a new relationship between a phase space function and its Weyl–Wigner quantum correspondence operator is revealed.     

Generalized prolate spheroidal wave functions for optical finite fractional Fourier and linear canonical transforms

Prolate spheroidal wave functions (PSWFs) are known to be useful for analyzing the properties of the finite-extension Fourier transform (fi-FT). We extend the theory of PSWFs for the finite-extension fractional Fourier transform, the finite-extension linear canonical transform, and the finite-extension offset linear canonical transform. These finite transforms are more flexible than the fi-FT and can model much more generalized optical systems. We also illustrate how to use the generalized prolate spheroidal functions we derive to analyze the energy-preservation ratio, the self-imaging phenomenon, and the resonance phenomenon of the finite-sized one-stage or multiple-stage optical systems.     

分数傅里叶变换域的彩色图像非对称光学压缩加密

为了提高传统双随机相位编码图像光学加密系统的安全性,并减少其所需要处理的数据量,提出了一种基于压缩感知及量子Logistic混沌映射的彩色图像非对称光学加密方法。针对彩色图像加密过程中所需要处理数据量过大问题,首先利用压缩感知理论减少加密系统所需要处理的数据量,其次,将彩色图像三通道转换为单通道加密来减少数据量。针对传统光学加密系统为线性系统问题,采用基于相位截断的非对称光学加密方法进行加密。针对光学加密系统加密密钥为随机相位板不方便传输问题,利用量子混沌产生系统所需要的随机相位板。结果表明,此算法可以获得较为理想的图像加密和解密效果。     

Optical beam propagation in gain media written in terms of complex-order Fourier transforms

The optical beam propagation in gain media is represented in terms of fractional-order Fourier transforms. It is shown that in a uniform amplifying medium characterized by a linear gain there exists a complex-order Fourier transform between the fields on two ‘complex-spherical’ reference surfaces of the given radii and separation. Analytical expressions for the transform order and scale factors are derived and, as an application example, the resonator with Gaussian reflectivity mirrors and linear gain medium is illustrated.     

Linear and nonlinear generalized Fourier transforms

This article presents an overview of a transform method for solving linear and integrable nonlinear partial differential equations. This new transform method, proposed by Fokas, yields a generalization and unification of various fundamental mathematical techniques and, in particular, it yields an extension of the Fourier transform method.     

Fractional Fourier transforms in two dimensions

We analyze the fractionalization of the Fourier transform (FT), starting from the minimal premise that repeated application of the fractional Fourier transform (FrFT) a sufficient number of times should give back the FT. There is a qualitative increase in the richness of the solution manifold, from U(1) (the circle S1) in the one-dimensional case to U(2) (the four-parameter group of 2 x 2 unitary matrices) in the two-dimensional case [rather than simply U(1) x U(1)]. Our treatment clarifies the situation in the N-dimensional case. The parameterization of this manifold (a fiber bundle) is accomplished through two powers running over the torus T2 = S1 x S1 and two parameters running over the Fourier sphere S2. We detail the spectral representation of the FrFT: The eigenvalues are shown to depend only on the T2 coordinates; the eigenfunctions, only on the S2 coordinates. FrFT's corresponding to special points on the Fourier sphere have for eigenfunctions the Hermite-Gaussian beams and the Laguerre-Gaussian beams, while those corresponding to generic points are SU(2)-coherent states of these beams. Thus the integral transform produced by every Sp(4, R) first-order system is essentially a FrFT.     

Interpolation by fast Fourier and Chebyshev transforms

Transform methods for the interpolation of regularly spaced data are described, based on fast evaluation using discrete Fourier transforms. For periodic data adequately sampled, the fast Fourier transform (FFT) is used directly. With undersampled or aperiodic data, a Chebyshev interpolating polynomial is evaluated by means of the FFT to provide minimum deviation and distributed ripple. The merits of two kinds of Chebyshev series are compared. All the methods described produce an interpolation passing directly through the given values and are applied easily to the multi-dimensional case.     

Optical image encryption based on compressive sensing and chaos in the fractional Fourier domain

We propose a novel image encryption algorithm based on compressive sensing (CS) and chaos in the fractional Fourier domain. The original image is dimensionality reduction measured using CS. The measured values are then encrypted using chaotic-based double-random-phase encoding technique in the fractional Fourier transform domain. The measurement matrix and the random-phase masks used in the encryption process are formed from pseudo-random sequences generated by the chaotic map. In this proposed algorithm, the final result is compressed and encrypted. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys for distribution simultaneously. Numerical experiments verify the validity and security of the proposed algorithm.     

Double-lens extended fractional Fourier transform

A double-lens extended fractional Fourier transform (EFRT) is proposed. In the double-lens setup, arbitrary-order EFRTs including real orders and complex orders can be carried out. To verify that the single-lens EFRT and the double-lens EFRT are equivalent, numerical simulations and optical experiments for the real-order EFRT and the complex-order EFRT are performed. Their results indicate that the double-lens EFRT is consistent with the single-lens EFRT. Thus the double-lens setup can be regarded as another basic optical configuration. Compared with the single-lens EFRT, the double-lens EFRT has some advantages.     

Coincidence subwavelength fractional Fourier transform

The coincidence subwavelength fractional Fourier transforms (FRTs) with entangled photon pairs and incoherent light radiation are introduced as an extension of the recently introduced coincidence FRT. Optical systems for implementing the coincidence subwavelength FRTs are designed. The width of the coincidence subwavelength FRT pattern is two times narrower than the width of the coincidence FRT. The coincidence subwavelength FRT with partially coherent light radiation is also studied numerically. Differences between the coincidence subwavelength FRT with entangled photon pairs and that with incoherent light radiation are discussed.     

Generalizing, optimizing, and inventing numerical algorithms for the fractional Fourier, Fresnel, and linear canonical transforms

By use of matrix-based techniques it is shown how the space-bandwidth product (SBP) of a signal, as indicated by the location of the signal energy in the Wigner distribution function, can be tracked through any quadratic-phase optical system whose operation is described by the linear canonical transform. Then, applying the regular uniform sampling criteria imposed by the SBP and linking the criteria explicitly to a decomposition of the optical matrix of the system, it is shown how numerical algorithms (employing interpolation and decimation), which exhibit both invertibility and additivity, can be implemented. Algorithms appearing in the literature for a variety of transforms (Fresnel, fractional Fourier) are shown to be special cases of our general approach. The method is shown to allow the existing algorithms to be optimized and is also shown to permit the invention of many new algorithms.     

Eigenfunctions of the complex fractional Fourier transform obtained in the context of quantum optics

We employ the recently established basis (the two-variable Hermite-Gaussian function) of the generalized Bargmann space (BGBS) [Phys. Lett. A303, 311 (2002)] to study the generalized form of the fractional Fourier transform (FRFT). By using the technique of integration within an ordered product of operators and the bipartite entangled-state representations, we derive the generalized generating function of the BGBS with which the undecomposable kernel of the two-dimensional FRFT [also named complex fractional Fourier transform (CFRFT)] is obtained. This approach naturally shows that the BGBS is just the eigenfunction of the CFRFT.     

Optical wavelet transforms from computer-generated holography

An optical implementation of a wavelet transform is presented. Optical Haar wavelets are created by the use of computer-generated holography. Two different holographic techniques are explored: (1) interferogram and (2) detour-phase. A discrete representation of a continuous wavelet transform is obtained by the optical correlation of an image with a Haar mother wavelet. Experimental results are compared with their digital simulations.     

Optical Security System with Fourier Plane encoding

We propose a new technique for security verification of personal documents and other forms of personal identifications such as ID cards, passports, or credit cards. In this technique a primary pattern that might be a phase-encoded image is convolved by a random code. The information is phase encoded on the personal document. Therefore the information cannot be reproduced by an intensity detector such as a CCD camera. An optical processor based on the nonlinear joint transform correlator is used to perform the verification and the validation of documents with this technique. By verification of the biometrics information and the random code simultaneously, the proposed optical system determines whether a card is authentic or is being used by an authorized person. We tested the performance of the optical system for security and validation in the presence of input noise and in the presence of distortion of the information on the card. The performance of the proposed method is evaluated by use of a number of metrics. Statistical analysis of the system is performed to investigate the noise tolerance and the discrimination against false inputs for security verification.