Recovering missing slices of the discrete Fourier transform using Ghosts

The discrete Fourier transform (DFT) underpins the solution to many inverse problems commonly possessing missing or unmeasured frequency information. This incomplete coverage of the Fourier space always produces systematic artifacts called Ghosts. In this paper, a fast and exact method for deconvolving cyclic artifacts caused by missing slices of the DFT using redundant image regions is presented. The slices discussed here originate from the exact partitioning of the Discrete Fourier Transform (DFT) space, under the projective Discrete Radon Transform, called the discrete Fourier slice theorem. The method has a computational complexity of O(n log(2) n) (for an n=N×N image) and is constructed from a new cyclic theory of Ghosts. This theory is also shown to unify several aspects of work done on Ghosts over the past three decades. This paper concludes with an application to fast, exact, non-iterative image reconstruction from a highly asymmetric set of rational angle projections that give rise to sets of sparse slices within the DFT.