Click here to Skip to main content
15,173,746 members
Articles / Multimedia / GDI+
Posted 19 Nov 2009


74 bookmarked

2D FFT of an Image in C#

Rate me:
Please Sign up or sign in to vote.
4.84/5 (31 votes)
20 Jul 2012CPOL3 min read
Two dimensional Fast Fourier Transform of an image in C#.

Image 1


A Fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this article gives an overview of the available techniques and some of their general properties, while the specific algorithms are described in subsidiary articles linked below.

A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields (see discrete Fourier transform for properties and applications of the transform), but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O(N 2) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations. The difference in speed can be substantial, especially for long data sets where N may be in the thousands or millions—in practice, the computation time can be reduced by several orders of magnitude in such cases, and the improvement is roughly proportional to N/log(N). This huge improvement made many DFT-based algorithms practical; FFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for quick multiplication of large integers.

Cooley–Tukey algorithm

By far the most common FFT is the Cooley–Tukey algorithm. This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size N = N1N2 into many smaller DFTs of sizes N1 and N2, along with O(N) multiplications by complex roots of unity traditionally called twiddle factors.

This method (and the general idea of an FFT) was popularized by a publication of J. W. Cooley and J. W. Tukey in 1965, but it was later discovered (Heideman & Burrus, 1984) that those two authors had independently re-invented an algorithm known to Carl Friedrich Gauss around 1805 (and subsequently rediscovered several times in limited forms).

The most well-known use of the Cooley–Tukey algorithm is to divide the transform into two pieces of size N / 2 at each step, and is therefore limited to power-of-two sizes, but any factorization can be used in general (as was known to both Gauss and Cooley/Tukey). These are called the radix-2 and mixed-radix cases, respectively (and other variants such as the split-radix FFT have their own names as well). Although the basic idea is recursive, most traditional implementations rearrange the algorithm to avoid explicit recursion. Also, because the Cooley–Tukey algorithm breaks the DFT into smaller DFTs, it can be combined arbitrarily with any other algorithm for the DFT, such as those described below.

Using the code

First, we read the selected image into a 2D array of integers; we are using a pointer based image reading for the same. The code is as follows:

private void ReadImage()
    int i, j;
    GreyImage = new int[Width, Height];  //[Row,Column]
    Bitmap image = Obj;
    BitmapData bitmapData1 = 
       image.LockBits(new Rectangle(0, 0, image.Width, image.Height),
       ImageLockMode.ReadOnly, PixelFormat.Format32bppArgb);
        byte* imagePointer1 = (byte*)bitmapData1.Scan0;

        for (i = 0; i < bitmapData1.Height; i++)
            for (j = 0; j < bitmapData1.Width; j++)
                GreyImage[j, i] = (int)((imagePointer1[0] + 
                   imagePointer1[1] + imagePointer1[2]) / 3.0);
                //4 bytes per pixel
                imagePointer1 += 4;
            }//end for j
            //4 bytes per pixel
            imagePointer1 += bitmapData1.Stride - (bitmapData1.Width * 4);
        }//end for i
    }//end unsafe

FFT of an image will be a complex array; we need to store this thing, so we define a complex structure for the same.

struct COMPLEX
    public double real, imag;
    public COMPLEX(double x, double y)
        real = x;
        imag = y;
    public float Magnitude()
        return ((float)Math.Sqrt(real * real + imag * imag));
    public float Phase()
         return ((float)Math.Atan(imag / real));

The FFT is implemented using the separability property of a Fourier transform. We find the FFT of the rows of an image and then the columns.

Points of interest

The Fourier plot is generated, frequency shifting is performed on the complex Fourier coefficients array, and using dynamic range compression, we generate the Fourier plot. 

Original C++ code used for Reference can be found Here (Thank to Paul Bourke)



This is my first article on FFT, any suggestions and modifications are welcome.


This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


About the Author

Comments and Discussions

GeneralRe: 2D FFT final return Pin
chamara547-Aug-12 20:43
Memberchamara547-Aug-12 20:43 
GeneralMy vote of 5 Pin
Manoj Kumar Choubey28-Mar-12 1:35
professionalManoj Kumar Choubey28-Mar-12 1:35 
GeneralThanks Pin
Caspilar28-Apr-11 19:51
MemberCaspilar28-Apr-11 19:51 
Generalshifting th image Pin
hooper195416-Mar-11 9:28
Memberhooper195416-Mar-11 9:28 
GeneralRe: shifting th image Pin
QuantumDJ20-May-13 3:41
MemberQuantumDJ20-May-13 3:41 
Generalfft and ifft Pin
N. krishnam19-Jul-10 4:03
MemberN. krishnam19-Jul-10 4:03 
GeneralError [fix] Pin
Dadsy3-Mar-10 13:43
MemberDadsy3-Mar-10 13:43 
GeneralGreat article Pin
aldo hexosa18-Feb-10 16:32
professionalaldo hexosa18-Feb-10 16:32 
Thanks man. i have been searching FFT article in c#. Would you give me some example comparing 2 images using FFT?
GeneralMessage Removed Pin
23-Dec-09 9:29
professionalN_tro_P23-Dec-09 9:29 
GeneralRe: Inverse FFT issue Pin
Dr. Vinayak Ashok Bharadi23-Dec-09 18:01
MemberDr. Vinayak Ashok Bharadi23-Dec-09 18:01 
GeneralMessage Removed Pin
15-Dec-09 11:13
professionalN_tro_P15-Dec-09 11:13 
GeneralMessage Removed Pin
15-Dec-09 12:16
professionalN_tro_P15-Dec-09 12:16 
GeneralMessage Removed Pin
15-Dec-09 12:21
professionalN_tro_P15-Dec-09 12:21 
GeneralRe: [My vote of 2] Simple but lacking Pin
Dr. Vinayak Ashok Bharadi18-Dec-09 21:36
MemberDr. Vinayak Ashok Bharadi18-Dec-09 21:36 
Questiononly on gray images? Pin
cifftsifir2-Dec-09 4:27
Membercifftsifir2-Dec-09 4:27 
AnswerRe: only on gray images? Pin
Dr. Vinayak Ashok Bharadi2-Dec-09 17:49
MemberDr. Vinayak Ashok Bharadi2-Dec-09 17:49 
GeneralRe: only on gray images? Pin
cifftsifir2-Dec-09 20:49
Membercifftsifir2-Dec-09 20:49 
GeneralRe: only on gray images? Pin
cifftsifir4-Dec-09 3:59
Membercifftsifir4-Dec-09 3:59 
GeneralRe: only on gray images? Pin
Dr. Vinayak Ashok Bharadi4-Dec-09 17:35
MemberDr. Vinayak Ashok Bharadi4-Dec-09 17:35 
GeneralRe: only on gray images? Pin
Amarnath S11-Dec-09 4:27
professionalAmarnath S11-Dec-09 4:27 
GeneralComplex angle Pin
syutzy20-Nov-09 4:19
Membersyutzy20-Nov-09 4:19 
GeneralRe: Complex angle Pin
Dr. Vinayak Ashok Bharadi20-Nov-09 17:52
MemberDr. Vinayak Ashok Bharadi20-Nov-09 17:52 
GeneralNeeds More Pin
#realJSOP20-Nov-09 0:36
mva#realJSOP20-Nov-09 0:36 
GeneralRe: Needs More Pin
f r i s c h20-Nov-09 5:44
Memberf r i s c h20-Nov-09 5:44 
GeneralRe: Needs More Pin
Andre Sanches (alvs)20-Nov-09 7:26
MemberAndre Sanches (alvs)20-Nov-09 7:26 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.