Back to Discover
Curiosity

How Does Facial Recognition Work?

Facial recognition works by detecting a face, mapping its features into a numerical embedding vector, and matching identities by computing similarity in that vector space.

Before you enter

A complete interactive classroom, not just a preview.

Start when you are ready to enter this Stage's 9 scenes and explore, respond, and learn as you go.

9
Scenes
18 min
Estimated
Content language: en-US
Start this Stage
Sign-in may be required to play
What happens inside
  1. 01The Driving Questionslide
    Question

    Frame the puzzle: faces vary in lighting, angle, expression, and age — yet phones unlock in under a second. How is that even possible?

    • Faces are not stable like fingerprints
    • Speed and accuracy seem contradictory
    • This sets up what we need to explain
  2. 02Commit to Your First Guessquiz
    Prediction

    Before any explanation, the learner picks what they think facial recognition actually does behind the scenes.

    • Make one independent hypothesis
    • Reveal whether you guessed pixel matching or something deeper
  3. 03Pixel Matching vs. Embedding Distanceinteractive
    Evidence

    Try to 'recognize' faces two different ways and feel the difference: raw pixel comparison versus a similarity score in feature space.

    • Compare the same face under two lighting conditions
    • See that pixel difference is large but feature similarity stays high
    • Notice when a different person scores close under pixel comparison
  4. 04Step 1: Detecting the Faceslide
    Explanation

    Before recognition can happen, the system has to find the face in the image. Explain bounding boxes and landmark localization.

    • A detector scans the image for face-like regions
    • Landmarks mark eyes, nose, mouth, jaw
    • The face is cropped and aligned to a canonical pose
  5. 05Step 2: Building a Face Embeddinginteractive
    Explanation

    A manipulable diagram showing how a deep network turns the aligned face into a vector of numbers that encodes its geometry and texture.

    • Each layer of the network extracts increasingly abstract features
    • The final vector is the embedding — a compact numerical fingerprint
    • Adjust input conditions to see which embedding values change and which stay stable
  6. 06Step 3: Matching by Distanceslide
    Evidence

    Show how two embeddings are compared: distance (or cosine similarity) decides whether the face matches a stored identity.

    • Embeddings of the same person cluster together
    • Embeddings of different people sit far apart
    • A threshold turns distance into a yes/no decision
  7. 07When It Breaksinteractive
    Boundary

    A visualization that pushes the system to its limits: extreme angles, masks, twins, and aging — see which conditions collapse the match.

    • Heavy occlusion degrades the embedding
    • Identical twins produce near-identical embeddings
    • Lighting extremes shift the feature values noticeably
  8. 08From Faces to Other Patternsslide
    Transfer

    The same recipe — detect, embed, compare — powers voice ID, music recommendation, and anomaly detection. The principle generalizes.

    • Voice assistants use audio embeddings
    • Recommenders use preference embeddings
    • Anomaly detection uses behavioral embeddings
  9. 09Answering the Driving Questionslide
    Resolution

    Tie everything back: facial recognition is not pixel matching — it is geometry and texture compressed into a vector and compared by distance.

    • Detect the face
    • Extract a stable embedding
    • Match by similarity in embedding space
    • Threshold converts similarity into an identity decision
Discussion

Discussion threads for a Stage aren't available yet.

Where this leads
Explore more

More in Technology & Computing

See all