{ "id": "eph2k0epsq", "slug": "acoustic-fingerprint", "title": "Acoustic fingerprint", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing" }, { "id": "technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai" }, { "id": "technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.algorithms" }, { "id": "technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.numerical_string_geometry" }, { "id": "technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "label": "Fourier and signal transforms", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.numerical_string_geometry.fourier_signal_transforms" } ], "geo": [ { "id": "geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "label": "Non-geographic · 1946 to 2000: Fourier and signal transforms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t1946", "label": "Non-geographic · 1946 to 2000", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946" }, { "id": "geo.nongeo.t1946.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology" }, { "id": "geo.nongeo.t1946.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing" }, { "id": "geo.nongeo.t1946.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai" }, { "id": "geo.nongeo.t1946.technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.algorithms" }, { "id": "geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry" }, { "id": "geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "label": "Fourier and signal transforms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms" } ] }, { "id": "geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "label": "Non-geographic · 2001 to 2020: Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t2001", "label": "Non-geographic · 2001 to 2020", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001" }, { "id": "geo.nongeo.t2001.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology" }, { "id": "geo.nongeo.t2001.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing" }, { "id": "geo.nongeo.t2001.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai" }, { "id": "geo.nongeo.t2001.technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.algorithms" }, { "id": "geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry" } ] } ], "excerpt": "An acoustic fingerprint is a compact, content-based signature extracted from an audio signal, used to identify recordings against a database even when the query audio is noisy or degraded.", "snippet": "An acoustic fingerprint is a compact, content-based signature extracted from an audio signal, used to identify recordings against a database even when the query audio is noisy or degraded.", "node": "technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "markdown": "# Acoustic fingerprint\n\nAn acoustic fingerprint is a compact, content-based signature extracted from an audio signal that lets a system identify a recording, match a short clip against a large database, or detect copies, even when the query audio is noisy, compressed, or otherwise degraded.[1](https://mtg.upf.edu/files/publications/b574a7-Springer05-pcano.pdf) Unlike a cryptographic hash such as MD5, which changes completely if a single bit flips, an acoustic fingerprint summarizes acoustically relevant characteristics so that distorted versions of a recording still match the original.[2](http://www.mtg.upf.edu/files/publications/MMSP-2002-pcano.pdf) Unlike a watermark, it requires no modification of the audio, works on legacy content, and needs a fingerprint repository; its cost is that it cannot distinguish perceptually identical copies.[1](https://mtg.upf.edu/files/publications/b574a7-Springer05-pcano.pdf) The technique is also known as robust matching, robust or perceptual hashing, passive watermarking, automatic music recognition, content-based digital signatures, and content-based audio identification.[1](https://mtg.upf.edu/files/publications/b574a7-Springer05-pcano.pdf)\n\n| Key fact | Value |\n|---|---|\n| Philips system fingerprint rate | 32-bit sub-fingerprint every 11.8 ms, i.e. about 2.7 kbit/s[3](https://archives.ismir.net/ismir2002/paper/000014.pdf) |\n| Philips false positive rate | \\( 3.6 \\times 10^{-20} \\) at a 0.35 bit-error threshold over 8192 bits[3](https://archives.ismir.net/ismir2002/paper/000014.pdf) |\n| Shazam search speed | 5-500 ms on a PC for a 20,000-track database; under 10 ms with radio-quality audio[4](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf) |\n| Shazam storage/speed trade-off | About 10 times the storage bought about 10,000 times the speed[4](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf) |\n| Query length | The 2011 survey found mobile applications wanted queries under 10 seconds; current services can identify from shorter queries, and the Shazam app records up to 20 seconds, with about five seconds reported as giving best results[5](https://ismir2011.ismir.net/papers/OS10-2.pdf) • [6](https://medium.com/@treycoopermusic/how-shazam-works-d97135fb4582) |\n| PeakNetFP time-stretch robustness | Top-1 hit rate over 90% for stretch factors from 50% to 200%[7](https://ismir2025program.ismir.net/poster_74.html) |\n\n## How it works\n\nThe core idea is to reduce a waveform to a sparse set of salient time-frequency points and hash their relationships. The Shazam algorithm described in Avery Wang's 2003 paper uses a combinatorially hashed time-frequency constellation analysis: the spectrogram's local energy maxima form a sparse \"constellation map,\" and pairs or groups of peaks are hashed into compact keys.[4](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf) [Spectrogram](https://www.edgepedia.org/spectrogram) peaks were chosen for their robustness in the presence of noise and their approximate linear superposability, which is why several tracks mixed together can each still be identified.[4](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf)\n\nA point \\( (n_{0}, k_{0}) \\) in the spectrogram is selected as a peak if \\( \\lvert X(n_{0}, k_{0}) \\rvert \\geq \\lvert X(n, k) \\rvert \\) for all \\( (n, k) \\) in a neighborhood around it.[8](https://www.audiolabs-erlangen.de/resources/MIR/FMP/C7/C7S1_AudioIdentification.ipynb) Because background noise has lower intensity in the time-frequency representation, landmark-based methods tolerate it well; their weakness is time stretching, which distorts the peak geometry.[9](https://ar5iv.labs.arxiv.org/html/2603.23947)\n\n## How it is done\n\nA typical pipeline runs as follows. First, the signal is divided into frames of a size comparable to the variation velocity of the underlying acoustic events, with a tapered window to minimize discontinuities and overlap to assure robustness to shifting; frame rate trades the rate of spectral change against system complexity.[2](http://www.mtg.upf.edu/files/publications/MMSP-2002-pcano.pdf) A practical implementation averages the channels, subtracts the mean, downsamples, computes the spectrogram, finds local peaks, and thresholds them to a specified peak rate.[10](https://www.princeton.edu/~cuff/ele201/files/lab2.pdf)\n\nPeaks are then formed into pairs parameterized by the peak frequencies and the time between them, quantized to give a large number of distinct landmark hashes, about one million in one reference implementation.[11](http://labrosa.ee.columbia.edu/~dpwe/resources/matlab/fingerprint/demo_fingerprint.m) In the Shazam-style encoding, each peak pair packs \\( f_{1} \\) (10 bits), \\( f_{2} \\) (10 bits), and \\( t_{2} - t_{1} \\) (10 bits) into a 32-bit unsigned integer, so the three fields are allocated 30 bits.[12](https://people.csail.mit.edu/sshum/talks/audio_fingerprinting_sls_24Oct2011.pdf) At query time, hashes shared between query and database are counted, and a time-offset alignment confirms the match.\n\nThe Philips system takes a different route: it retains only the power spectral density, selects 33 non-overlapping frequency bands between 300 Hz and 2000 Hz, and extracts a 32-bit sub-fingerprint per frame; identification uses 3-second blocks of 256 sub-fingerprints.[3](https://archives.ismir.net/ismir2002/paper/000014.pdf)\n\n## Origin\n\nTwo systems from 2002-2003 set the template. A highly robust audio fingerprinting system was described at ISMIR 2002, the Philips sub-fingerprint design summarized above, intended for millisecond-order search over more than 100,000 songs on a few high-end PCs, robust enough to identify music recorded and transmitted by a mobile telephone.[3](https://archives.ismir.net/ismir2002/paper/000014.pdf) The Shazam constellation approach is credited in the later literature as one of the first successful algorithms scalable to databases of millions of songs.[4](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf) Industry interest was formalized when IFPI and RIAA issued a Request for Information on Audio Fingerprinting Technologies to evaluate several identification systems, with requirements covering accuracy, robustness to compression and channel distortion, granularity, compactness, and computability.[1](https://mtg.upf.edu/files/publications/b574a7-Springer05-pcano.pdf) Neural audio fingerprinting via contrastive learning was introduced by Chang and colleagues in 2020 on arXiv.[13](https://doi.org/10.48550/arxiv.2010.11910)\n\n## Variants\n\n**Shazam-style constellation hashing** pairs spectrogram peaks and hashes them exactly; descriptors must match exactly for a hit, which suits identification but not fuzzy tasks such as cover-song detection.[12](https://people.csail.mit.edu/sshum/talks/audio_fingerprinting_sls_24Oct2011.pdf) **Philips landmark hashing** uses dense binary sub-fingerprints with bit-error counting instead.[3](https://archives.ismir.net/ismir2002/paper/000014.pdf) **Chromaprint**, developed for the AcoustID project, is based on chroma features and is designed to identify near-identical audio with maximally compact fingerprints; it deliberately trades precision and robustness for search performance, targeting full audio file identification, duplicate detection, and long stream monitoring.[14](https://github.com/acoustid/chromaprint/) • [15](https://essentia.upf.edu/tutorial_fingerprinting_chromaprint.html) AcoustID itself is an entirely open-source identification service combining the client library, a crowdsourced fingerprint database linked to [MusicBrainz](https://www.edgepedia.org/musicbrainz) identifiers, and a web search service.[16](https://acoustid.org/) Panako addresses time-scale and pitch modification by converting the frequency-bin separation between two reference bins into a frequency ratio, \\( e^{((f_{01} - f_{1}) \\times n \\times \\ln(2)/1200)} \\), where \\( n \\) is the number of cents per bin and the cents separation is \\( (f_{01} - f_{1}) n \\).[17](https://0110.be/files/publications/2014/ismir_2014_panako_fingerprinter.pdf)\n\nOn the neural side, a Google-style deep approach mapped 2-second spectrogram fragments to 96-dimensional vectors trained with triplet loss, with each song occupying on average less than 3 KB in the indexed database and 75.5% recall on short noisy queries over a 450-hour dataset.[18](https://arxiv.org/pdf/2507.06070) PeakNetFP (Cortès-Sebastià and colleagues, 2025) maintains a Top-1 hit rate over 90% for stretching factors from 50% to 200%, with 100 times fewer parameters and 11 times smaller input data than NeuralFP.[7](https://ismir2025program.ismir.net/poster_74.html) • [19](https://doi.org/10.48550/arxiv.2506.21086) VLAFP (Chen and colleagues, 2026) fingerprints audio of arbitrary variable lengths using a transformer backbone with stacked self-attention and cross-attention layers trained with a contrastive loss.[9](https://ar5iv.labs.arxiv.org/html/2603.23947) • [20](https://doi.org/10.48550/arxiv.2603.23947)\n\n## Applications\n\nSong identification is the best-known use: Shazam and SoundHound are the prominent consumer services.[5](https://ismir2011.ismir.net/papers/OS10-2.pdf) The same algorithms monitor media streams at over 1000 times realtime for copyright monitoring, and can identify music hidden behind loud voiceovers.[4](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf) Chromaprint's target uses, full-file identification, duplicate detection, and long stream monitoring, serve open-source identification through AcoustID and MusicBrainz.[14](https://github.com/acoustid/chromaprint/) • [16](https://acoustid.org/) Sending fingerprint data rather than compressed audio also matters for mobile query-by-example: fingerprints take on the order of a few seconds to transmit, while compressed audio could take tens of seconds over a wireless link.[5](https://ismir2011.ismir.net/papers/OS10-2.pdf)\n\n## Limitations and alternatives\n\nHaitsma and Kalker define five performance parameters: robustness (false negative rate), reliability (false positive rate), fingerprint size, granularity (seconds of audio needed), and search speed and scalability; the false positive rate is inversely related to fingerprint size.[3](https://archives.ismir.net/ismir2002/paper/000014.pdf) Landmark-based algorithms hash connections between characteristic spectral peaks, but were not invariant to tempo, timbre, or pitch changes, a key limitation for cover and version identification.[21](https://ar5iv.labs.arxiv.org/html/2109.02472) Handcrafted-feature methods usually require long queries, more than 10 seconds, to achieve high accuracy.[18](https://arxiv.org/pdf/2507.06070) Chroma-landmark hashing addresses the fuzzy-matching end that exact landmark hashing cannot.[12](https://people.csail.mit.edu/sshum/talks/audio_fingerprinting_sls_24Oct2011.pdf)\n\n## References\n\n1. [An Introduction to Audio Fingerprinting (Springer 2005 chapter)](https://mtg.upf.edu/files/publications/b574a7-Springer05-pcano.pdf)\n2. [A Review of Algorithms for Audio Fingerprinting](http://www.mtg.upf.edu/files/publications/MMSP-2002-pcano.pdf)\n3. [A Highly Robust Audio Fingerprinting System](https://archives.ismir.net/ismir2002/paper/000014.pdf)\n4. [An Industrial-Strength Audio Search Algorithm](https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf)\n5. [Survey and Evaluation of Audio Fingerprinting Schemes for Mobile Query-by-Example Applications](https://ismir2011.ismir.net/papers/OS10-2.pdf)\n6. [How Shazam Works - by Trey Cooper](https://medium.com/@treycoopermusic/how-shazam-works-d97135fb4582)\n7. [PeakNetFP: Peak-based Neural Audio Fingerprinting Robust to Extreme Time Stretching (ISMIR 2025)](https://ismir2025program.ismir.net/poster_74.html)\n8. [Audio Identification (FMP notebook, Audiolabs Erlangen)](https://www.audiolabs-erlangen.de/resources/MIR/FMP/C7/C7S1_AudioIdentification.ipynb)\n9. [Variable-Length Audio Fingerprinting (VLAFP)](https://ar5iv.labs.arxiv.org/html/2603.23947)\n10. [Princeton ELE201 Lab 2: Shazam](https://www.princeton.edu/~cuff/ele201/files/lab2.pdf)\n11. [demo_fingerprint.m (Dan Ellis, LabROSA)](http://labrosa.ee.columbia.edu/~dpwe/resources/matlab/fingerprint/demo_fingerprint.m)\n12. [An Introduction to Audio Fingerprinting (S. Shum, MIT CSAIL, 2011)](https://people.csail.mit.edu/sshum/talks/audio_fingerprinting_sls_24Oct2011.pdf)\n13. [Chang, Sungkyun and colleagues (2020). Neural Audio Fingerprint for High-specific Audio Retrieval based on Contrastive Learning. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2010.11910)\n14. [acoustid/chromaprint (official repository)](https://github.com/acoustid/chromaprint/)\n15. [Music fingerprinting with Chromaprint, Essentia documentation](https://essentia.upf.edu/tutorial_fingerprinting_chromaprint.html)\n16. [Welcome to AcoustID!](https://acoustid.org/)\n17. [Panako - A Scalable Acoustic Fingerprinting System Handling Time-Scale and Pitch Modification](https://0110.be/files/publications/2014/ismir_2014_panako_fingerprinter.pdf)\n18. [Contrastive and Transfer Learning for Effective Audio Fingerprinting](https://arxiv.org/pdf/2507.06070)\n19. [Cortès-Sebastià, Guillem and colleagues (2025). PeakNetFP: Peak-based Neural Audio Fingerprinting Robust to Extreme Time Stretching. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2506.21086)\n20. [Chen, Hongjie and colleagues (2026). Variable-Length Audio Fingerprinting. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2603.23947)\n21. [Audio-based Musical Version Identification: Elements and Challenges](https://ar5iv.labs.arxiv.org/html/2109.02472)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Computing and digital systems › Artificial intelligence and data › Algorithms and computational methods › Numerical, string, and geometric algorithms › Fourier and signal transforms*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [ "https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf", "https://www.princeton.edu/~cuff/ele201/files/lab2.pdf", "http://labrosa.ee.columbia.edu/~dpwe/resources/matlab/fingerprint/demo_fingerprint.m" ], "url": "https://www.edgepedia.org/acoustic-fingerprint", "markdown_url": "https://www.edgepedia.org/acoustic-fingerprint.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Acoustic fingerprint\", Edgepedia (EdgeChat), https://www.edgepedia.org/acoustic-fingerprint. Edgepedia Community License 1.0.", "credit_md": "\"[Acoustic fingerprint](https://www.edgepedia.org/acoustic-fingerprint)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/acoustic-fingerprint](https://www.edgepedia.org/acoustic-fingerprint). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Acoustic fingerprint\", Edgepedia (EdgeChat), https://www.edgepedia.org/acoustic-fingerprint. Edgepedia Community License 1.0.", "speakable": "An acoustic fingerprint is a compact, content-based signature extracted from an audio signal, used to identify recordings against a database even when the query audio is noisy or degraded." }