- #1

Shadow_7

- 5

- 0

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter Shadow_7
- Start date

In summary, the DFT tells you the spatial frequency content of an image, and by increasing or decreasing the brightness of the image you can change the power at (0,0) of the DFT.

- #1

Shadow_7

- 5

- 0

Physics news on Phys.org

- #2

cepheid

Staff Emeritus

Science Advisor

Gold Member

- 5,199

- 38

Shadow_7 said:

You probably already know that any 1D signal that is a function of time (t) can be represented as a sum of sines and cosines (Fourier decomposition), each of which has a frequency measured in 1/s (or Hz). This

Similarly, any

So, after doing a DFT, the horizontal and vertical coordinate values in the transformed image represent horizontal and vertical spatial frequency axes. So the (0,0) point is the power contained in zero spatial frequency i.e. a constant level. For this reason, this component of the DFT is sometimes called the "DC level" of the image. You can increase or decrease the overall brightness of the image just by changing the value of the DC level ( the value at (0,0) ) of the DFT.

If you have an image with vertical stripes, you can consider this to be a sine wave oriented in the horizontal direction. In other words, your image only has ONE spatial frequency component, and it is the frequency of the sine wave (which is the inverse of the distance between white stripes or black stripes). If your stripes are spaced at 2 cm apart, then your spatial frequency will be (1 / 2 cm) = 0.5 cm

The reason why there would be points at both +0.5 and -0.5 is because with an FT you're actually decomposing your image into complex exponentials, rather than sinusoids. As a result, you have both positive and negative spatial frequencies.

- #3

Charlotte PDF

- 2

- 0

For more detailed image processing info, check this image sdk site...

DFT stands for Discrete Fourier Transform and it is a mathematical tool used in image processing to convert a signal from its original domain (often space or time) to a representation in the frequency domain. This allows for analysis of the frequency components present in an image.

DFT works by breaking down an image into its component frequencies and representing them as complex numbers. It then uses a mathematical formula to calculate the magnitude and phase of each frequency component. This process is repeated for all frequencies present in the image.

DFT has many applications in image processing, including image enhancement, image compression, and image filtering. It is also commonly used in image analysis and pattern recognition.

DFT (Discrete Fourier Transform) and FFT (Fast Fourier Transform) are two different algorithms used to calculate the Fourier Transform of a signal. DFT is a more general and slower method, while FFT is a faster and more efficient algorithm that is based on the principles of DFT.

One limitation of DFT in image processing is that it assumes the image is periodic, meaning it repeats itself infinitely. This can lead to artifacts in the reconstructed image. Additionally, DFT can be computationally expensive for larger images, making it less practical for real-time image processing applications.

Engineering
Image Processing: Convolution vs Filtering

- Replies
- 1

- Views
- 1K

- Replies
- 2

- Views
- 4K

- Replies
- 7

- Views
- 3K

- Replies
- 1

- Views
- 4K

- Replies
- 1

- Views
- 1K

- Replies
- 9

- Views
- 2K

- Replies
- 4

- Views
- 10K

- Replies
- 13

- Views
- 2K

- Replies
- 1

- Views
- 2K

- Replies
- 4

- Views
- 2K

Share: