Papers
Topics
Authors
Recent
2000 character limit reached

Recovering Missing Slices of the Discrete Fourier Transform using Ghosts

Published 30 Dec 2010 in math-ph, cs.DM, math.CO, and math.MP | (1101.0076v1)

Abstract: The Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information. This incomplete coverage of Fourier space always produces systematic artefacts called Ghosts. In this paper, a fast and exact method for de-convolving cyclic artefacts caused by missing slices of the DFT is presented. The slices discussed here originate from the exact partitioning of DFT space, under the projective Discrete Radon Transform, called the Discrete Fourier Slice Theorem. The method has a computational complexity of O(n log2 n) (where n = N2) and is constructed from a new Finite Ghost theory. This theory is also shown to unify several aspects of work done on Ghosts over the past three decades. The paper concludes with a significant application to fast, exact, non-iterative image reconstruction from sets of discrete slices obtained for a limited range of projection angles.

Citations (20)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.