Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
charles-salvia
on April 4, 2017
|
parent
|
context
|
favorite
| on:
Interesting data structures: the BK-tree
Presumably, the idea is to count sufficiently similar images as the same image when doing the deduplication, so traditional hashing doesn't help here.
evincarofautumn
on April 4, 2017
[–]
Maybe they were thinking of fingerprinting, e.g., by downsampling. It’s dual in some sense to hashing—a small change to some data should produce a large change in its hash, but a small change in its fingerprint.
fake-name
on April 4, 2017
|
parent
[–]
Hashing is the correct term here, but it's not a cryptographic hash, but rather a
perceptual
hash:
https://en.wikipedia.org/wiki/Perceptual_hashing
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
