Implement slow and fast discrete normal and inverse Fourier transform. During the implementation of fast variant the number of arithmetic operations as well as the amount of the needed memory should be minimized: (@rostekus)
[ ] (T1) - Normal and inverse fast Fourier transform with decimation in spatial domain.
[ ] Visualization of Fourier spectrum.
Implementation of the following filters in frequency domain:
[ ] (F1) Low-pass filter (high-cut filter).
[ ] (F2) High-pass filter (low-cut filter).
[ ] (F3) Band-pass filter.
[ ] (F4) Band-cut filter.
[ ] (F5) High-pass filter with detection of edge direction
[ ] (F6) Phase modifying filter
In all the variants the special attention should be paid to implementation efficiency (reduction of needed memory, reduction of execution time).
Implement slow and fast discrete normal and inverse Fourier transform. During the implementation of fast variant the number of arithmetic operations as well as the amount of the needed memory should be minimized: (@rostekus)
In all the variants the special attention should be paid to implementation efficiency (reduction of needed memory, reduction of execution time).