首页 | 本学科首页   官方微博 | 高级检索  
     

用多项式变换计算多维离散W变换
引用本文:曾泳泓,李晓梅. 用多项式变换计算多维离散W变换[J]. 计算数学, 1998, 20(3): 291-298
作者姓名:曾泳泓  李晓梅
作者单位:国防科技大学
基金项目:国家自然科学基金!19601012,国防九五预研基金
摘    要:
1.引言多维离散W变换作为多维离散Hartley变换的推广[1-3],是处理多维问题的一种工具.在计算机视觉、高清晰度电视(HDTV)以及可视电话等领域,经常要对运动图象进行分析和处理,通常称为多帧检测(Multi-WameDetection,简称MFD)[4-5],这时三维离散w变换是一种可行的方法.由于不需要进行复数运算,比三维离散傅立叶交换(DFT)有优越性.而对运动的三维图象进行处理时,可采用四维离散w变换.对维数更高的多维信号进行处理时,可采用多维离散w变换.对三维以上的w变换,需要的运算量非常大,设计好的快速算法极为重要…

关 键 词:快速算法 离散变换 信号处理 多项式变换 W变换

COMPUTING MULTI-DIMENSIONAL DISCRETE W TRANSFORMS BY POLYNOMIAL TRANSFORMS
Zeng Yong-hong, Li Xiao-mei. COMPUTING MULTI-DIMENSIONAL DISCRETE W TRANSFORMS BY POLYNOMIAL TRANSFORMS[J]. Mathematica Numerica Sinica, 1998, 20(3): 291-298
Authors:Zeng Yong-hong   Li Xiao-mei
Affiliation:Zeng Yong-hong; Li Xiao-mei(National University of Defense Technology, Changsha)
Abstract:
In this paper, the Multi-dimensional Polynomial Transform is used to convert the Multi-dimensional W Transform (MDDWT) into a series of one-dimensional W transform (DWT). Thus, a new polynomial transform algorithms for MDDWT is obtained. The algorithm needs no complex number operations and is simple in structure. The number of multiplications for computing a r-d DWT is only times that of the common used row-column method. The number of additions is also reduced considerablely. Running time of the algorithm on micro-computers is given and is compared with the common used row-column method.
Keywords:fast algorithm   discrete transform   multi-dimensionalsignal processing
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号