graystripe17/sadzam

A sad version of the Shazam algorithm, implemented in Python

Sadzam

A slow version of the Shazam algorithm implemented in Python.

Why

This algorithm is extremely elegant in my opinion. It starts with the simple question "How do you search audio?" But it must also handle noise, use a short sample, and be lightning fast.

The algorithm solves these through filtering, windowing, and FFTs to generate an audio fingerprint.

Importantly, it doesn't use neural nets or "machine learning".

Algorithm

1. Read in audio file
2. Convert from stereo to mono
3. Low pass filter (butterworth)
4. Downsample
5. Hamming window in 0.1s intervals
6. FFT and sort into (logarithmic) bins
7. Save "loudest" frequencies into spectrogram
8. Create ordering of points
9. For each "target" point, calc distance from neighboring cluster
10. Save as keys in dict pointing to songID
11. Normalize results, count matches

Considerations

5. Use whatever window besides rectangular to prevent spectral leakage
6. The frequency response of the human ear is highest at 3000Hz. We split it up into 6 different frequency bins
7. We take the magnitude of the frequency
8. Complexity cannot scale up with size of database. You can't just do cross correlation

Visualization

Running the tests

pytest

Demo

1. Add about 50 songs to the database folder
2. Convert songs to wav using ffmpeg
3. Build database
4. Obtain 10 second sample (noise optional)
5. Create frequencies array, spectrogram
6. Count hits, make pairs
7. Analyze hits

The following output correctly identifies oblivion sample + noise

[(('oblivion', 'lilypotter'), 0.02227589908749329),
 (('ijustcalledtosayiloveyou', 'steviewonder'), 0.016269960831575777),
 (('jessiesgirl', 'rickspringfield'), 0.011674641148325358),
 (('canttakemyeyesoffofyou', 'frankievalli'), 0.010076185795035636),
 (('ilikethat', 'janellemonae'), 0.009678668215253582)]

Acknowledgments

• https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf
• http://coding-geek.com/how-shazam-works/
• 3b1b's video on fourier transform
• Lots and lots of wikipedia
  • https://en.wikipedia.org/wiki/Short-time_Fourier_transform