首页> 外文会议>Conference on real-time image and video processing >Fast DCT-based image convolution algorithms and application to image resampling and hologram reconstruction
【24h】

Fast DCT-based image convolution algorithms and application to image resampling and hologram reconstruction

机译:基于快速DCT的图像卷积算法及其在图像重采样和全息图重构中的应用

获取原文

摘要

Convolution and correlation are very basic image processing operations with numerous applications ranging from image restoration to target detection to image resampling and geometrical transformation. In real time applications, the crucial issue is the processing speed, which implies mandatory use of algorithms with the lowest possible computational complexity. Fast image convolution and correlation with large convolution kernels are traditionally carried out in the domain of Discrete Fourier Transform computed using Fast Fourier Transform algorithms. However standard DFT based convolution implements cyclic convolution rather than linear one and, because of this, suffers from heavy boundary effects. We introduce a fast DCT based convolution algorithm, which is virtually free of boundary effects of the cyclic convolution. We show that this algorithm have the same or even lower computational complexity as DFT-based algorithm and demonstrate its advantages in application examples of image arbitrary translation and scaling with perfect discrete sine-interpolation and for image scaled reconstruction from holograms digitally recorded in near and far diffraction zones. In geometrical resampling the scaling by arbitrary factor is implemented using the DFT domain scaling algorithm and DCT-based convolution. In scaled hologram reconstruction in far diffraction zones the Fourier reconstruction method with simultaneous scaling is implemented using DCT-based convolution. In scaled hologram reconstruction in near diffraction zones the convolutional reconstruction algorithm is implemented by the DCT-based convolution.
机译:卷积和相关性是非常基本的图像处理操作,其应用范围很广,从图像恢复到目标检测再到图像重采样和几何变换。在实时应用中,关键问题是处理速度,这意味着必须以尽可能低的计算复杂性来强制使用算法。传统上,快速图像卷积和与大卷积核的相关性是在使用快速傅立叶变换算法计算的离散傅立叶变换的领域中进行的。但是,基于标准DFT的卷积实现的是循环卷积,而不是线性卷积,因此,卷积受边界影响很大。我们介绍了一种基于快速DCT的卷积算法,该算法实际上不受循环卷积的边界影响。我们证明了该算法与基于DFT的算法具有相同甚至更低的计算复杂度,并证明了它在具有完美离散正弦插值的图像任意平移和缩放的应用示例中以及从近距离和远距离数字记录的全息图进行图像缩放重建的应用示例中的优势衍射区。在几何重采样中,使用DFT域缩放算法和基于DCT的卷积实现按任意因子缩放。在远衍射区的缩放全息图重构中,使用基于DCT的卷积实现了同时缩放的傅立叶重构方法。在近衍射区的缩放全息图重建中,卷积重建算法是通过基于DCT的卷积实现的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号