1,199 karma · joined September 10, 2015
Its mostly based on other introductory resources but I tried to write it from a practical step by step perspective I found most useful for myself.
But great work overall!
You might also like my interactive implementation of the void ans cluster algorithm for generating blue noise [1]
If you are interested in this topic you might also like my visualization of a fractional fourier transform [1] and the complex plane [2]
I would call this style something like fluid enumeration of facts, typical for GPT generated texts.
Yes! Letting the period length approach infinity, would make the lowest frequency (omega_0, also delta each other frequencies) approach 0, effectively turning the discrete sum of the fourier series into an integral, turning the fourier series into the continous fourier transform.
If you are interested in interactive explorations of the fourier transform you might also like this visualization I built [1], featuring the not so well known fractional fourier transform.
Ofcourse depending on how exactly you want to process your samples it might be convenient to have an even higher sampling rate. And if you know your signal does not contain low frequencies (=not using the full bandwidth) you might get away with even lower sampling rates.
But the general case is: you must sample with a rate strictly greater than twice the highest frequences.
1. Fourier Transform an Image 2. Set all magnitues the the spectrum to 1.0, but do not change the phase 3. Inverse Transform and look at the result 4. Now try the same, but this time keep the maginutes unchanged but change all phases to 0°
Spoiler: When changing all amplitudes the image is still regocognizable, when changing all phases, it is not. See example: [1]
But in what sense are you saying the Nyquist-Shannon theorem is incorrect (when applied)? It only says something about the most general case of perfectly reconstructing a signal.
For getting an playful and intuitive understanding of time/frequency transformations my fourier-cube visualization might be useful [2]
[1]: https://static.laszlokorte.de/phase.png [2]: https://static.laszlokorte.de/frft-cube/
https://thesis.laszlokorte.de/demo/number-circle.html
And notice how „just using the sign bit“ and the 2compl are just different ways to align interepretations with bit patterns.
But using the 2compl is the alignment that does not require special cases for handling the negative numbers as opposed to the positive numbers.
That all data even the bug tracker can be synchronized across spacetime without conflicts.
I once implemented a simple tool to explore binary hypothesis testing. [1]
Maybe adding an option to denoise the pixels by thresholding would be interesting.