tom64b / dhash Goto Github PK

First, I'dd like to thank you for you extremely lightweight implementation of dhash!

I've submitted my first update via GitHub desktop, I added the function to remove the outer pixel, to remove border noise. This improves file comparisons for me.

I do have a small question, where do the numbers come from in:
$counts = array(0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4);

I've calculated hashes of over 400 000 images using your code. Thanks! I've used hamming_distance function from this https://github.com/palestamp/hamming_distance git. I've found that most ot the time it calculates distance as your dhash_distance, but sometimes it is very different. Is it possible to change you code, to works on postgresql to calculate distance from stored hashes? I probably could change hex hashes to bit hashes and do bit xor and popcount. Is it a better way?

Hi

Firstly thanks for your work as this will help my project alot.

I am coing to be stroring hashes in a mysql database generated with your php code and there will be around 100,000.

I then want to be able to query the above database to check if a duplicate or simular image is in the above database and return matching rows with a hamnering distance of upto 10. Mysql Bit_count i thought would be the best way to so this but thought i would ask for your thoughts and advise as i thought bit_count was integra only and thought there may be a bteer way to do this.