- Abstract:
-
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where doing fast Fourier transforms without complete data would be desirable. In this paper it is recognised that formulating the FFT algorithm as a belief network allows suitable priors to be set for the Fourier coefficients. Furthermore efficient generalised belief propagation methods between clusters of four nodes enable the Fourier coefficients to be inferred and the missing data to be estimated in near to ${\cal O}(n \log n)$ time, where $n$ is the total of the given and missing data points. This method is compared with a number of common approaches such as setting missing data to zero or to interpolation. It is tested on generated data and for a Fourier analysis of a damaged audio signal.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-0363,
- author = {
Amos Storkey
},
- title = {Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data},
- book title = {Advances in Neural Information Processing Systems (NIPS2003)},
- publisher = {MIT Press},
- year = 2004,
- volume = {16},
- url = {http://books.nips.cc/papers/files/nips16/NIPS2003_AA55.pdf},
- }
|
