Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

computer-vision

Bounding boxes, IoU, and non-max suppression

taught

Scoring how well a predicted box matches a ground-truth box with intersection-over-union, and using non-max suppression to collapse a detector's many overlapping candidate boxes for the same object down to one -- never removing a genuinely separate true positive.

Taught in

Requires

Nothing — this is foundational.

Local knowledge map

Local knowledge map

Click to expand

Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.