This paper introduces an efficient image cryptography system.The pro-posed image cryptography system is based on employing the two-dimensional(2D)chaotic henon map(CHM)in the Discrete Fourier Transform(DFT).The propos...This paper introduces an efficient image cryptography system.The pro-posed image cryptography system is based on employing the two-dimensional(2D)chaotic henon map(CHM)in the Discrete Fourier Transform(DFT).The proposed DFT-based CHM image cryptography has two procedures which are the encryption and decryption procedures.In the proposed DFT-based CHM image cryptography,the confusion is employed using the CHM while the diffu-sion is realized using the DFT.So,the proposed DFT-based CHM image crypto-graphy achieves both confusion and diffusion characteristics.The encryption procedure starts by applying the DFT on the image then the DFT transformed image is scrambled using the CHM and the inverse DFT is applied to get the final-ly encrypted image.The decryption procedure follows the inverse procedure of encryption.The proposed DFT-based CHM image cryptography system is exam-ined using a set of security tests like statistical tests,entropy tests,differential tests,and sensitivity tests.The obtained results confirm and ensure the superiority of the proposed DFT-based CHM image cryptography system.These outcomes encourage the employment of the proposed DFT-based CHM image cryptography system in real-time image and video applications.展开更多
The discrete Fourier transform(DFT) is used for fractional Brownian motion(FBM) surface synthesis in tribology(i.e., contact, sliding, and sealing, etc). However, the relationship between fractal parameters(fra...The discrete Fourier transform(DFT) is used for fractional Brownian motion(FBM) surface synthesis in tribology(i.e., contact, sliding, and sealing, etc). However, the relationship between fractal parameters(fractal dimension and scale factor) and traditional parameters, the influence of fractal parameters on surface appearance, have not been deeply discussed yet. These lead to some kind of difficulty to ensure the synthesized surfaces with ideal fractal characteristic, required traditional parameters and geometric appearance. A quantitative relationship between fractal parameters and the root mean square deviation of surface (Sq) is derived based on the energy conservation property between the space and frequency domain of DFT. Under the stability assumption, the power spectrum of a FBM surface is composed of concentric circles strictly, a series of FBM surfaces with prescribed Sq could be synthesized with given fractal dimension, scale factor, and sampling numbers, but the ten-point height(Sz), the skewness(Ssk) and the kurtosis(Sku) are still in random, where the probability distributions of Sz and Ssk are approximately normal distribution. Furthermore, by iterative searching, a surface with desired Abbott-Firestone curve could be obtained among those surfaces. An intuitive explanation for the influence of fractal dimension and scale factor on surface appearance is obtained by discussing the effects on the ratio of energy between high and low frequency components. Based on the relationship between Sq and surface energy, a filtering method of surface with controllable Sq is proposed. The proposed research ensures the synthesized surfaces possess ideal FBM properties with prescribed Sq, offers a method for selecting desired Abbott-Firestone curve of synthesized fractal surfaces, and makes it possible to control the Sq of surfaces after filtering.展开更多
In this paper, the two-dimensional Warped Discrete Fourier Transform (2-D WDFT) is developed based on the concept of the 1-D WDFT. An exact computation algorithm is developed for 2-D WDFT based on matrix factorizing...In this paper, the two-dimensional Warped Discrete Fourier Transform (2-D WDFT) is developed based on the concept of the 1-D WDFT. An exact computation algorithm is developed for 2-D WDFT based on matrix factorizing with special structure. A fast algorithm is then proposed to reduce greatly the computational complexity of the inverse 2-D WDFT. Finally, numerical examples are given to show the efficiency of the proposed approach.展开更多
This paper investigates the generalized Parseval’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Parseval’s theorem reduces to an inequality w...This paper investigates the generalized Parseval’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Parseval’s theorem reduces to an inequality with lower and upper bounds associated with FRFT parameters, named as generalized Parseval’s theorem by us. These results theoretically provide potential valuable applications in filtering, and examples of filtering for LFM signals in FRFT domains are demonstrated to support the derived conclusions.展开更多
This letter deals with the frequency domain Blind Source Separation of Convolutive Mixtures (CMBSS). From the frequency representation of the "overlap and save", a Weighted General Discrete Fourier Transform...This letter deals with the frequency domain Blind Source Separation of Convolutive Mixtures (CMBSS). From the frequency representation of the "overlap and save", a Weighted General Discrete Fourier Transform (WGDFT) is derived to replace the traditional Discrete Fourier Transform (DFT). The mixing matrix on each frequency bin could be estimated more precisely from WGDFT coefficients than from DFT coefficients, which improves separation performance. Simulation results verify the validity of WGDFT for frequency domain blind source separation of convolutive mixtures.展开更多
In this paper a novel technique, Authentication and Secret Message Transmission using Discrete Fourier Transformation (ASMTDFT) has been proposed to authenticate an image and also some secret message or image can be t...In this paper a novel technique, Authentication and Secret Message Transmission using Discrete Fourier Transformation (ASMTDFT) has been proposed to authenticate an image and also some secret message or image can be transmitted over the network. Instead of direct embedding a message or image within the source image, choosing a window of size 2 x 2 of the source image in sliding window manner and then con-vert it from spatial domain to frequency domain using Discrete Fourier Transform (DFT). The bits of the authenticating message or image are then embedded at LSB within the real part of the transformed image. Inverse DFT is performed for the transformation from frequency domain to spatial domain as final step of encoding. Decoding is done through the reverse procedure. The experimental results have been discussed and compared with the existing steganography algorithm S-Tools. Histogram analysis and Chi-Square test of source image with embedded image shows the better results in comparison with the S-Tools.展开更多
The numerical algorithms for finding the lines of branching and branching-off solutions of nonlinear problem on mean-square approximation of a real finite nonnegative function with respect to two variables by the modu...The numerical algorithms for finding the lines of branching and branching-off solutions of nonlinear problem on mean-square approximation of a real finite nonnegative function with respect to two variables by the modulus of double discrete Fourier transform dependent on two parameters, are constructed and justified.展开更多
Presents a digital watermarking technique based on discrete fractional Fourier transform (DFRFT), discusses the transformation of the original image by DFRFT, and the modification of DFRFT coefficients of the original...Presents a digital watermarking technique based on discrete fractional Fourier transform (DFRFT), discusses the transformation of the original image by DFRFT, and the modification of DFRFT coefficients of the original image by the information of watermark, and concludes from experimental results that the proposed technique is robust to lossy compression attack.展开更多
This work presents a computational matrix framework in terms of tensor signal algebra for the formulation of discrete chirp Fourier transform algorithms. These algorithms are used in this work to estimate the point ta...This work presents a computational matrix framework in terms of tensor signal algebra for the formulation of discrete chirp Fourier transform algorithms. These algorithms are used in this work to estimate the point target functions (impulse response functions) of multiple-input multiple-output (MIMO) synthetic aperture radar (SAR) systems. This estimation technique is being studied as an alternative to the estimation of point target functions using the discrete cross-ambiguity function for certain types of environmental surveillance applications. The tensor signal algebra is presented as a mathematics environment composed of signal spaces, finite dimensional linear operators, and special matrices where algebraic methods are used to generate these signal transforms as computational estimators. Also, the tensor signal algebra contributes to analysis, design, and implementation of parallel algorithms. An instantiation of the framework was performed by using the MATLAB Parallel Computing Toolbox, where all the algorithms presented in this paper were implemented.展开更多
Alpha helix is a common type of secondary structure in the protein structure that consists of repeating helical turns. Patterns in the protein sequences that cause this repetitive pattern in the structure have long be...Alpha helix is a common type of secondary structure in the protein structure that consists of repeating helical turns. Patterns in the protein sequences that cause this repetitive pattern in the structure have long been sought. We used the discrete Fourier transform (DFT) to detect the periodicity signals correlated to the helical structure. We studied the distribution of multiple properties along the protein sequence, and found a property that showed strong periodicity correlated with the helical structure. Using a short-time Fourier transform (STFT) method, we investigated the amplitude of the periodical signals at each amino acid position. The results show that residues in the helix structure tend to display higher amplitudes than residues outside of the helices. This tendency is dramatically strengthen when sequence profiles obtained from multiple alignment were used to detect the periodicity. A simple method that predicted helices based on the amplitude yielded overall true positive rate (TPR) of 63%, 49% sensitivity, 72% specificity, and 0.22 Matthews Correlation Coefficient (MCC). The performance seemed to depend on the length of helices that the proteins had.展开更多
The application of traditional synchronous measurement methods is limited by frequent fluctuations of electrical signals and complex frequency components in distribution networks.Therefore,it is critical to find solut...The application of traditional synchronous measurement methods is limited by frequent fluctuations of electrical signals and complex frequency components in distribution networks.Therefore,it is critical to find solutions to the issues of multifrequency parameter estimation and synchronous measurement estimation accuracy in the complex environment of distribution networks.By utilizing the multifrequency sensing capabilities of discrete Fourier transform signals and Taylor series for dynamic signal processing,a multifrequency signal estimation approach based on HT-IpDFT-STWLS(HIpST)for distribution networks is provided.First,by introducing the Hilbert transform(HT),the influence of noise on the estimation algorithm is reduced.Second,signal frequency components are obtained on the basis of the calculated signal envelope spectrum,and the interpolated discrete Fourier transform(IpDFT)frequency coarse estimation results are used as the initial values of symmetric Taylor weighted least squares(STWLS)to achieve high-precision parameter estimation under the dynamic changes of the signal,and the method increases the number of discrete Fourier.Third,the accuracy of this proposed method is verified by simulation analysis.Data show that this proposed method can accurately achieve the parameter estimation of multifrequency signals in distribution networks.This approach provides a solution for the application of phasor measurement units in distribution networks.展开更多
We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementat...We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementation of the schemes would be an important step toward complex quantum computation in the ion trap system.展开更多
This letter proposes a new method for concurrent voiced speech separation. Firstly the Wrapped Discrete Fourier Transform (WDFT) is used to decompose the harmonic spectra of the mixed speeches. Then the individual spe...This letter proposes a new method for concurrent voiced speech separation. Firstly the Wrapped Discrete Fourier Transform (WDFT) is used to decompose the harmonic spectra of the mixed speeches. Then the individual speech is reconstructed by using the sinusoidal speech model. By taking advantage of the non-uniform frequency resolution of WDFT, harmonic spectra parameters can be estimated and separated accurately. Experimental results on mixed vowels separation show that the proposed method can recover the original speeches effectively.展开更多
The mismatch between echo and replica caused by underwater moving target(UMT)'s radial velocity degrades the detection performance of the matched filter(MF)for the linear frequency modulation(LFM)signal.By using t...The mismatch between echo and replica caused by underwater moving target(UMT)'s radial velocity degrades the detection performance of the matched filter(MF)for the linear frequency modulation(LFM)signal.By using the focusing property of fractional Fourier transform(FRFT)to that signal,a detection algorithm for UMT's LFM echo based on the discrete fractional Fourier transform(DFRFT)is proposed.This algorithm is less affected by the target's radial velocity compared with the other MF detection algorithm utilizing zero radial velocity replica(ZRVR),and the mathematical relation between the output peak positions of these two algorithms exists in the case of existence of target echo.The algorithm can also estimate the target distance by using this relation.The simulation and experiment show that this algorithm'sdetection performance is better than or equivalent to that of the other MF algorithm utilizing ZRVR for the LFM echo of UMT with unknown radial velocity under reverberation noise background.展开更多
The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method fo...The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method for computing Fourier transforms, the authors present parallel implementations of two new algorithms developed for the type IV Discrete Cosine Transform (DCT-IV) which support the new interleaved fast Fourier transform method. The authors discuss the realizations of their implementations using two paradigms. The first involved commodity equipment and the Message-Passing Interface (MPI) library. The second utilized the RapidMind development platform and the Cell Broadband Engine (BE) processor. These experiments indicate that the authors' rotation-based algorithm is preferable to their lifting-based algorithm on the platforms tested, with increased efficiency demonstrated by their MPI implementation for large data sets. Finally, the authors outline future work by discussing an architecture-oriented method for computing DCT-IVs which promises further optimization. The results indicate a promising fresh direction in the search for efficient ways to compute Fourier transforms.展开更多
基金This research was funded by Deanship of Scientific Research,Taif University Researches Supporting Project number(TURSP-2020/216),Taif University,Taif,Saudi Arabia.
文摘This paper introduces an efficient image cryptography system.The pro-posed image cryptography system is based on employing the two-dimensional(2D)chaotic henon map(CHM)in the Discrete Fourier Transform(DFT).The proposed DFT-based CHM image cryptography has two procedures which are the encryption and decryption procedures.In the proposed DFT-based CHM image cryptography,the confusion is employed using the CHM while the diffu-sion is realized using the DFT.So,the proposed DFT-based CHM image crypto-graphy achieves both confusion and diffusion characteristics.The encryption procedure starts by applying the DFT on the image then the DFT transformed image is scrambled using the CHM and the inverse DFT is applied to get the final-ly encrypted image.The decryption procedure follows the inverse procedure of encryption.The proposed DFT-based CHM image cryptography system is exam-ined using a set of security tests like statistical tests,entropy tests,differential tests,and sensitivity tests.The obtained results confirm and ensure the superiority of the proposed DFT-based CHM image cryptography system.These outcomes encourage the employment of the proposed DFT-based CHM image cryptography system in real-time image and video applications.
基金supported by National Natural Science Foundation of China(Grant Nos.51175085,51205062)Fujian Provincial Natural Science Foundation of China(Grant Nos.2011J01299,2012J01206)Development Foundation for Science and Technology of Fuzhou University,China(Grant No.2011-XY-10)
文摘The discrete Fourier transform(DFT) is used for fractional Brownian motion(FBM) surface synthesis in tribology(i.e., contact, sliding, and sealing, etc). However, the relationship between fractal parameters(fractal dimension and scale factor) and traditional parameters, the influence of fractal parameters on surface appearance, have not been deeply discussed yet. These lead to some kind of difficulty to ensure the synthesized surfaces with ideal fractal characteristic, required traditional parameters and geometric appearance. A quantitative relationship between fractal parameters and the root mean square deviation of surface (Sq) is derived based on the energy conservation property between the space and frequency domain of DFT. Under the stability assumption, the power spectrum of a FBM surface is composed of concentric circles strictly, a series of FBM surfaces with prescribed Sq could be synthesized with given fractal dimension, scale factor, and sampling numbers, but the ten-point height(Sz), the skewness(Ssk) and the kurtosis(Sku) are still in random, where the probability distributions of Sz and Ssk are approximately normal distribution. Furthermore, by iterative searching, a surface with desired Abbott-Firestone curve could be obtained among those surfaces. An intuitive explanation for the influence of fractal dimension and scale factor on surface appearance is obtained by discussing the effects on the ratio of energy between high and low frequency components. Based on the relationship between Sq and surface energy, a filtering method of surface with controllable Sq is proposed. The proposed research ensures the synthesized surfaces possess ideal FBM properties with prescribed Sq, offers a method for selecting desired Abbott-Firestone curve of synthesized fractal surfaces, and makes it possible to control the Sq of surfaces after filtering.
基金This work was supported by the National Natural Science Foundation of China (No. 60172048).
文摘In this paper, the two-dimensional Warped Discrete Fourier Transform (2-D WDFT) is developed based on the concept of the 1-D WDFT. An exact computation algorithm is developed for 2-D WDFT based on matrix factorizing with special structure. A fast algorithm is then proposed to reduce greatly the computational complexity of the inverse 2-D WDFT. Finally, numerical examples are given to show the efficiency of the proposed approach.
文摘This paper investigates the generalized Parseval’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Parseval’s theorem reduces to an inequality with lower and upper bounds associated with FRFT parameters, named as generalized Parseval’s theorem by us. These results theoretically provide potential valuable applications in filtering, and examples of filtering for LFM signals in FRFT domains are demonstrated to support the derived conclusions.
基金the grant from the Ph.D. Programs Foun-dation of Ministry of Education of China (No. 20060280003)the Shanghai Leading Academic Dis-cipline Project (Project No.T0102).
文摘This letter deals with the frequency domain Blind Source Separation of Convolutive Mixtures (CMBSS). From the frequency representation of the "overlap and save", a Weighted General Discrete Fourier Transform (WGDFT) is derived to replace the traditional Discrete Fourier Transform (DFT). The mixing matrix on each frequency bin could be estimated more precisely from WGDFT coefficients than from DFT coefficients, which improves separation performance. Simulation results verify the validity of WGDFT for frequency domain blind source separation of convolutive mixtures.
文摘In this paper a novel technique, Authentication and Secret Message Transmission using Discrete Fourier Transformation (ASMTDFT) has been proposed to authenticate an image and also some secret message or image can be transmitted over the network. Instead of direct embedding a message or image within the source image, choosing a window of size 2 x 2 of the source image in sliding window manner and then con-vert it from spatial domain to frequency domain using Discrete Fourier Transform (DFT). The bits of the authenticating message or image are then embedded at LSB within the real part of the transformed image. Inverse DFT is performed for the transformation from frequency domain to spatial domain as final step of encoding. Decoding is done through the reverse procedure. The experimental results have been discussed and compared with the existing steganography algorithm S-Tools. Histogram analysis and Chi-Square test of source image with embedded image shows the better results in comparison with the S-Tools.
文摘The numerical algorithms for finding the lines of branching and branching-off solutions of nonlinear problem on mean-square approximation of a real finite nonnegative function with respect to two variables by the modulus of double discrete Fourier transform dependent on two parameters, are constructed and justified.
文摘Presents a digital watermarking technique based on discrete fractional Fourier transform (DFRFT), discusses the transformation of the original image by DFRFT, and the modification of DFRFT coefficients of the original image by the information of watermark, and concludes from experimental results that the proposed technique is robust to lossy compression attack.
文摘This work presents a computational matrix framework in terms of tensor signal algebra for the formulation of discrete chirp Fourier transform algorithms. These algorithms are used in this work to estimate the point target functions (impulse response functions) of multiple-input multiple-output (MIMO) synthetic aperture radar (SAR) systems. This estimation technique is being studied as an alternative to the estimation of point target functions using the discrete cross-ambiguity function for certain types of environmental surveillance applications. The tensor signal algebra is presented as a mathematics environment composed of signal spaces, finite dimensional linear operators, and special matrices where algebraic methods are used to generate these signal transforms as computational estimators. Also, the tensor signal algebra contributes to analysis, design, and implementation of parallel algorithms. An instantiation of the framework was performed by using the MATLAB Parallel Computing Toolbox, where all the algorithms presented in this paper were implemented.
文摘Alpha helix is a common type of secondary structure in the protein structure that consists of repeating helical turns. Patterns in the protein sequences that cause this repetitive pattern in the structure have long been sought. We used the discrete Fourier transform (DFT) to detect the periodicity signals correlated to the helical structure. We studied the distribution of multiple properties along the protein sequence, and found a property that showed strong periodicity correlated with the helical structure. Using a short-time Fourier transform (STFT) method, we investigated the amplitude of the periodical signals at each amino acid position. The results show that residues in the helix structure tend to display higher amplitudes than residues outside of the helices. This tendency is dramatically strengthen when sequence profiles obtained from multiple alignment were used to detect the periodicity. A simple method that predicted helices based on the amplitude yielded overall true positive rate (TPR) of 63%, 49% sensitivity, 72% specificity, and 0.22 Matthews Correlation Coefficient (MCC). The performance seemed to depend on the length of helices that the proteins had.
基金supported by the State Grid Corporation of China Headquarters Management Science and Technology Project(No.526620200008).
文摘The application of traditional synchronous measurement methods is limited by frequent fluctuations of electrical signals and complex frequency components in distribution networks.Therefore,it is critical to find solutions to the issues of multifrequency parameter estimation and synchronous measurement estimation accuracy in the complex environment of distribution networks.By utilizing the multifrequency sensing capabilities of discrete Fourier transform signals and Taylor series for dynamic signal processing,a multifrequency signal estimation approach based on HT-IpDFT-STWLS(HIpST)for distribution networks is provided.First,by introducing the Hilbert transform(HT),the influence of noise on the estimation algorithm is reduced.Second,signal frequency components are obtained on the basis of the calculated signal envelope spectrum,and the interpolated discrete Fourier transform(IpDFT)frequency coarse estimation results are used as the initial values of symmetric Taylor weighted least squares(STWLS)to achieve high-precision parameter estimation under the dynamic changes of the signal,and the method increases the number of discrete Fourier.Third,the accuracy of this proposed method is verified by simulation analysis.Data show that this proposed method can accurately achieve the parameter estimation of multifrequency signals in distribution networks.This approach provides a solution for the application of phasor measurement units in distribution networks.
基金The project supported by National Natural Science Foundation of China under Grant No. 10225421 and Funds from Fuzhou University
文摘We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementation of the schemes would be an important step toward complex quantum computation in the ion trap system.
基金Supported by the National Natural Science Foundation of China (No.60172048).
文摘This letter proposes a new method for concurrent voiced speech separation. Firstly the Wrapped Discrete Fourier Transform (WDFT) is used to decompose the harmonic spectra of the mixed speeches. Then the individual speech is reconstructed by using the sinusoidal speech model. By taking advantage of the non-uniform frequency resolution of WDFT, harmonic spectra parameters can be estimated and separated accurately. Experimental results on mixed vowels separation show that the proposed method can recover the original speeches effectively.
基金Sponsored by National Nature Science Foundation of China(60472101)
文摘The mismatch between echo and replica caused by underwater moving target(UMT)'s radial velocity degrades the detection performance of the matched filter(MF)for the linear frequency modulation(LFM)signal.By using the focusing property of fractional Fourier transform(FRFT)to that signal,a detection algorithm for UMT's LFM echo based on the discrete fractional Fourier transform(DFRFT)is proposed.This algorithm is less affected by the target's radial velocity compared with the other MF detection algorithm utilizing zero radial velocity replica(ZRVR),and the mathematical relation between the output peak positions of these two algorithms exists in the case of existence of target echo.The algorithm can also estimate the target distance by using this relation.The simulation and experiment show that this algorithm'sdetection performance is better than or equivalent to that of the other MF algorithm utilizing ZRVR for the LFM echo of UMT with unknown radial velocity under reverberation noise background.
文摘The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method for computing Fourier transforms, the authors present parallel implementations of two new algorithms developed for the type IV Discrete Cosine Transform (DCT-IV) which support the new interleaved fast Fourier transform method. The authors discuss the realizations of their implementations using two paradigms. The first involved commodity equipment and the Message-Passing Interface (MPI) library. The second utilized the RapidMind development platform and the Cell Broadband Engine (BE) processor. These experiments indicate that the authors' rotation-based algorithm is preferable to their lifting-based algorithm on the platforms tested, with increased efficiency demonstrated by their MPI implementation for large data sets. Finally, the authors outline future work by discussing an architecture-oriented method for computing DCT-IVs which promises further optimization. The results indicate a promising fresh direction in the search for efficient ways to compute Fourier transforms.