Similar in nature to an image mosaic, a photo-stencil is a rendering of a binary target image by an arrangement of smaller binary stencil images. This paper presents a method for efficiently creating photo-stencil images, making use of the Fast Fourier Transform to speed up costly computations. The resulting photo-stencils are a new and interesting form of nonphotorealistic rendering.

We calculate the local Fourier transformations for a class of Q l -sheaves. In particular, we verify a conjecture of Laumon and Malgrange ([L] 2.6.3).

This paper describes the use of a resynthesis strategy in testing an auditory model, specifically a version of the DOMIN model. The steps by which the original speech is processed to produce a reduced, auditory (DOMIN) spectrum are described; subsequently, the reduced representation is used to produce resynthesised speech having the same auditory spectrum. In light ofthis equivalence, the exten...

This paper looks at one of the jewels of mathematics, the Fourier series / transform and briefly surveys its applications and looks at possible ways of enhancing the performance of the fast Fourier transform

We calculate the local Fourier transformations for a class of Q l -sheaves. In particular, we verify a conjecture of Laumon and Malgrange ([L] 2.6.3).

The paper presents the Kinectofon, an instrument for creating sounds through free-hand interaction in a 3D space. The instrument is based on the RGB and depth image streams retrieved from a Microsoft Kinect sensor device. These two image streams are used to create di↵erent types of motiongrams, which, again, are used as the source material for a sonification process based on inverse FFT. The in...

We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coe cients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...

In this paper, we examine the FFT of sequences x„ = xN + „ with period N that satisfy certain symmetric relations. It is known that one can take advantage of these relations in order to reduce the computing time required by the FFT. For example, the time required for the FFT of a real sequence is about half that required for the FFT of a complex sequence. Also, the time required for the FFT of ...

We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framework is mathematically based on the Cooley-Tukey mapping, and implemented as a C++ template meta-program. Avoiding run-time overhead, all specializations are performed statically.