首页> 外文会议>Signal Processing X: Theories and Applications >Decomposition of 2D Hypercomplex Fourier Transforms into Pairs of Complex Fourier Transforms
【24h】

Decomposition of 2D Hypercomplex Fourier Transforms into Pairs of Complex Fourier Transforms

机译:将2D超复杂傅立叶变换分解为成对的复杂傅立叶变换

获取原文

摘要

Hypercomplex 2D Fourier transforms have been proposed by several authors with applications in image processing of both grayscale and colour images. Previously published works on hypercomplex Fourier transforms have utilized direct evaluation of a Fast Fourier transform using hypercomplex arithmetic. This paper shows that such transforms may be implemented by decomposition into two independent complex Fourier transforms and may thus be implemented by building upon existing complex code. This is a significant step because it makes available to researchers using hypercomplex Fourier transforms all the investment made by others in efficient complex FFT implementations, and requires substantially less effort than coding hypercomplex versions of existing code.
机译:几位作者已经提出了超复杂2D傅里叶变换,并将其应用于灰度和彩色图像的图像处理中。先前发表的有关超复杂傅立叶变换的著作已经利用超复杂算术对快速傅立叶变换进行了直接评估。本文表明,可以通过分解为两个独立的复杂傅立叶变换来实现此类转换,并因此可以通过在现有的复杂代码上进行构建来实现。这是重要的一步,因为它使使用超复杂傅立叶变换的研究人员可以使用傅立叶变换来转换其他人在高效复杂FFT实现中的所有投资,并且比对现有代码的超复杂版本进行编码所需的工作量要少得多。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号