Comments (1)
First, is there any way to force a higher sensitivity without requiring an
overall higher density? In other words, in the areas with lots of peaks (at
a density of 10 hashes/sec), I don't need any more in the dense areas, but I
would appreciate more peak detection in the lulls. Can I ask for a minimum
hashes/sec?
The way peak-picking works is to have a decaying threshold; only when
peaks poke through the threshold are they considered as landmarks (at
which point, the local threshold is raised to the level of this new
peak). "Density" simply modulates how quickly this threshold decays,
and hence how soon before another peak pokes through.
However, quiet stretches following loud stretches will, in general,
receive few landmarks. Turning up density will shorten this "dead
time". 10 hashes/sec is a low density, so you can't expect to have
anything like a comprehensive collection of peaks at that level.
Note also --pks-per-frame; at each time step, only the first few new
landmarks are recorded. The default value for this (5) typically
discards lots of landmarks. If you're trying to find something closer
to all the candidate landmarks, you'll want to increase this.
Finally, this is not the Shazam algorithm. It's my own
implementation that is informed by Avery Wang's paper describing the
Shazam technology, but in particular details such as exactly how peaks
are formed from the spectrogram, and how peak density is controlled
with --density and --pks-per-frame etc., will only resemble what
Shazam does by pure coincidence.
DAn.
Second, does Shazam et al ever left that long of a stretch go w/o recorded
peaks? My intuition playing with it is no, but I was surprised to encounter
such low peak detection.—
Reply to this email directly or view it on GitHub.
from audfprint.
Related Issues (20)
- Incorrect time range HOT 1
- Incorrect Time range. HOT 1
- Convert .afpk files to mp3? HOT 1
- Problem with "spreadpeaksinvector"
- Reduce memory usage HOT 2
- Use audfprint as a module
- How to increase bits for storing IDs and timestamp?
- illustrate
- Scan every folder in every fingerprint base named as folder HOT 3
- UNICODE chaaracters ERROR HOT 11
- Show more than 1 finded matched names in results. HOT 4
- Can this algorithm load the historical features into memory first, so that the matching speed is improved, but I don't know how to modify your basic code HOT 7
- Hello, if the song is 1 million (the duration of the song is about 3 minutes), the matching time is very slow, how to optimize it? HOT 1
- I found that according to The time and hash generated by audfprint are not continuous in time, which led me to use the binary method to search for the same hash, conduct a statistical ranking of the number of hashes, and search for the original version of individual audio (the climax audio), and the ranking is not the first.
- I found that some match matches are inaccurate. I want to know, is the time and hash generated by this audfprint continuous at the start-end time, or is it a peak value, which leads to the fact that if one song is 1 minute, another song 3 minutes, there are a lot of hashes in the previous minute in the last two minutes of the next song, which leads to the fact that the hash statistics are larger than one minute, resulting in inaccurate sorting, then the match situation is inaccurate, how to optimize this? HOT 2
- output matching different between windows and linux. I created a database of filehashes which is around 340MB. When i try to query around 100 mp3 files my output is different between my windows machine and my raspberri pi. The database is identical, the query is identical but the windows machine finds significantly more matches. Both are running python 3.9. Database was created on the windows machine and transfered to the pi. Anyone encountered something similar? HOT 7
- Question about concatenate afpk files HOT 2
- How to avoid big % Dropped HOT 5
- Can someone take on audfprint-gui for audfprint or create a new gui for it? HOT 2
- Ability to split pklzs into smaller sizes
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from audfprint.