Discrete Gyrator Transforms: Computational Algorithms and Applications
As an extension of the 2D fractional Fourier transform (FRFT) and a special case of the 2D linear canonical transform (LCT), the gyrator transform was introduced to produce rotations in twisted space/spatial-frequency planes. It is a useful tool in optics, signal processing and image processing. In this paper, we develop discrete gyrator transforms (DGTs) based on the 2D LCT. Taking the advantage of the additivity property of the 2D LCT, we propose three kinds of DGTs, each of which is a cascade of low-complexity operators. These DGTs have different constraints, characteristics, and properties, and are realized by different computational algorithms. Besides, we propose a kind of DGT based on the eigenfunctions of the gyrator transform. This DGT is an orthonormal transform, and thus its comprehensive properties, especially the additivity property, make it more useful in many applications. We also develop an efficient computational algorithm to significantly reduce the complexity of this DGT. At the end, a brief review of some important applications of the DGTs is presented, including mode conversion, sampling and reconstruction, watermarking, and image encryption.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Non-reciprocal Components Based on Switched Transmission Lines
Non-reciprocal components, such as isolators and circulators, are critical to wireless communication and radar applications. Traditionally, non-reciprocal components have been implemented using ferrite materials, which e…
Gyrator-Capacitor Modeling of a Continuously Variable Series Reactor in Different Operating Modes
Continuously Variable Series Reactor (CVSR) can regulate its reactance on the ac side using the nonlinear ferromagnetic core, shared by an ac and a dc winding for applications like power flow control, oscillation damping…
Extensions on low-complexity DCT approximations for larger blocklengths based on minimal angle similarity
The discrete cosine transform (DCT) is a central tool for image and video coding because it can be related to the Karhunen-Lo\`eve transform (KLT), which is the optimal transform in terms of retained transform coefficien…
Fast Data-independent KLT Approximations Based on Integer Functions
The Karhunen-Lo\`eve transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. Its ability to condense energy compression i…
Dimensionality ReductionImage CompressionVideo CompressionIterative execution of discrete and inverse discrete Fourier transforms with applications for signal denoising via sparsification
We describe a family of iterative algorithms that involve the repeated execution of discrete and inverse discrete Fourier transforms. One interesting member of this family is motivated by the discrete Fourier transform u…
Denoising