2D FFT (fft2) in SciPy - Step-by-Step Execution

Concept Flow - 2D FFT (fft2)

Start with 2D data array

↓

Apply 2D FFT (fft2)

↓

Transform spatial data to frequency domain

↓

Get complex frequency coefficients

↓

Use coefficients for analysis or visualization

↓

End

The 2D FFT transforms a 2D array from spatial domain to frequency domain, producing complex coefficients representing frequency components.

Execution Sample

SciPy

import numpy as np
from scipy.fft import fft2

arr = np.array([[1, 2], [3, 4]])
result = fft2(arr)
print(result)

This code computes the 2D FFT of a 2x2 array and prints the complex frequency coefficients.

Execution Table

Step	Action	Input Data	Operation	Output (complex array)
1	Input 2D array	[[1, 2], [3, 4]]	Prepare data for FFT	[[1, 2], [3, 4]]
2	Apply fft2	[[1, 2], [3, 4]]	Compute 2D FFT	[[10.+0.j, -2.+0.j], [-4.+0.j, 0.+0.j]]
3	Output result	[[1, 2], [3, 4]]	Print FFT result	[[10.+0.j, -2.+0.j], [-4.+0.j, 0.+0.j]]
4	End	-	-	FFT complete

💡 FFT computation finished for 2x2 input array

Variable Tracker

Variable	Start	After fft2	Final
arr	[[1, 2], [3, 4]]	[[1, 2], [3, 4]]	[[1, 2], [3, 4]]
result	None	[[10.+0.j, -2.+0.j], [-4.+0.j, 0.+0.j]]	[[10.+0.j, -2.+0.j], [-4.+0.j, 0.+0.j]]

Key Moments - 3 Insights

Why does the fft2 output contain complex numbers?

The fft2 output shows complex numbers because it represents both amplitude and phase of frequency components, as seen in execution_table step 2.

Why is the first element of the FFT result (10.+0.j) larger than others?

The first element is the DC component (sum of all input values), which is why it is larger, as shown in execution_table step 2.

Does fft2 change the shape of the input array?

No, fft2 keeps the output shape the same as input, confirmed by variable_tracker showing result shape matches arr.

Visual Quiz - 3 Questions

Look at the execution_table at step 2, what is the fft2 output for the input [[1, 2], [3, 4]]?

A [[0.+0.j, 0.+0.j], [0.+0.j, 0.+0.j]]

B [[1.+0.j, 2.+0.j], [3.+0.j, 4.+0.j]]

C [[10.+0.j, -2.+0.j], [-4.+0.j, 0.+0.j]]

D [[4.+0.j, 3.+0.j], [2.+0.j, 1.+0.j]]

💡 Hint

Check the 'Output (complex array)' column in execution_table row with Step 2.

At which step in the execution_table does the fft2 computation happen?

A Step 2

B Step 1

C Step 3

D Step 4

💡 Hint

Look for the step where 'Compute 2D FFT' is the operation.

If the input array changes to [[2, 2], [2, 2]], what would happen to the first fft2 output element?

A It would be 4.+0.j

B It would be 8.+0.j

C It would be 0.+0.j

D It would be -2.+0.j

💡 Hint

The first fft2 element is the sum of all input values, see variable_tracker for 'arr' values.

Concept Snapshot

2D FFT (fft2) transforms a 2D array from spatial to frequency domain.
Input and output arrays have the same shape.
Output contains complex numbers representing frequency amplitudes and phases.
The first element is the DC component (sum of all inputs).
Use scipy.fft.fft2(array) to compute.

Full Transcript

The 2D FFT takes a 2D array of numbers and changes it into frequency information. We start with the input array, then apply fft2 from scipy.fft. This gives us a new array of the same size but with complex numbers. These complex numbers tell us about the strength and phase of different frequency parts in the data. The first number in the output is the sum of all input values, called the DC component. This process helps analyze patterns in images or signals. The example uses a 2x2 array [[1, 2], [3, 4]] and shows the step-by-step output of fft2. The output is [[10.+0.j, -2.+0.j], [-4.+0.j, 0.+0.j]]. This means the fft2 transformed the data correctly and kept the shape the same. Understanding this helps in many data science tasks involving images or spatial data.

Practice

1. What does the scipy.fft.fft2 function do with a 2D array?

easy

A. It calculates the sum of all elements in the 2D array.

B. It converts the 2D data from the spatial domain to the frequency domain.

C. It sorts the 2D array in ascending order.

D. It normalizes the 2D array values between 0 and 1.

Solution

1. Step 1: Understand the purpose of fft2

   The fft2 function computes the 2-dimensional discrete Fourier Transform, which changes data from spatial to frequency domain.

2. Step 2: Compare options with function behavior

   Only It converts the 2D data from the spatial domain to the frequency domain. correctly describes this transformation. Other options describe unrelated operations.

3. Final Answer:

   It converts the 2D data from the spatial domain to the frequency domain. -> Option B

4. Quick Check:

   2D FFT = spatial to frequency transform [OK]

Hint: Remember fft2 changes space data into frequency patterns [OK]

Common Mistakes:

• Confusing fft2 with sorting or summing functions
• Thinking fft2 normalizes data
• Assuming fft2 works only on 1D data

2. Which of the following is the correct way to import and use fft2 from scipy?

easy

A. import fft2 from scipy
result = fft2(data)

B. import scipy.fft2
result = scipy.fft2(data)

C. from scipy import fft2
result = fft2(data)

D. from scipy.fft import fft2
result = fft2(data)

Solution

1. Step 1: Recall correct import syntax for fft2

   The fft2 function is in the scipy.fft module, so the correct import is from scipy.fft import fft2.

2. Step 2: Check usage correctness

   Calling fft2(data) after import is correct. Other options have wrong import syntax or module names.

3. Final Answer:

   from scipy.fft import fft2 result = fft2(data) -> Option D

4. Quick Check:

   Use 'from scipy.fft import fft2' [OK]

Hint: Import fft2 from scipy.fft module directly [OK]

Common Mistakes:

• Trying to import fft2 directly from scipy
• Using incorrect import syntax like 'import fft2 from scipy'
• Assuming fft2 is a standalone package

3. What is the output of this code snippet?

import numpy as np
from scipy.fft import fft2

arr = np.array([[1, 2], [3, 4]])
result = fft2(arr)
print(np.round(result, 2))

medium

A. [[1.+0.j 2.+0.j]
[3.+0.j 4.+0.j]]

B. [[10.+0.j 2.+0.j]
[ 4.+0.j 0.+0.j]]

C. [[10.+0.j -2.+0.j]
[-4.+0.j 0.+0.j]]

D. [[0.+0.j 0.+0.j]
[0.+0.j 0.+0.j]]

Solution

1. Step 1: Calculate 2D FFT of the array

   The 2D FFT of [[1,2],[3,4]] results in [[10, -2], [-4, 0]] with complex zeros in imaginary parts.

2. Step 2: Round and check output

   Rounding to 2 decimals keeps values same. [[10.+0.j -2.+0.j] [-4.+0.j 0.+0.j]] matches the expected complex array output.

3. Final Answer:

   [[10.+0.j -2.+0.j] [-4.+0.j 0.+0.j]] -> Option C

4. Quick Check:

   fft2([[1,2],[3,4]]) = [[10,-2],[-4,0]] [OK]

Hint: Remember fft2 sums all elements for [0,0] frequency [OK]

Common Mistakes:

• Confusing fft2 output with original array
• Ignoring complex number format
• Mixing up signs in output

4. Identify the error in this code that tries to compute the 2D FFT:

import numpy as np
from scipy.fft import fft2

arr = [[1, 2], [3]]
result = fft2(arr)
print(result)

medium

A. The array shape is invalid for fft2.

B. The input array must be a NumPy array, not a list of lists.

C. The print statement syntax is incorrect.

D. fft2 function is not imported correctly.

Solution

1. Step 1: Check the input array construction

   The arr = [[1, 2], [3]] creates a ragged array (rows have different lengths: 2 and 1), which cannot be converted to a proper NumPy 2D array.

2. Step 2: Identify the error cause

   fft2(arr) fails because np.asarray internally raises ValueError due to invalid shape.

3. Final Answer:

   The array shape is invalid for fft2. -> Option A

4. Quick Check:

   ragged lists cause shape error in fft2 [OK]

Hint: Use consistent lengths in 2D lists before fft2 [OK]

Common Mistakes:

• Creating lists with uneven row lengths
• Not validating array shape before FFT
• Assuming fft2 accepts any list structure

5. You have a 2D image array and want to filter out high-frequency noise using fft2. Which sequence of steps correctly applies this?

hard

A. Apply fft2 to image, zero out high-frequency components, then apply ifft2 to get filtered image.

B. Apply ifft2 to image, zero out low-frequency components, then apply fft2 to get filtered image.

C. Apply fft2 to image, multiply all frequencies by zero, then apply ifft2 to get filtered image.

D. Apply fft2 to image, add random noise to frequency components, then apply ifft2.

Solution

1. Step 1: Understand filtering in frequency domain

   To remove high-frequency noise, transform image with fft2, then zero out high-frequency parts (usually edges of frequency matrix).

2. Step 2: Reconstruct filtered image

   After modifying frequency data, apply inverse fft2 (ifft2) to get back filtered spatial image.

3. Final Answer:

   Apply fft2 to image, zero out high-frequency components, then apply ifft2 to get filtered image. -> Option A

4. Quick Check:

   Filter noise by zeroing high frequencies in fft2 domain [OK]

Hint: Filter noise by zeroing high frequencies, then inverse fft2 [OK]

Common Mistakes:

• Applying ifft2 before fft2
• Zeroing all frequencies removes entire image
• Adding noise instead of removing it