ArticleslgStudy

science

Perceptual hashing

Perceptual hashing is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Perceptual hashing rather than just read about it. In short: Perceptual hashing is the use of a fingerprinting algorithm that produces a snippet, hash, or fingerprint of various forms of multimedia. A perceptual hash is a type of locality-sensitive hash, which is analogous if features of the multimedia are similar.

Key takeaways

  • Perceptual hashing belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Perceptual hashing to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Perceptual hashing from memory before moving on to harder problems.

Reference excerpt

Perceptual hashing is the use of a fingerprinting algorithm that produces a snippet, hash, or fingerprint of various forms of multimedia. A perceptual hash is a type of locality-sensitive hash, which is analogous if features of the multimedia are similar. This is in contrast to cryptographic hashing, which relies on the avalanche effect of a small change in input value creating a drastic change in output value. Perceptual hash functions are widely used in finding cases of online copyright infringement as well as in digital forensics because of the ability to have a correlation between hashes so similar data can be found (for instance with a differing watermark).

Development The 1980 work of Marr and Hildreth is a seminal paper in this field. In 2009, Microsoft Corporation developed PhotoDNA in collaboration with Hany Farid, professor at Dartmouth College. PhotoDNA is a perceptual hashing capability developed to combat the distribution of child sexual abuse material (CSAM) online. Provided by Microsoft for no cost, PhotoDNA remains a critical tool used by major software companies, NGOs and law enforcement agencies around the world. In June 2016 Azadeh Amir Asgari published work on robust image hash spoofing. Asgari notes that perceptual hash function like any other algorithm is prone to errors. Researchers remarked in December 2017 that Google image search is based on a perceptual hash. In research published in November 2021 investigators focused on a manipulated image of Stacey Abrams which was published to the internet prior to her loss in the 2018 Georgia gubernatorial election. They found that the pHash algorithm was vulnerable to nefarious actors. In August 2021 Apple announced an on-device CSAM scanner called NeuralHash but, after strong privacy backlash, paused the rollout in September and formally cancelled it in December 2022. Security researchers soon demonstrated that NeuralHash and similar deep perceptual hashes can be forced into collisions or evasion with imperceptible image changes. In October 2023 Meta introduced Stable Signature, an invisible watermark rooted in latent-diffusion generators, signalling a shift toward hybrid provenance schemes that combine watermarking with perceptual hashing. The open-source state of the art in 2025 was set by DINOHash, which adversarially fine-tunes self-supervised DINOv2 features and reports higher bit-accuracy under heavy crops, compression and adversarial gradient-based attacks than NeuralHash or classical DCT–DWT schemes.

Characteristics Research reported in January 2019 at Northumbria University has shown for video it can be used to simultaneously identify similar contents for video copy detection and detect malicious manipulations for video authentication. The system proposed performs better than current video hashing techniques in terms of both identification and authentication. Research reported in May 2020 by the University of Houston in deep learning based perceptual hashing for audio has shown better performance than traditional audio fingerprinting methods for the detection of similar/copied audio subject to transformations. In addition to its uses in digital forensics, perceptual hashing can be applied to a wide variety of situations. Similar to comparing images for copyright infringement, a group of researchers found that it could be used to compare and match images in a database. They showed that their algorithm is more efficient than the standard means of database image search. A Chinese team reported in July 2019 that they had discovered a perceptual hash for speech encryption which proved to be effective. They were able to create a system in which the encryption was more accurate and more compact. In August 2021, Apple Inc described a CSAM-detection system called NeuralHash. A technical summary document explained that the system did not scan images on iCloud servers, but rather performed on-device matching using a database of CSAM image hashes provided by the National Center for Missing and Exploited Children (NCMEC) and other organizations. In an essay entitled "The Problem With Perceptual Hashes", Oliver Kuederle demonstrated how a photographic portrait of a real woman reduces through a perceptual hash algorithm to a similar hash as the photograph of a butterfly painted in watercolor. Both sample images are in commercial databases. Kuederle is concerned with collisions like this. "These cases will be manually reviewed. That is, according to Apple, an Apple employee will then look at your (flagged) pictures... Perceptual hashes are messy. When such algorithms are used to detect criminal activities, especially at Apple scale, many innocent people can potentially face serious problems... Needless to say, I’m quite worried about this." Researchers have continued to publish a comprehensive analysis entitled "Learning to Break Deep Perceptual Hashing: The Use Case NeuralHash", in which they investigate the vulnerability of NeuralHash as a representative of deep perceptual hashing algorithms to various attacks. Their results show that hash collisions between different images can be achieved with minor changes applied to the images. According to the authors, these results demonstrate the real chance of such attacks and enable the flagging and possible prosecution of innocent users. They also state that the detection of illegal material can easily be avoided, and the system be outsmarted by simple image transformations, such as provided by free-to-use image editors. The authors assume their results to apply to other deep perceptual hashing algorithms as well, questioning their overall effectiveness and functionality in applications such as client-side scanning and chat controls.

See also Geometric hashing Reverse image search Digital video fingerprinting Audio fingerprinting

References

External links pHash - an open source perceptual hash library Blockhash.io - an open standard for perceptual hashes Insight - a perceptual hash tutorial

Worked examples

Example 1 — a first encounter with Perceptual hashing

Start with the simplest possible case. Write down what Perceptual hashing claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Perceptual hashing before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Perceptual hashing ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Perceptual hashing

In research
Perceptual hashing appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Perceptual hashing in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Perceptual hashing is common in secondary-school and first-year university syllabi. It links to neighbouring topics Google Search, Hashing, Image search, so understanding it makes those chapters shorter.
In everyday life
Look for Perceptual hashing outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Perceptual hashing” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Perceptual hashing in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Perceptual hashing means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Perceptual hashing out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Perceptual hashing in simple terms?

Perceptual hashing is the use of a fingerprinting algorithm that produces a snippet, hash, or fingerprint of various forms of multimedia. A perceptual hash is a type of locality-sensitive hash, which is analogous if features of the multimedia are similar.

Why does Perceptual hashing matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Perceptual hashing?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Perceptual hashing.

Tags

  • Google Search
  • Hashing
  • Image search

Keep exploring