Skip to main content

Questions tagged [2d]

0 votes
0 answers
30 views

I need your help with the following question: I can see tht there is kind of a convolution here together with sampling, but I can not understand how to solve it. It is quite difficult for me to see ...
dopp_11's user avatar
  • 11
1 vote
1 answer
97 views

I know that is the 1D Fourier Transform (FT), and the 2D FT is and 3D FT is , but I am not sure whether these expressions are in fact Fourier transform integral equations for a 1D signal, expanded ...
LiuXiu's user avatar
  • 13
2 votes
1 answer
501 views

I wonder if there is any known formula to describe a 2D Fourier transform of an element-wise product, i.e., Hadamard product, of two matrices. Let $\odot$ is the Hadamard product operator, and there ...
Junho's user avatar
  • 53
1 vote
0 answers
144 views

The Discrete Fourier transform of a 1D discrete decay function $d[n]=e^{-a n}$ is simply computed as the sum of a geometric series: $$\tilde{d}[k] = \sum_{n=0}^{N-1}e^{-a n}e^{2 j \pi n k/N} = \frac{1-...
that_guy's user avatar
1 vote
0 answers
565 views

I have created a 2D matrix with L as the number of samples and K as the number of chirps. Now I am trying to plot the Range-Doppler response which doesn't correspond to the correct range and velocity ...
SARA NASIR's user avatar
1 vote
0 answers
159 views

Hello all hope everyone is doing fine. I have a vision related problem where I want to calibrate my camera using a 3d object such as rubik's cube with known dimensions. I have a cube with 60mm length, ...
umar anjum's user avatar
2 votes
0 answers
76 views

If the grid-lines in the image (attached: distort1.jpeg) are distorted and squares in image appears distorted a bit. What would be the best and easy approach to convert them to perfect squares (as ...
Pom's user avatar
  • 21
1 vote
1 answer
302 views

I have been experimenting a little bit with simple examples of the 2D DFT to get a better sense for it's interpretation. For this purpose I have been using sinus gratings with the following code: <...
OuttaSpaceTime's user avatar
5 votes
1 answer
3k views

So I was following the article Victor Podlozhnyuk (nVidia) - FFT Based 2D Convolution (Page 7). I have expanded the kernel to the correct way they have done it. However when it comes to the part on ...
Simon Balfe's user avatar
0 votes
0 answers
339 views

I am trying to find the phase of a generic 2D sine wave with the 2D FFT. The formula for the phase is arctan(im/re). So I made 22 sine waves with phases ranging from 0 to 2 pi (by cropping the ...
dandi's user avatar
  • 1
1 vote
1 answer
463 views

For the 1D cosine transform the documentation is clear in here, and I can reproduce it easily: The formula is: $$y_k= 2 \sum_{n=0}^{N-1}x_n \cos \left( \frac{\pi k(2n + 1)}{2N}\right)$$ and here it is ...
Antoni Parellada's user avatar
1 vote
0 answers
557 views

I am currently working on a project, where we record an electron beam profile using a target. The obtained image is a result of convolution of the actual beam profile and the aperture wherein the ...
user3198929's user avatar
2 votes
2 answers
151 views

I have a given 2D system: $$y(m,n) = \sum_{k_1=-\infty}^{m} \sum_{k_2=-\infty}^{n} x(k_1,k_2)$$ My usual approach to determining if a system is linear is to test if it is homogeneous and additive. ...
Cit5's user avatar
  • 123
1 vote
0 answers
118 views

The pattern in which the sample points are distributed in 2 dims, is called a sampling lattice, and can be defined by a generator matrix.. In 2 dimensions, the generator matrix consists of 2 vectors. ...
Giannis Mpountouridis's user avatar
0 votes
1 answer
612 views

I know how to compute the 1D FFT (and interpret values from 0 to Nyq). When computing the 2D FFT, do we compute the FFT of row[1] then the FFT of row[2] then the FFT of row[3] up to the last row. ...
cesar from Santa Clara CA's user avatar

15 30 50 per page
1
2 3 4 5