Topic
Discrete sine transform
About: Discrete sine transform is a research topic. Over the lifetime, 3269 publications have been published within this topic receiving 73181 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A novel image encryption algorithm is proposed based on the multiple-parameter fractions of Fourier transform, which is a generalized fractional Fouriertransform, without the use of phase keys, and shows superior robustness to blind decryption.
Abstract: A novel image encryption algorithm is proposed based on the multiple-parameter fractional Fourier transform, which is a generalized fractional Fourier transform, without the use of phase keys. The image is encrypted simply by performing a multiple-parameter fractional Fourier transform with four keys. Optical implementation is suggested. The method has been compared with existing methods and shows superior robustness to blind decryption.
102 citations
102 citations
TL;DR: Derivation based on both the sequence splitting and Kronecker matrix product method are discussed, which has the advantage that all the underlying operations are shown clearly, while the matrix product representations are more compact and readily generalized to higher dimensions.
Abstract: The discrete cosine transform (2-D DCT) is based on a one-dimensional fast cosine transform (1-D FCT) algorithm. Instead of computing the 2-D transform using the row-column method, the 1-D algorithm is extended by means of the vector-radix approach. Derivation based on both the sequence splitting and Kronecker matrix product method are discussed. The sequence splitting approach has the advantage that all the underlying operations are shown clearly, while the matrix product representations are more compact and readily generalized to higher dimensions. The bit reversal operations are placed before the recursive additions so that the recursive operations can be performed in a very regular manner. This greatly simplifies the indexing problem in the software implementation of the algorithms. The vector-radix algorithm saves 25% multiplications as compared with the row-column method. >
102 citations
TL;DR: The purpose of this paper is to show that the main results on nonlinear functions can be easily generalized to the case of arbitrary abelian groups if the Walsh-Hadamard transform is replaced by the discrete Fourier transform.
102 citations