Abstract
Abstract The fractional Fourier transform (FrFT) is a major tool in signal and image processing. Since its computation for analog signals includes the evaluation of improper integrals involving e − x 2 , x ∈ R , several methods have been proposed to approximate the FrFT for various signals. These methods include spectral decomposition techniques, which are based on the theory of second-order self-adjoint operators. This approach led to a tremendous stream of research on various spectral decomposition methods, including multiparameter and randomized transforms. In this paper, we introduce generalized discrete transforms that extend the known discrete-type transforms and introduce new types as well. The derivations are carried out in both unitary and non-unitary settings. The strengths of the proposed transforms are demonstrated through numerical simulations and applications in image encryption and watermarking.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
