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

connected component

A maximal set of foreground pixels all reachable from one another under a chosen adjacency rule.

A connected component is a maximal set of foreground pixels in which every pixel is reachable from every other by a chain of foreground neighbors, under a chosen connectivity rule -- 4-connectivity (only edge-sharing neighbors) or 8-connectivity (edge- and corner-sharing neighbors, which can merge components 4-connectivity keeps separate). Connected-component labeling assigns each component its own distinct integer ID.

See also

structuring element
Read the full section →
Graph settings

Calculator