Application of Discrete and Fast Fourier Transforms to Increase the Speed of Multiscale Image Analysis
Application of Discrete and Fast Fourier Transforms to Increase the Speed of Multiscale Image Analysis
Author(s): Viliam Ďuriš, Vladimir A. Semenov, Sergey G. ChumarovSubject(s): Electronic information storage and retrieval, Education and training
Published by: UIKTEN - Association for Information Communication Technology Education and Science
Keywords: Discrete fourier transform (DFT); fast fourier transform (FFT); fast wavelet transform (FWT); frequency domain; Mallat algorithm
Summary/Abstract: The paper compares the accuracy of reconstruction using different wavelets, and the authors also use fast and discrete Fourier transforms together to calculate the forward and inverse continuous wavelet transform in the frequency domain. Due to the use of calculations in the frequency domain, it becomes possible to perform decomposition, reconstruction, image filtering, and other transformations with high performance and precision. For multiscale signal analysis, a wavelet with a rectangular amplitude-frequency response has been constructed, which allows for an increase in the accuracy of decomposition and reconstruction compared to the Mallat algorithm presented in Matlab computer mathematics. At the same time, the time of multiscale analysis is reduced several times compared to the Mallat algorithm.
Journal: TEM Journal
- Issue Year: 13/2024
- Issue No: 1
- Page Range: 349-354
- Page Count: 6
- Language: English
