检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]安徽大学计算智能与信号处理教育部重点实验室,安徽合肥230039
出 处:《计算机技术与发展》2007年第10期50-53,共4页Computer Technology and Development
基 金:国家自然科学基金(60572128);安徽省人才开发资金(2005Z029);安徽大学人才队伍建设项目;安徽大学创新团队基金
摘 要:Gabor变换在很多领域被认为是非常有用的方法,然而实时应用却因其很高的计算复杂性而受到限制。为了减小计算复杂性,曾提出了基于DCT的实值离散Gabor变换。文中回顾了基于DCT的实值离散Gabor变换,为了有效地和快速地计算实值离散Gabor变换,提出了在临界抽样条件下,一维实值离散Gabor变换系数求解的块时间递归算法以及由变换系数重建原信号的块时间递归算法,研究了该算法使用并行格型结构的实现方法,并讨论和比较了算法的计算复杂性和优越性。The Gabor transform has been recognized as a very useful method in diverse areas. However, its real time applications were limited due to its high computational complexity, To reduce the computational complexity, the real - valued discrete Gabor transform based on DCT was presented in our previous work, In this paper, firstly, the real - valued discrete Gabor transform based on DCT will be briefly reviewed; secondly, block time - recursive algorithms for the efficient and fast computation of the 1 - D RDGT coefficients and for the fast reconstruction of the original signal from the RDGT coefficients will be developed in critical sampling case; thirdly, unified parallel lattice srructures for the implementation of the algorithms will be studied; and finally, the computational complexity and the advantages of the proposed algorithms will be diseussed and compared.
关 键 词:基于DCT的实值离散Gabor变换 并行格型结构 块时间递归算法
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28