Git Product home page Git Product logo

Comments (2)

dpwe avatar dpwe commented on July 17, 2024

The numbers of matching and total hashes look extremely small. I wouldn't
trust any matches with fewer than 5-10 hash matches - 1 or 2 hashes are
very likely due to coincidences.

You should up your density until you're getting at least 20-40 total hashes
in your test segments. Also, it's not going to work well with very short
match patterns - I'd say 2 sec was a minimum. Single words sound too
little, and I don't really understand the use-case. Why would such a short
segment be repeated exactly?

It absolutely won't match different instances of the same word, even spoken
by the same speaker. That's a different recognition problem.

DAn.

On Wednesday, June 10, 2015, apiszcz [email protected] wrote:

I tested the samplerate for ingest of content and query values as follows.
Note Case 1 is correct. All source data is original 8KHZ.
--exact-count
--min-count 1
--density 100
--max-matches 10
--match-win 5
--pks-per-frame 2

Case1:--samplerate 11000, first case is the query itself in the content,
second instance is a match, 62.1 seconds is another instance, All
detections in case 1 are correct.

at 46.476 s with 2 of 9 hashes at rank 1
at 47.686 s with 1 of 9 hashes at rank 1
at 62.183 s with 1 of 9 hashes at rank 1

Case 2: Here we have a match with itself, however it misses matches at
47.6 and 62 in the top 10 results.

With 8KHZ data --samplerate 8000

at 46.048 s with 3 of 13 hashes at rank 1
at 332.416 s with 2 of 13 hashes at rank 1
at 12.672 s with 1 of 13 hashes at rank 1
at 13.472 s with 1 of 13 hashes at rank 1
at 97.408 s with 1 of 13 hashes at rank 1
at 121.056 s with 1 of 13 hashes at rank 1
at 146.304 s with 1 of 13 hashes at rank 1
at 257.216 s with 1 of 13 hashes at rank 1
at 323.008 s with 1 of 13 hashes at rank 1


Reply to this email directly or view it on GitHub
#9.

from audfprint.

apiszcz avatar apiszcz commented on July 17, 2024

Thank you for the feedback, use case is fingerprint detection on short
segments, I'm exploring parameter ranges for reasonable hit rates. Agree,
2-4 seconds seems more reasonable. Recognition, understand.

On Sat, Jun 13, 2015 at 1:20 AM, Dan Ellis [email protected] wrote:

The numbers of matching and total hashes look extremely small. I wouldn't
trust any matches with fewer than 5-10 hash matches - 1 or 2 hashes are
very likely due to coincidences.

You should up your density until you're getting at least 20-40 total hashes
in your test segments. Also, it's not going to work well with very short
match patterns - I'd say 2 sec was a minimum. Single words sound too
little, and I don't really understand the use-case. Why would such a short
segment be repeated exactly?

It absolutely won't match different instances of the same word, even spoken
by the same speaker. That's a different recognition problem.

DAn.

On Wednesday, June 10, 2015, apiszcz [email protected] wrote:

I tested the samplerate for ingest of content and query values as
follows.
Note Case 1 is correct. All source data is original 8KHZ.
--exact-count
--min-count 1
--density 100
--max-matches 10
--match-win 5
--pks-per-frame 2

Case1:--samplerate 11000, first case is the query itself in the content,
second instance is a match, 62.1 seconds is another instance, All
detections in case 1 are correct.

at 46.476 s with 2 of 9 hashes at rank 1
at 47.686 s with 1 of 9 hashes at rank 1
at 62.183 s with 1 of 9 hashes at rank 1

Case 2: Here we have a match with itself, however it misses matches at
47.6 and 62 in the top 10 results.

With 8KHZ data --samplerate 8000

at 46.048 s with 3 of 13 hashes at rank 1
at 332.416 s with 2 of 13 hashes at rank 1
at 12.672 s with 1 of 13 hashes at rank 1
at 13.472 s with 1 of 13 hashes at rank 1
at 97.408 s with 1 of 13 hashes at rank 1
at 121.056 s with 1 of 13 hashes at rank 1
at 146.304 s with 1 of 13 hashes at rank 1
at 257.216 s with 1 of 13 hashes at rank 1
at 323.008 s with 1 of 13 hashes at rank 1


Reply to this email directly or view it on GitHub
#9.


Reply to this email directly or view it on GitHub
#9 (comment).

from audfprint.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo 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.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.