The example image suggests that the hash of the diagonal dHash always represents a 0 at the last right and bottom buckets. Take a look at it and see if indices are messed up.
low priority for now. If true, we are loosing 1 bit precision both in width and height which is a waste of space. Changing the output of an existing hashing function would be a breaking change.
The example image suggests that the hash of the diagonal dHash always represents a 0 at the last right and bottom buckets. Take a look at it and see if indices are messed up.