2D Fourier Transform on a non-rectangular space

Click For Summary
SUMMARY

The discussion focuses on performing a 2D Fourier Transform on non-rectangular areas, specifically utilizing an Elliptic Discrete Fourier Transform (EDFT) for a linear zoom function in Blender. The proposed method involves generating a Fourier transform from an oval-bound section of an image and manipulating high frequencies to achieve desired effects without pixelation. The user seeks a comprehensive explanation and implementation examples of the EDFT algorithm, emphasizing the need for a transform that operates from the perimeter to the center of the shape.

PREREQUISITES
  • Understanding of Fourier Transform principles
  • Familiarity with Blender for visual representation
  • Knowledge of the EDFT algorithm and its applications
  • Experience with parallel computing and GPU utilization
NEXT STEPS
  • Research the Elliptic Discrete Fourier Transform (EDFT) algorithm
  • Explore implementations of 2D Fourier Transforms in non-rectangular spaces
  • Learn about pixel manipulation techniques in image processing
  • Investigate advanced GPU programming for parallelized computing tasks
USEFUL FOR

This discussion is beneficial for computer graphics developers, image processing engineers, and researchers interested in advanced Fourier Transform techniques and their applications in non-standard geometries.

tanus5
Messages
52
Reaction score
0
2D Fourier Transform on a non-rectangular area

Is it possible to perform a Fourier transform on a shape instead of a rectangular region? To be specific I am attempting to make a linear zoom function that doesn't produce any pixelation and that mimics natural blur that occurs with distance. After sketching the problem in Blender it seems that the best approach would be to utilize a frustum from an [STRIKE]ovular[/STRIKE] elliptical cone, generate a Fourier transform from an [STRIKE]oval-bound[/STRIKE] ellipse-bound section of the image, and extend the transform with additional null high frequencies to produce multiple pixels from a single pixel (or strip off high frequencies for zoom-out). Finally I would apply an inverse transform. This operation would be performed on a pixel-by-pixel basis for each pixel of the final image. As good as this may sound I'm not familiar with a Fourier transform on anything other than rectangular area. Can anyone suggest a good place to start?

Note: Computing power is not an issue for this problem as the system will be parellelized across 4096 cores at ~ 1mhz each for a total of nearly 4 teraflops of computing power using 2x 280X Radeon GPU's.
 
Last edited:
Physics news on Phys.org
After a good amount of Googling it seems that I'm looking for a variation of the EDFT algorithm (Elliptic Discrete Fourier Transform). I have not yet been able to find a comprehensive explanation of an EDFT algorithm. What I need is a comprehensive explanation of an elliptic Fourier transform and an example EDFT implementation. All I've found so far is general information that this algorithm isn't very popular which is probably why I haven't been able to find a good explanation of it. It appears that the actual EDFT loops around the perimeter and what I'm looking for is something that loops from the perimeter to the center. For use with other shapes other than the ellipse it seems that a 3D transform is needed where the third dimension is not spatial but a fuzzy (0-1) alpha value indicating the percentage of the pixel which contains the shape.
 
Last edited:

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 3 ·
Replies
3
Views
9K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 2 ·
Replies
2
Views
554