In the previous post in this series I talked about forming a graph based on pixel neighbor relationships, and then finding the connected components of the graph. Another approach starts... 더 읽어보기 >>

Let's start looking at connected component labeling algorithms. In this post I want to explain how you can think of pixel neighborhood relationships in terms of a graph. We'll look at... 더 읽어보기 >>

In this series I'm discussing different ways to compute the connected components of a binary image. Before I get into specific
algorithms, though, I need to touch briefly on the notion of... 더 읽어보기 >>

Several people have asked recently about how bwlabel works, so I plan to write about it here during the next several weeks.
bwlabel implements an operation known as connected component labeling, or... 더 읽어보기 >>