eCite Digital Repository

Efficient digital FFT convolution with boundary kernel renormalisation

Citation

Jackett, CJ and Ollington, R and Lovell, JL, Efficient digital FFT convolution with boundary kernel renormalisation, Proceedings of the International Conference on Digital Image Computing: Techniques and Applications (DICTA-13), 26-28 November 2013, Hobart, Australia, pp. 1-6. ISBN 978-1-4799-2126-3 (2013) [Refereed Conference Paper]

Copyright Statement

Copyright 2013 IEEE

DOI: doi:10.1109/DICTA.2013.6691496

Abstract

This paper describes a correction method for Fast Fourier Transform (FFT) convolution that limits boundary contamination artefacts resulting from convolution padding methods. The proposed correction method makes a single data-driven boundary condition assumption and only uses information contained within the original input signal to produce consistent convolution results and maintain data integrity. An analysis of the algorithm shows that it performs identically to the standard convolution approach with the only discernible differences being resolved at the level of machine rounding errors. The correction method can be applied at minimal cost to performance and has valuable applications for scientific data processing where algorithm efficiency and data accuracy are imperative.

Item Details

Item Type:Refereed Conference Paper
Keywords:image processing, FFT, Convolution
Research Division:Information and Computing Sciences
Research Group:Artificial Intelligence and Image Processing
Research Field:Image Processing
Objective Division:Expanding Knowledge
Objective Group:Expanding Knowledge
Objective Field:Expanding Knowledge in the Information and Computing Sciences
Author:Jackett, CJ (Mr Christopher Jackett)
Author:Ollington, R (Dr Robert Ollington)
ID Code:88575
Year Published:2013
Deposited By:Computing and Information Systems
Deposited On:2014-02-07
Last Modified:2017-11-06
Downloads:0

Repository Staff Only: item control page