Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 13315

The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.

0
votes
Remove the mean from the image you linked before analysing it with fft2. Use fftshift to get a more readable image. Use a logarithmic scale on the 2d spectrum if you don't see anything. Please label …
answered Apr 8 '15 by Antoine Bassoul
3
votes
1) A Fourier serie is written as $$\frac {a_0} 2 + \sum \limits _{m=1} ^\infty (a_m \cos \frac {2 \pi m t} T + \mathbf{i} \, b_m \sin \frac {2 \pi m t} T)$$ Unless your signal is even, i.e. $f(-t)=f(t …
answered Apr 26 '15 by Antoine Bassoul
1
vote
, you'll have to check the phases too) : Fs=1e3; %sampling frequency T=1/Fs; %sampling period N=10/T; %Number of points to have 10s of signal f=Fs*linspace(0,1,N); Fm=(1/N)*fft(m); %Normalization Fm=2*Fm(1 …
answered Apr 29 '15 by Antoine Bassoul