Chapter DWhen computers seePage 4 of 8

When computers see

Measure whether the 3×3 plus-sign image classifier works

Page 4 advances one concrete 3×3 plus-sign image classifier: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.

~14 minEvaluation

Before you start

Why this matters

Without running code, predict the output of this page's example and name the intermediate value that would prove your prediction. Then write one sentence answering: “What could look successful while actually being wrong?” For this stage, focus on fragile pixel classifier. Keep the prediction nearby; comparing it with the real output is the first debugging exercise, not a quiz about syntax.

1Learn the idea

Read

Build focus

A plausible result is not yet evidence. Evaluate with confusion matrix counts, accuracy on clean patterns, and robustness under every single-pixel flip. The test fixture should contain an easy positive case, an easy negative or baseline case, and the boundary case most likely to flip. Separate assertions about software contracts from claims about model quality: both matter, but they answer different questions.

The artifact's user-facing goal is specific: classify a tiny pixel grid as plus or other while keeping the pixels, score, threshold, and prediction visible. Its accepted input is exactly three rows of three binary brightness values. Those statements are intentionally narrower than “build an AI system.” Narrow scope lets us inspect every input and expected result, and it prevents a toy result from being presented as a production claim. The runnable check below turns one success criterion into an assertion, so a regression exits loudly.

Read

Run the example

Save this as lesson.py and run python3 lesson.py. It uses only the language standard library, so the example is reproducible offline.

tests=[([[0,1,0],[1,1,1],[0,1,0]],'plus'),([[1,1,1],[0,0,0],[0,0,0]],'other')]
def pred(x): return 'plus' if sum(x[r][c] for r,c in [(0,1),(1,0),(1,1),(1,2),(2,1)])>=4 else 'other'
assert all(pred(x)==y for x,y in tests); print('2/2')

Expected output: 2/2. Exact floating-point formatting may vary slightly, but the asserted behavior must not. Read the output as evidence about this stage, not merely proof that the interpreter started.

Read

Debug the stage

Print the 3×3 grid, flattened indices, five selected pixels, score, threshold, and label. If a rotated or shifted plus fails, that is an invariance limitation rather than a Python bug. Enumerate all nine single-pixel flips instead of trying one convenient corruption. Shape and binary-value errors should stop before scoring so malformed images cannot masquerade as confident predictions.

At the evaluation stage, save the smallest failing fixture beside the expected result. Change one cause at a time and rerun the exact command printed above; that makes the repair reviewable and keeps this chapter's progressive artifact reproducible.

Read

Evaluate before continuing

Use named positive and negative grids to compute confusion counts, then report every single-pixel-flip result. Accuracy alone hides whether the toy misses pluses or calls unrelated lines pluses, so include recall and false-positive count. Keep the threshold in the report and test a rotated plus separately. This evaluates a handcrafted detector, not a camera-ready vision model.

For this evaluation page, preserve the fixture and result as evidence for the next page. Label observations separately from conclusions: a passing assertion establishes the behavior it names, while broader usefulness requires the chapter's full evaluation set and stated operating limits.

Checking tutor…

Continue learning · glossary & guides
  • [ ] Does the fixed set include positive, negative, and boundary cases?
  • [ ] Are contract tests separated from quality metrics?
  • [ ] Did I compare against a simple baseline?
  • [ ] Can I identify exactly which pixels contribute to the plus score?

Glossary: computer vision · Glossary: convolutional neural network

Previous · Next