二維信號(hào)內(nèi)插的新算法
A NEW ALGORITHM FOR INTERPOLATION OF 2-D SIGNAL
-
摘要: 本文將一維子序列FFT內(nèi)插算法推廣到二維,并給出二維子序列FHT內(nèi)插算法對(duì)于需要以低取樣率存貯或傳輸圖象和重構(gòu)圖象質(zhì)量要求較高的場(chǎng)合,本算法特別有用。同時(shí),新算法還適合并行處理。
-
關(guān)鍵詞:
- 信號(hào)內(nèi)插算法; FFT算法; 快速哈脫萊變換
Abstract: The subsequence interpolation algorithm using FFT has been generalized for interpolation of 2-D signal. The subsequence interpolation algorithm using FHT for 2-D signal is proposed. The algorithm will be useful when one needs to store or transmit an image sampled at lower rate and reconstruct it later with better quality. This new algorithm is more suitable for parallel processing. -
K.P.Prasad, P. Sathyanaragana, Electron. Lett., 22(1986)4, 185-187.[2]J.W.Adams, IEEE Trans. on CAS, CAS-34(1987)5, 568-570.[3]J.I. Agbinya, Proc. IEEE, 75(1987)4, 523-524.[4]C.Y. Hsu, T.P.Lin, Electron. Lett., 24(1988)4, 223-224.[5]P. Sathyanarayana et al., IEEE Trans. on CAS, CAS-37(1990)5, 623-625.[6]茅一民,分離矢量基二維哈脫萊變換算法,數(shù)據(jù)采集與處理,1989年,第2期,第1-6頁(yè). -
計(jì)量
- 文章訪問(wèn)數(shù): 1895
- HTML全文瀏覽量: 157
- PDF下載量: 467
- 被引次數(shù): 0