Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Consider using different edit distances (cyclic and rotational variant to counter translation for location aware hashes) #29

Open
KilianB opened this issue Jan 30, 2019 · 1 comment
Labels
enhancement New feature or request

Comments

@KilianB
Copy link
Owner

KilianB commented Jan 30, 2019

Most of the non frequency based hashes encode a subset of the image into a single bit (the hash maps 1 bit of information to specific location).
For motion tracking we use sliding windows to compare hashes. The hamming distance might be off due to simply being translated a bit. Try to find a new edit distance accounting for bigger swaps in the binary string.

Maybe:

  1. naive levenshtein distance
  2. N-Grams (https://www.researchgate.net/publication/237107253_Using_q-grams_in_a_DBMS_for_Approximate_String_Processing) ?
  3. cosine similarity
  4. https://ieeexplore.ieee.org/document/4708948 Edit distance with block swapping
@KilianB KilianB added the enhancement New feature or request label Jan 30, 2019
@KilianB
Copy link
Owner Author

KilianB commented Jan 30, 2019

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant