From O(n²) to O(log n): Using a BK-Tree for Fast 64-bit Perceptual Hash Near-Neighbor Search

Your image collector just grabbed 2,000 images from a website. Before exporting, you want to drop the near-duplicates — same photo recompressed at two qualities, the same meme cropped slightly differe