# 1.2 2d dft

 Page 1 / 1
This module extends the ideas of the Discrete Fourier Transform (DFT) into two-dimensions, which is necessary for any image processing.

## 2d dft

To perform image restoration (and many other useful image processing algorithms) in a computer, we need a FourierTransform (FT) that is discrete and two-dimensional.

$F(k, l)=(u=\frac{2\pi k}{N}, v=\frac{2\pi l}{N}, F(u, v))$
for $k=\{0, , N-1\}$ and $l=\{0, , N-1\}$ .
$F(u, v)=\sum \sum f(m, n)e^{-(ium)}e^{-(ivm)}$
$F(k, l)=\sum_{m=0}^{N-1} \sum_{n=0}^{N-1} f(m, n)e^{-i\frac{2\pi km}{N}}e^{-i\frac{2\pi ln}{N}}$
where the above equation ( ) has finite support for an $N$ x $N$ image.

## Inverse 2d dft

As with our regular fourier transforms, the 2D DFT also has an inverse transform that allows us to reconstruct an imageas a weighted combination of complex sinusoidal basis functions.

$f(m, n)=\frac{1}{N^{2}}\sum_{k=0}^{N-1} \sum_{l=0}^{N-1} F(k, l)e^{\frac{i\times 2\pi km}{N}}e^{\frac{i\times 2\pi ln}{N}}$

## 2d dft and convolution

The regular 2D convolution equation is

$g(m, n)=\sum_{k=0}^{N-1} \sum_{l=0}^{N-1} f(k, l)h(m-k, n-l)$

Below we go through the steps of convolving two two-dimensional arrays. You can think of $f$ as representing an image and $h$ represents a PSF, where $h(m, n)=0$ for $m\land n> 1$ and $m\land n< 0$ . $h=\begin{pmatrix}h(0, 0) & h(0, 1)\\ h(1, 0) & h(1, 1)\\ \end{pmatrix}$ $f=\begin{pmatrix}f(0, 0) & & f(0, N-1)\\ & & \\ f(N-1, 0) & & f(N-1, N-1)\\ \end{pmatrix}$ Step 1 (Flip $h$ ):

$h(-m, -n)=\begin{pmatrix}h(1, 1) & h(1, 0) & 0\\ h(0, 1) & h(0, 0) & 0\\ 0 & 0 & 0\\ \end{pmatrix}$
Step 2 (Convolve):
$g(0, 0)=h(0, 0)f(0, 0)$
We use the standard 2D convolution equation ( ) to find the first element of our convolved image. In order to better understand what ishappening, we can think of this visually. The basic idea is to take $h(-m, -n)$ and place it "on top" of $f(k, l)$ , so that just the bottom-right element, $h(0, 0)$ of $h(-m, -n)$ overlaps with the top-left element, $f(0, 0)$ , of $f(k, l)$ . Then, to get the next element of our convolved image, we slide the flipped matrix, $h(-m, -n)$ , over one element to the right and get the following result: $g(0, 1)=h(0, 0)f(0, 1)+h(0, 1)f(0, 0)$ We continue in this fashion to find all of the elements ofour convolved image, $g(m, n)$ . Using the above method we define the general formula to find a particular element of $g(m, n)$ as:
$g(m, n)=h(0, 0)f(m, n)+h(0, 1)f(m, n-1)+h(1, 0)f(m-1, n)+h(1, 1)f(m-1, n-1)$

## Circular convolution

What does $H(k, l)F(k, l)$ produce?

2D Circular Convolution

$\stackrel{~}{g}(m, n)=\mathrm{IDFT}(H(k, l)F(k, l))=\mathrm{circularconvolutionin2D}$

Due to periodic extension by DFT ( ):

Based on the above solution, we will let

$\stackrel{~}{g}(m, n)=\mathrm{IDFT}(H(k, l)F(k, l))$
Using this equation, we can calculate the value for each position on our final image, $\stackrel{~}{g}(m, n)$ . For example, due to the periodic extension of the images, when circular convolution is applied we willobserve a wrap-around effect.
$\stackrel{~}{g}(0, 0)=h(0, 0)f(0, 0)+h(1, 0)f(N-1, 0)+h(0, 1)f(0, N-1)+h(1, 1)f(N-1, N-1)$
Where the last three terms in are a result of the wrap-around effect caused by the presence of the images copies located all around it.

If the support of $h$ is $M$ x $M$ and $f$ is $N$ x $N$ , then we zero pad $f$ and $h$ to $M+N-1$ x $M+N-1$ (see ).

Circular Convolution = Regular Convolution

## Computing the 2d dft

$F(k, l)=\sum_{m=0}^{N-1} \sum_{n=0}^{N-1} f(m, n)e^{-i\frac{2\pi km}{N}}e^{-i\frac{2\pi ln}{N}}$
where in the above equation, $\sum_{n=0}^{N-1} f(m, n)e^{-i\frac{2\pi ln}{N}}$ is simply a 1D DFT over $n$ . This means that we will take the 1D FFT of each row; if wehave $N$ rows, then it will require $N\lg N$ operations per row. We can rewrite this as
$F(k, l)=\sum_{m=0}^{N-1} {f}^{}(m, l)e^{-i\frac{2\pi km}{N}}$
where now we take the 1D FFT of each column, which means that if we have $N$ columns, then it requires $N\lg N$ operations per column.
Therefore the overall complexity of a 2D FFT is $O(N^{2}\lg N)$ where $N^{2}$ equals the number of pixels in the image.

how do they get the third part x = (32)5/4
can someone help me with some logarithmic and exponential equations.
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
Commplementary angles
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
hii
Uday
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
is it 3×y ?
J, combine like terms 7x-4y
how do you translate this in Algebraic Expressions
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!