Steganografi Menggunakan Metode Discrete Fourier Transform (Dft) [PDF]
Jurnal Informatika Polinema, 2018 Seiring dengan kemajuan teknologi, serangan terjadi pada industri photography di mana banyak penyalahgunaan foto yang memiliki hak cipta tanpa seijin pemilik foto tersebut.
Ardiansyah, R. (Rizky) +2 more
core +4 more sources
Jurnal Sistem Cerdas, 2022 Digital image watermarking is the insertion of watermarks into digital image media. Several types of watermarking methods used are Discrete Cosine Transform (DCT) and Discrete Fourier Transform (DFT). Both of these watermarking methods work in the frequency domain (transform).
null Mukhammad Solikhin +4 more
openaire +3 more sources
Discrete Fourier Transform (DFT)-Based Computational Intelligence Model for Urban Carbon Emission and Economic Growth [PDF]
Mathematical Problems in Engineering, 2022 Economic development leads to the widespread use of energy, which results in carbon emissions. In order to determine the correlation between different urban carbon emissions and fiscal growth, a coupling and coordination model of urban carbon emissions and economic growth based on discrete Fourier transform (DFT) is constructed.
Chun Fu, Xiayun Gui, Farzana Akter
openaire +2 more sources
Comparison of Discrete Cosine Transforms (DCT), Discrete Fourier Transforms (DFT), and Discrete Wavelet Transforms (DWT) in Digital Image Watermarking [PDF]
International Journal of Advanced Computer Science and Applications, 2017 Digital Image Watermarking is used recently to secure the image by embedding another digital image. It is typically used to identify ownership of the copyright of the signal. Frequency domain transformation methods used widely in Digital Image Compression and Digital Image Watermarking.
Rosa A, Reza Agustina, Hidayatulloh -
openaire +2 more sources
The Discrete Fourier Transform (DFT) in Behavioural Analysis
Journal of Theoretical Biology, 1994 Abstract Spectral analysis is an important tool for examining time-series data and can be particularly powerful in detecting periodicity in animal behaviour patterns. Because of its simplicity and the speed of current computing algorithms, the discrete Fourier transform is most often used in spectral analysis.
T.G. Forrest, Robert B. Suter
openaire +2 more sources
Convolutional Neural Network (CNN) to Reduce Construction Loss in JPEG Compression Caused by Discrete Fourier Transform (DFT) [PDF]
, 2023 In recent decades, digital image processing has gained enormous popularity. Consequently, a number of data compression strategies have been put forth, with the goal of minimizing the amount of information required to represent images. Among them, JPEG compression is one of the most popular methods that has been widely applied in multimedia and digital ...
Suman Kunwar
openaire +3 more sources
Geometric interpretations of the Discrete Fourier Transform (DFT) [PDF]
, 1984 One, two, and three dimensional Discrete Fourier Transforms (DFT) and geometric interpretations of their periodicities are presented. These operators are examined for their relationship with the two sided, continuous Fourier transform.
Campbell, C. W.
core +2 more sources
KLASIFIKASI DAN PENINGKATAN KUALITAS CITRA SIDIK JARI MENGGUNAKAN DFT (DISCRETE FOURIER TRANSFORM)
Jurnal Infomedia, 2016 Sidik jari merupakan suatu komponen biometrik yang sering digunakan sebagai alat identifikasi yang terbukti cukup efektif karena sifatnya yang universal, unik, dan permanen pada setiap manusia. Berdasarkan jenis nya sidik jari memiliki 4 jenis yaitu berminyak, normal, kering, dan kotor.Sidik jari kering yang secara kasat mata dapat dilihat adanya garis
Cilla Sundari +2 more
openaire +2 more sources
Software and Hardware Solutions for Channel Estimation based on Cyclic Golay Sequences [PDF]
Radioengineering, 2016 This paper presents channel estimation methods based on cyclic complementary Golay sequences. First, the conventional Golay correlator is investigated, then a frequency domain approach using Discrete Fourier Transform (DFT) is provided.
B. Csuka, Z. Kollar
doaj +5 more sources
New fast algorithm for two-dimensional discrete Fourier transform DFT(2 n ; 2)
Electronics Letters, 1989 Two-dimensional fast discrete Fourier transform is computed by means of fast discrete cosine transform. This algorithm permits the transformation with a fewer multiplications and additions, when compared with the usual.
Ma, Weizhen, Yang, Dekun
openaire +2 more sources