Description: The frequency domain plays an important role in image
processing to smooth, enhance, and detect edges of images. Although
image data typically does not include imaginary values, the fast Fourier
transform (FFT) has been used for obtaining spectra. In this paper,
the fast Hartley transform (FHT) is used to transform two-dimensional
image data. Because the Hartley transform is real valued, it does
not require complex operations. Both spectra and autocorrelations of
two-dimensional ultrasound images of normal and abnormal livers were
computed. Platform: |
Size: 4096 |
Author:archit |
Hits:
Description: RTL Verilog code to perform Two Dimensional Fast Hartley Transform (2D-FHT) for 8x8 points.
Presented algorithm is FHT with decimation in frequency domain. Platform: |
Size: 12288 |
Author:gollasantu |
Hits:
Description: 我们发现了一个新的更有效率的基-2算法可以用来计算Ⅱ型离散Hartley变换（序列长度为：N =2n时）。与现有的方法比较，这种递推方法计算次数相对减少，且更容易实现。同时也提出了一种新的更有效率的算法，可以使用两个相邻的DHT-Ⅱ序列（长度分别为N/2），来计算长度为 N的Ⅱ型DHT。-We found a new more efficient base- 2 algorithm can be used to calculate Ⅱ type discrete Hartley transform (sequence length is: N = 2 N). And the existing methods, the recursive method to calculate the relative frequency decrease, and easier to realize. At the same time also puts forward a new, more efficient algorithm, can use two adjacent DHT- Ⅱ sequence (length were N/2), to calculate the length is N Ⅱ type DHT. Platform: |
Size: 258048 |
Author:张鹏 |
Hits:
Search - fast hartley transform