The discrete fractional Fourier transform (DFRFT) is the generalization of discrete Fourier transform. Many types of DFRFT have been derived and are useful for signal processing applications. We introduce a new type of DFRFT, which are unitary, reversible, and flexible; in addition, the closed-form analytic expression can be obtained. It works in performance similar to the continuous fractional Fourier transform (FRFT) and can be efficiently calculated by the FFT. Since the continuous FRFT can be generalized into the continuous affine Fourier transform (AFT) (the so-called canonical transform), we also extend the DFRFT into the discrete affine Fourier transform (DAFT). We derive two types of the DFRFT and DAFT. Type 1 is similar to the continuous FRFT and AFT and can be used for computing the continuous FRFT and AFT. Type 2 is the improved form of type 1 and can be used for other applications of digital signal processing. Meanwhile, many important properties continuous FRFT and AFT are kept in the closed-form DFRFT and DAFT, and some applications, such as filter design and pattern recognition, are also discussed. The closed-form DFRFT we introduce has the lowest complexity among all current DFRFTs that is still similar to the continuous FRFT.

Bearing fault diagnosis has attracted significant attention over the past few decades. It consists of two major parts: vibration signal feature extraction and condition classification for the extracted features. In this paper, multiscale permutation entropy (MPE) was introduced for feature extraction from faulty bearing vibration signals. After extracting feature vectors by MPE, the support vector machine (SVM) was applied to automate the fault diagnosis procedure. Simulation results demonstrated that the proposed method is a very powerful algorithm for bearing fault diagnosis and has much better performance than the methods based on single scale permutation entropy (PE) and multiscale entropy (MSE).

The linear canonical transform (the LCT) is a useful tool for optical system analysis and signal processing. It is parameterized by a 2/spl times/2 matrix {a, b, c, d}. Many operations, such as the Fourier transform (FT), fractional Fourier transform (FRFT), Fresnel transform, and scaling operations are all the special cases of the LCT. We discuss the eigenfunctions of the LCT. The eigenfunctions of the FT, FRFT, Fresnel transform, and scaling operations have been known, and we derive the eigenfunctions of the LCT based on the eigenfunctions of these operations. We find, for different cases, that the eigenfunctions of the LCT also have different forms. When |a+d|2, the eigenfunctions become the chirp multiplication and chirp convolution of self-similar functions (fractals). Besides, since many optical systems can be represented by the LCT, we can thus use the eigenfunctions of the LCT derived in this paper to discuss the self-imaging phenomena in optics. We show that there are usually varieties of input functions that can cause the self-imaging phenomena for an optical system.

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(h_2{x}^2+h_{1}x+h_0)]$ (such as lenses and shifted lenses). Their eigenfunctions are also useful for resonance phenomena analysis, fractal theory development, and phase retrieval.

Images captured in a hazy environment usually suffer from bad visibility and missing information. Over many years, learning-based and handcrafted prior-based dehazing algorithms have been rigorously developed. However, both algorithms exhibit some weaknesses in terms of haze removal performance. Therefore, in this work, we have proposed the patch-map-based hybrid learning DehazeNet, which integrates these two strategies by using a hybrid learning technique involving the patch map and a bi-attentive generative adversarial network. In this method, the reasons limiting the performance of the dark channel prior (DCP) have been analyzed. A new feature called the patch map has been defined for selecting the patch size adaptively. Using this map, the limitations of the DCP (e.g., color distortion and failure to recover images involving white scenes) can be addressed efficiently. In addition, to further enhance the performance of the method for haze removal, a patch-map-based DCP has been embedded into the network, and this module has been trained with the atmospheric light generator, patch map selection module, and refined module simultaneously. A combination of traditional and learning-based methods can efficiently improve the haze removal performance of the network. Experimental results show that the proposed method can achieve better reconstruction results compared to other state-of-the-art haze removal algorithms.