Comments (6)
dpwe
commented on August 16, 2024
The "hashes dropped" proportion will increase as the database fills up.
However, it's dropping hashes from every track, not entire tracks.
Recognition will be mildly impacted, but everything should continue to
work. I wouldn't worry until the drop %age reaches 5-10%, and even then it
should be OK.
As the database becomes fuller, matching becomes slower and memory usage
increases. You could break up into multiple databases and match
sequentially; however, that would be even slower (but would bound the
memory use).
…On Wed, Jan 9, 2019 at 4:01 AM mariagibert ***@***.***> wrote:
Hi!
I'm crating the database out of 10k files. My question is, is it possible?
I've seen that while processing the files this message appears:
Read fprints for 2023 files ( 8013111 hashes) from fpdbase.pklz (1.09%
dropped)
Dropped ones is getting higher and number of files "2023" doesn't increase.
Should I create smaller databases?
Thanks!
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#54>, or mute the thread
<https://github.com/notifications/unsubscribe-auth/AAhs0QsW9hrMyb4FAXXZluicQeQpRX0zks5vBa_MgaJpZM4Z3ChF>
.
from audfprint.
mariagibert
commented on August 16, 2024
Great!
Thanks a lot for your answer!
from audfprint.
dpwe
commented on August 16, 2024
"2023" should be the total number of files you've added to fpdbase.pklz. I can't think why it wouldn't change if the %age dropped is increasing. What is the sequence of commands you're using? "audfprint new" followed by several "audfprint add" commands? Are you using the same names for the files you're adding in each run? I haven't actually ever tried that, but you need to use unique names for each track in the database, otherwise you won't be able to tell them apart when you get the match reports.
from audfprint.
mariagibert
commented on August 16, 2024
I'm using "add" as every audio file is in different directory. Each file has different name.
Should it be fine?
from audfprint.
dpwe
commented on August 16, 2024
It should be fine. But you can use --list and full file paths in a text
file (or even just multiple full file paths on the command line) to add
many files at once, and it will be much quicker.
DAn.
…On Wed, Jan 9, 2019 at 7:50 AM mariagibert ***@***.***> wrote:
I'm using "add" as every audio file is in different directorie. Each file
has different name.
Should it be fine?
—
You are receiving this because you commented.
Reply to this email directly, view it on GitHub
<#54 (comment)>, or mute
the thread
<https://github.com/notifications/unsubscribe-auth/AAhs0fdI-_9mRRul1HFMJQzNoJXM9KhEks5vBeWMgaJpZM4Z3ChF>
.
from audfprint.
mariagibert
commented on August 16, 2024
Oh! Perfect! Thanks!
from audfprint.
Related Issues (20)
- what should be the format of mp3 files ? audfprint.py not working HOT 1
- How to Debug a Non Match HOT 5
- Multiple input and adding live audio option HOT 3
- 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
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.