Implementation and Benchmarking of Perceptual Image Hash Functions¶
Zauner, C. (2010). Implementation and Benchmarking of Perceptual Image Hash Functions.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Hashing
- The intervention in both cases is the same four-question design: a photo service deduplicating re-uploads switches from bit-exact SHA-256 to a perceptual hash (locality-preserving) so minor edits still collide,
This sourceImplements and benchmarks perceptual (locality-preserving) image hashes that produce similar tokens for visually similar images, catching re-uploads after minor edits.
Supported in partVerified against the work's full text
Zauner's thesis supports the principle that perceptual hashes give similar values for visually similar images where cryptographic hashes fail, but it does not describe a photo-service re-upload deduplication switch.
“Such a function calculates similar hash values for similar images, whereas for dissimilar images dissimilar hash values are calculated.”
- The intervention in both cases is the same four-question design: a photo service deduplicating re-uploads switches from bit-exact SHA-256 to a perceptual hash (locality-preserving) so minor edits still collide,
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a2d0a50514c5 · see in the full table