This paper is concerned with the Diophantine properties of the sequence {ξθn}, where 1 ≤ξ 〈 θ and θ is a rational or an algebraic integer. We establish a combinatorial proposition which can be used to study suc...This paper is concerned with the Diophantine properties of the sequence {ξθn}, where 1 ≤ξ 〈 θ and θ is a rational or an algebraic integer. We establish a combinatorial proposition which can be used to study such two cases in the same manner. It is shown that the decay rate of the Fourier transforms of self-similar measures μλ with λ = θ-1 as the uniform contractive ratio is logarithmic. This generalizes some results of Kershner and Bufetov-Solomyak, who consider the case of Bernoulli convolutions. As an application, we prove that μλ ahaost every x is normal to any base b ≥ 2, which implies that there exist infinitely many absolute normal numbers on the corresponding self-similar set. This can be seen as a complementary result of the well-known Cassels-Schmidt theorem.展开更多
In this paper, a general algorithm for the computation of the Fourier coefficients of 2π-periodic (continuous) functions is developed based on Dirichlet characters, Gauss sums and the generalized MSbius transform. ...In this paper, a general algorithm for the computation of the Fourier coefficients of 2π-periodic (continuous) functions is developed based on Dirichlet characters, Gauss sums and the generalized MSbius transform. It permits the direct extraction of the Fourier cosine and sine coefficients. Three special cases of our algorithm are presented. A VLSI architecture is presented and the error estimates are given.展开更多
This paper gives the theorems concerning the summation of trigonometric series with the help of Fourier transforms. By means of the known results of Fourier transforms, many difficult and complex problems of summation...This paper gives the theorems concerning the summation of trigonometric series with the help of Fourier transforms. By means of the known results of Fourier transforms, many difficult and complex problems of summation of trigonometric series can be solved. This method is a comparatively unusual way to find the summation of trigonometric series, and has been used to establish the comprehensive table of summation of trigonometric series. In this table 10 thousand scries arc given, and most of them are new.展开更多
If dμ is the Fourier transform of a smooth measure,dμ on the hypersphere Sn-1(n≥2)the there exists a constant C dependent only on n such that |dμ(y) |≤C(1+ |y |)-(n-1) /2 for all y∈Rn. In this paper, we show tha...If dμ is the Fourier transform of a smooth measure,dμ on the hypersphere Sn-1(n≥2)the there exists a constant C dependent only on n such that |dμ(y) |≤C(1+ |y |)-(n-1) /2 for all y∈Rn. In this paper, we show that the above statement is false for non-smooth measures. And we present the corresponding estimations far the Fourier transforms of certain non-smooth measures on Sn-1.展开更多
We give a unified treatment of Fast Fourier Transforms for UDMD systems which contains, as special cases, Fast Fourier algorithms for character groups of many subgroups associated with binary fields.
This paper extends the definition of fractional Fourier transform (FRFT) proposed by Namias V by using other orthonormal bases for L^2(R) instead of Hermite-Gaussian functions. The new orthonormal basis is gained ...This paper extends the definition of fractional Fourier transform (FRFT) proposed by Namias V by using other orthonormal bases for L^2(R) instead of Hermite-Gaussian functions. The new orthonormal basis is gained indirectly from multiresolution analysis and orthonormal wavelets. The so defined FRFT is called wavelets-fractional Fourier transform.展开更多
Deepfake-generated fake faces,commonly utilized in identity-related activities such as political propaganda,celebrity impersonations,evidence forgery,and familiar fraud,pose new societal threats.Although current deepf...Deepfake-generated fake faces,commonly utilized in identity-related activities such as political propaganda,celebrity impersonations,evidence forgery,and familiar fraud,pose new societal threats.Although current deepfake generators strive for high realism in visual effects,they do not replicate biometric signals indicative of cardiac activity.Addressing this gap,many researchers have developed detection methods focusing on biometric characteristics.These methods utilize classification networks to analyze both temporal and spectral domain features of the remote photoplethysmography(rPPG)signal,resulting in high detection accuracy.However,in the spectral analysis,existing approaches often only consider the power spectral density and neglect the amplitude spectrum—both crucial for assessing cardiac activity.We introduce a novel method that extracts rPPG signals from multiple regions of interest through remote photoplethysmography and processes them using Fast Fourier Transform(FFT).The resultant time-frequency domain signal samples are organized into matrices to create Matrix Visualization Heatmaps(MVHM),which are then utilized to train an image classification network.Additionally,we explored various combinations of time-frequency domain representations of rPPG signals and the impact of attention mechanisms.Our experimental results show that our algorithm achieves a remarkable detection accuracy of 99.22%in identifying fake videos,significantly outperforming mainstream algorithms and demonstrating the effectiveness of Fourier Transform and attention mechanisms in detecting fake faces.展开更多
Radioheliographs can obtain solar images at high temporal and spatial resolution,with a high dynamic range.These are among the most important instruments for studying solar radio bursts,understanding solar eruption ev...Radioheliographs can obtain solar images at high temporal and spatial resolution,with a high dynamic range.These are among the most important instruments for studying solar radio bursts,understanding solar eruption events,and conducting space weather forecasting.This study aims to explore the effective use of radioheliographs for solar observations,specifically for imaging coronal mass ejections(CME),to track their evolution and provide space weather warnings.We have developed an imaging simulation program based on the principle of aperture synthesis imaging,covering the entire data processing flow from antenna configuration to dirty map generation.For grid processing,we propose an improved non-uniform fast Fourier transform(NUFFT)method to provide superior image quality.Using simulated imaging of radio coronal mass ejections,we provide practical recommendations for the performance of radioheliographs.This study provides important support for the validation and calibration of radioheliograph data processing,and is expected to profoundly enhance our understanding of solar activities.展开更多
This study presents a comparative analysis of two image enhancement techniques, Continuous Wavelet Transform (CWT) and Fast Fourier Transform (FFT), in the context of improving the clarity of high-quality 3D seismic d...This study presents a comparative analysis of two image enhancement techniques, Continuous Wavelet Transform (CWT) and Fast Fourier Transform (FFT), in the context of improving the clarity of high-quality 3D seismic data obtained from the Tano Basin in West Africa, Ghana. The research focuses on a comparative analysis of image clarity in seismic attribute analysis to facilitate the identification of reservoir features within the subsurface structures. The findings of the study indicate that CWT has a significant advantage over FFT in terms of image quality and identifying subsurface structures. The results demonstrate the superior performance of CWT in providing a better representation, making it more effective for seismic attribute analysis. The study highlights the importance of choosing the appropriate image enhancement technique based on the specific application needs and the broader context of the study. While CWT provides high-quality images and superior performance in identifying subsurface structures, the selection between these methods should be made judiciously, taking into account the objectives of the study and the characteristics of the signals being analyzed. The research provides valuable insights into the decision-making process for selecting image enhancement techniques in seismic data analysis, helping researchers and practitioners make informed choices that cater to the unique requirements of their studies. Ultimately, this study contributes to the advancement of the field of subsurface imaging and geological feature identification.展开更多
Many domains, including communication, signal processing, and image processing, use the Fourier Transform as a mathematical tool for signal analysis. Although it can analyze signals with steady and transitory properti...Many domains, including communication, signal processing, and image processing, use the Fourier Transform as a mathematical tool for signal analysis. Although it can analyze signals with steady and transitory properties, it has limits. The Wavelet Packet Decomposition (WPD) is a novel technique that we suggest in this study as a way to improve the Fourier Transform and get beyond these drawbacks. In this experiment, we specifically considered the utilization of Daubechies level 4 for the wavelet transformation. The choice of Daubechies level 4 was motivated by several reasons. Daubechies wavelets are known for their compact support, orthogonality, and good time-frequency localization. By choosing Daubechies level 4, we aimed to strike a balance between preserving important transient information and avoiding excessive noise or oversmoothing in the transformed signal. Then we compared the outcomes of our suggested approach to the conventional Fourier Transform using a non-stationary signal. The findings demonstrated that the suggested method offered a more accurate representation of non-stationary and transient signals in the frequency domain. Our method precisely showed a 12% reduction in MSE and a 3% rise in PSNR for the standard Fourier transform, as well as a 35% decrease in MSE and an 8% increase in PSNR for voice signals when compared to the traditional wavelet packet decomposition method.展开更多
The author gives a characterization of the Fourier transforms of bounded bilinear forms on C*(S1)×C*(S2) of two foundation semigroups S1 and S2 in terms of Jordan *-representations, hemimogeneous random fi...The author gives a characterization of the Fourier transforms of bounded bilinear forms on C*(S1)×C*(S2) of two foundation semigroups S1 and S2 in terms of Jordan *-representations, hemimogeneous random fields, and as well as weakly harmonizable random fields of S1 and S2 into Hilbert spaces.展开更多
Texture analysis is a basic issue in image processing and computer vision, and how to attain the rotationinvariant texture characterization is a key problem. This paper proposes a rotation-invariant texture analysis t...Texture analysis is a basic issue in image processing and computer vision, and how to attain the rotationinvariant texture characterization is a key problem. This paper proposes a rotation-invariant texture analysis technique using Radon and Fourier transforms. This method uses Radon transform to convert rotation to translation, then utilizes Fourier transform and takes the moduli of the Fourier transform of these functions to make the translation invariant. A k-nearest-neighbor rule is employed to classify texture images. The proposed method is robust to additive white noise as a result of summing pixel values to generate projections in the Radon transform step. Experiment results show the feasibility of the proposed method and its robustness to additive white noise.展开更多
A general summability method, the so-called θ-summability is considered for multi-dimensional Fourier transforms. Under some conditions on θ, it is proved that the maximal operator of the θ-means defined in a cone ...A general summability method, the so-called θ-summability is considered for multi-dimensional Fourier transforms. Under some conditions on θ, it is proved that the maximal operator of the θ-means defined in a cone is bounded from the amalgam Hardy space W(hp, e∞) to W(Lp,e∞). This implies the almost everywhere convergence of the θ-means in a cone for all f ∈ W(L1, e∞) velong to L1.展开更多
In our previous papers,the classical fractional Fourier transform theory was incorporated into the quantum theoretical system using the theoretical method of quantum optics,and the calculation produced quantum mechani...In our previous papers,the classical fractional Fourier transform theory was incorporated into the quantum theoretical system using the theoretical method of quantum optics,and the calculation produced quantum mechanical operators corresponding to the generation of fractional Fourier transform.The core function of the coordinate-momentum exchange operators in the addition law of fractional Fourier transform was analyzed too.In this paper,the bivariate operator Hermite polynomial theory and the technique of integration within an ordered product of operators(IWOP)are used to establish the entanglement fractional Fourier transform theory to the extent of quantum.A new function generating formula and an operator for generating quantum entangled fractional Fourier transform are obtained using the fractional Fourier transform relationship in a pair of conjugated entangled state representations.展开更多
Let V be a star shaped region. In 2006, Colzani, Meaney and Prestini proved that if function f satisfies some condition, then the multiplier transform with the characteristic function of tV as the multiplier tends to ...Let V be a star shaped region. In 2006, Colzani, Meaney and Prestini proved that if function f satisfies some condition, then the multiplier transform with the characteristic function of tV as the multiplier tends to f almost everywhere, when t goes to∞. In this paper we use a Theorem established by K.K.Chen to show that if we change their multiplier, then the condition on f can be weakened.展开更多
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.展开更多
We study solutions to convolution equations for functions with discrete support in R^n, a special case being functions with support in the integer points. The Fourier transform of a solution can be extended to a holom...We study solutions to convolution equations for functions with discrete support in R^n, a special case being functions with support in the integer points. The Fourier transform of a solution can be extended to a holomorphic function in some domains in C^n, and we determine possible domains in terms of the properties of the convolution operator.展开更多
This paper presents an extension of certain forms of the real Paley-Wiener theorems to the Minkowski space-time algebra. Our emphasis is dedicated to determining the space-time valued functions whose space-time Fourie...This paper presents an extension of certain forms of the real Paley-Wiener theorems to the Minkowski space-time algebra. Our emphasis is dedicated to determining the space-time valued functions whose space-time Fourier transforms(SFT) have compact support using the partial derivatives operator and the Dirac operator of higher order.展开更多
Trend term removal is a key step in Fourier transform infrared spectroscopy(FTIR)data pre-processing.The most commonly used least squares(LS)method,although satisfying the real-time requirement,has many problems such ...Trend term removal is a key step in Fourier transform infrared spectroscopy(FTIR)data pre-processing.The most commonly used least squares(LS)method,although satisfying the real-time requirement,has many problems such as highly correlated initial values of the expression parameters,the need to pre-estimate the trend term shape,and poor fitting accuracy at low signal-to-noise ratios.In order to achieve real-time and robust trend term removal,a new trend term removal method using genetic programming(GP)in symbolic regression is constructed in this paper,and the FTIR simulation interference results and experimental measurement data for common volatile organic compounds(VOCs)gases are analyzed.The results show that the genetic programming algorithm can both reduce the initial value requirement and greatly improve the trend term accuracy by 20%-30% in three evaluation indicators,which is suitable for gas FTIR detection in complex scenarios.展开更多
文摘This paper is concerned with the Diophantine properties of the sequence {ξθn}, where 1 ≤ξ 〈 θ and θ is a rational or an algebraic integer. We establish a combinatorial proposition which can be used to study such two cases in the same manner. It is shown that the decay rate of the Fourier transforms of self-similar measures μλ with λ = θ-1 as the uniform contractive ratio is logarithmic. This generalizes some results of Kershner and Bufetov-Solomyak, who consider the case of Bernoulli convolutions. As an application, we prove that μλ ahaost every x is normal to any base b ≥ 2, which implies that there exist infinitely many absolute normal numbers on the corresponding self-similar set. This can be seen as a complementary result of the well-known Cassels-Schmidt theorem.
基金Supported by National Natural Science Foundation of China(11201370)the Science and Technology Program of Shaanxi Province of China(2013JM1017,2014JM1007,2014KJXX-61)the Natural Science Foundation of the Education Department of Shaanxi Province of China(2013JK0558)
文摘In this paper, a general algorithm for the computation of the Fourier coefficients of 2π-periodic (continuous) functions is developed based on Dirichlet characters, Gauss sums and the generalized MSbius transform. It permits the direct extraction of the Fourier cosine and sine coefficients. Three special cases of our algorithm are presented. A VLSI architecture is presented and the error estimates are given.
文摘This paper gives the theorems concerning the summation of trigonometric series with the help of Fourier transforms. By means of the known results of Fourier transforms, many difficult and complex problems of summation of trigonometric series can be solved. This method is a comparatively unusual way to find the summation of trigonometric series, and has been used to establish the comprehensive table of summation of trigonometric series. In this table 10 thousand scries arc given, and most of them are new.
基金This research is supported by a grant of NSF of P.R.China.
文摘If dμ is the Fourier transform of a smooth measure,dμ on the hypersphere Sn-1(n≥2)the there exists a constant C dependent only on n such that |dμ(y) |≤C(1+ |y |)-(n-1) /2 for all y∈Rn. In this paper, we show that the above statement is false for non-smooth measures. And we present the corresponding estimations far the Fourier transforms of certain non-smooth measures on Sn-1.
文摘We give a unified treatment of Fast Fourier Transforms for UDMD systems which contains, as special cases, Fast Fourier algorithms for character groups of many subgroups associated with binary fields.
基金Project supported by the Young People Foundation of Zhejiang Normal University, China (Grant No KYJ06Y07150)
文摘This paper extends the definition of fractional Fourier transform (FRFT) proposed by Namias V by using other orthonormal bases for L^2(R) instead of Hermite-Gaussian functions. The new orthonormal basis is gained indirectly from multiresolution analysis and orthonormal wavelets. The so defined FRFT is called wavelets-fractional Fourier transform.
基金supported by the National Nature Science Foundation of China(Grant Number:61962010).
文摘Deepfake-generated fake faces,commonly utilized in identity-related activities such as political propaganda,celebrity impersonations,evidence forgery,and familiar fraud,pose new societal threats.Although current deepfake generators strive for high realism in visual effects,they do not replicate biometric signals indicative of cardiac activity.Addressing this gap,many researchers have developed detection methods focusing on biometric characteristics.These methods utilize classification networks to analyze both temporal and spectral domain features of the remote photoplethysmography(rPPG)signal,resulting in high detection accuracy.However,in the spectral analysis,existing approaches often only consider the power spectral density and neglect the amplitude spectrum—both crucial for assessing cardiac activity.We introduce a novel method that extracts rPPG signals from multiple regions of interest through remote photoplethysmography and processes them using Fast Fourier Transform(FFT).The resultant time-frequency domain signal samples are organized into matrices to create Matrix Visualization Heatmaps(MVHM),which are then utilized to train an image classification network.Additionally,we explored various combinations of time-frequency domain representations of rPPG signals and the impact of attention mechanisms.Our experimental results show that our algorithm achieves a remarkable detection accuracy of 99.22%in identifying fake videos,significantly outperforming mainstream algorithms and demonstrating the effectiveness of Fourier Transform and attention mechanisms in detecting fake faces.
基金supported by the grants of National Natural Science Foundation of China(42374219,42127804)the Qilu Young Researcher Project of Shandong University.
文摘Radioheliographs can obtain solar images at high temporal and spatial resolution,with a high dynamic range.These are among the most important instruments for studying solar radio bursts,understanding solar eruption events,and conducting space weather forecasting.This study aims to explore the effective use of radioheliographs for solar observations,specifically for imaging coronal mass ejections(CME),to track their evolution and provide space weather warnings.We have developed an imaging simulation program based on the principle of aperture synthesis imaging,covering the entire data processing flow from antenna configuration to dirty map generation.For grid processing,we propose an improved non-uniform fast Fourier transform(NUFFT)method to provide superior image quality.Using simulated imaging of radio coronal mass ejections,we provide practical recommendations for the performance of radioheliographs.This study provides important support for the validation and calibration of radioheliograph data processing,and is expected to profoundly enhance our understanding of solar activities.
文摘This study presents a comparative analysis of two image enhancement techniques, Continuous Wavelet Transform (CWT) and Fast Fourier Transform (FFT), in the context of improving the clarity of high-quality 3D seismic data obtained from the Tano Basin in West Africa, Ghana. The research focuses on a comparative analysis of image clarity in seismic attribute analysis to facilitate the identification of reservoir features within the subsurface structures. The findings of the study indicate that CWT has a significant advantage over FFT in terms of image quality and identifying subsurface structures. The results demonstrate the superior performance of CWT in providing a better representation, making it more effective for seismic attribute analysis. The study highlights the importance of choosing the appropriate image enhancement technique based on the specific application needs and the broader context of the study. While CWT provides high-quality images and superior performance in identifying subsurface structures, the selection between these methods should be made judiciously, taking into account the objectives of the study and the characteristics of the signals being analyzed. The research provides valuable insights into the decision-making process for selecting image enhancement techniques in seismic data analysis, helping researchers and practitioners make informed choices that cater to the unique requirements of their studies. Ultimately, this study contributes to the advancement of the field of subsurface imaging and geological feature identification.
文摘Many domains, including communication, signal processing, and image processing, use the Fourier Transform as a mathematical tool for signal analysis. Although it can analyze signals with steady and transitory properties, it has limits. The Wavelet Packet Decomposition (WPD) is a novel technique that we suggest in this study as a way to improve the Fourier Transform and get beyond these drawbacks. In this experiment, we specifically considered the utilization of Daubechies level 4 for the wavelet transformation. The choice of Daubechies level 4 was motivated by several reasons. Daubechies wavelets are known for their compact support, orthogonality, and good time-frequency localization. By choosing Daubechies level 4, we aimed to strike a balance between preserving important transient information and avoiding excessive noise or oversmoothing in the transformed signal. Then we compared the outcomes of our suggested approach to the conventional Fourier Transform using a non-stationary signal. The findings demonstrated that the suggested method offered a more accurate representation of non-stationary and transient signals in the frequency domain. Our method precisely showed a 12% reduction in MSE and a 3% rise in PSNR for the standard Fourier transform, as well as a 35% decrease in MSE and an 8% increase in PSNR for voice signals when compared to the traditional wavelet packet decomposition method.
基金the Research Project No. 830104the Center of Excellence for Mathematics of the University of Isfahan for their financial supports
文摘The author gives a characterization of the Fourier transforms of bounded bilinear forms on C*(S1)×C*(S2) of two foundation semigroups S1 and S2 in terms of Jordan *-representations, hemimogeneous random fields, and as well as weakly harmonizable random fields of S1 and S2 into Hilbert spaces.
文摘Texture analysis is a basic issue in image processing and computer vision, and how to attain the rotationinvariant texture characterization is a key problem. This paper proposes a rotation-invariant texture analysis technique using Radon and Fourier transforms. This method uses Radon transform to convert rotation to translation, then utilizes Fourier transform and takes the moduli of the Fourier transform of these functions to make the translation invariant. A k-nearest-neighbor rule is employed to classify texture images. The proposed method is robust to additive white noise as a result of summing pixel values to generate projections in the Radon transform step. Experiment results show the feasibility of the proposed method and its robustness to additive white noise.
基金Supported by the Hungarian Scientific Research Funds (OTKA) No. K67642
文摘A general summability method, the so-called θ-summability is considered for multi-dimensional Fourier transforms. Under some conditions on θ, it is proved that the maximal operator of the θ-means defined in a cone is bounded from the amalgam Hardy space W(hp, e∞) to W(Lp,e∞). This implies the almost everywhere convergence of the θ-means in a cone for all f ∈ W(L1, e∞) velong to L1.
基金Project supported by the National Natural Science Foundation of China(Grant No.11775208)the Foundation for Young Talents at the College of Anhui Province,China(Grant Nos.gxyq2021210 and gxyq2019077)the Natural Science Foundation of the Anhui Higher Education Institutions of China(Grant Nos.KJ2020A0638 and 2022AH051586)。
文摘In our previous papers,the classical fractional Fourier transform theory was incorporated into the quantum theoretical system using the theoretical method of quantum optics,and the calculation produced quantum mechanical operators corresponding to the generation of fractional Fourier transform.The core function of the coordinate-momentum exchange operators in the addition law of fractional Fourier transform was analyzed too.In this paper,the bivariate operator Hermite polynomial theory and the technique of integration within an ordered product of operators(IWOP)are used to establish the entanglement fractional Fourier transform theory to the extent of quantum.A new function generating formula and an operator for generating quantum entangled fractional Fourier transform are obtained using the fractional Fourier transform relationship in a pair of conjugated entangled state representations.
基金Supported by the National Natural Science Foundation of China(11071065,11171306)
文摘Let V be a star shaped region. In 2006, Colzani, Meaney and Prestini proved that if function f satisfies some condition, then the multiplier transform with the characteristic function of tV as the multiplier tends to f almost everywhere, when t goes to∞. In this paper we use a Theorem established by K.K.Chen to show that if we change their multiplier, then the condition on f can be weakened.
基金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.
文摘We study solutions to convolution equations for functions with discrete support in R^n, a special case being functions with support in the integer points. The Fourier transform of a solution can be extended to a holomorphic function in some domains in C^n, and we determine possible domains in terms of the properties of the convolution operator.
基金supported by the Deanship of Scientific Research at King Khalid University,Saudi Arabia (R.G.P.1/207/43)。
文摘This paper presents an extension of certain forms of the real Paley-Wiener theorems to the Minkowski space-time algebra. Our emphasis is dedicated to determining the space-time valued functions whose space-time Fourier transforms(SFT) have compact support using the partial derivatives operator and the Dirac operator of higher order.
基金supported by JKW Program(No.M102-03)National Program(No.E0F80246).
文摘Trend term removal is a key step in Fourier transform infrared spectroscopy(FTIR)data pre-processing.The most commonly used least squares(LS)method,although satisfying the real-time requirement,has many problems such as highly correlated initial values of the expression parameters,the need to pre-estimate the trend term shape,and poor fitting accuracy at low signal-to-noise ratios.In order to achieve real-time and robust trend term removal,a new trend term removal method using genetic programming(GP)in symbolic regression is constructed in this paper,and the FTIR simulation interference results and experimental measurement data for common volatile organic compounds(VOCs)gases are analyzed.The results show that the genetic programming algorithm can both reduce the initial value requirement and greatly improve the trend term accuracy by 20%-30% in three evaluation indicators,which is suitable for gas FTIR detection in complex scenarios.