fast hartley transform 中文意思是什麼
fast hartley transform
解釋
快速哈特利變換-
Though the two new methods can improve the effect of edge detection, they need the gabor and wavelet transforms which make the computation complex and cost much time and are not easy to used in real - time application. this paper presents an efficient fast approach to compute real discrete gabor coefficients by applying the fht ( fast hartley transform ) in gabor transform, also the fft ( fast fourier transform ) is proposed to used in compute the wavelet coefficients
雖然gabor和小波的引入能提高邊緣檢測的效果，但往往因其計算的復雜性而受到限制，本文提出了一種有效的離散gabor變換演算法來計算有限離散實數信號的gabor系數，同時，也給出了基於fft的小波變換快速演算法，為理論的快速實現提供了可能性。 -
It is shown that, due to the real operations, the computation of the bi - orthogonal analysis window, the transforms coefficients, and the reconstruction of the original signal in rdgt case, can be significantly reduced as compared with the computation of those in the cdgt case. and the similarity between the rdgt and the discrete hartley transform ( dht ) allows the rdgt to utilize the fast dht algorithms for fast computation. meanwhile, the rdgt bears a simple relationship with the cdgt such that the cdgt coefficients can be directly computed from the rdgt coefficients
主要內容有：研究了一維和二維實值離散gabor變換（ rdgt ）方法，這種方法由於僅涉及實數運算，並可利用快速離散hartley變換演算法加速變換，因而在計算雙正交分析窗、變換系數以及信號重建方面都比復值離散gabor變換（ cdgt ）簡單易於實現，並且rdgt系數與cdgt系數的實部和虛部有著非常簡單的關系，因此前者的計算完全可以替代後者的計算，從而達到明顯減小gabor變換計算量的目的。
分享友人