Efficient algorithm for obtaining connected components in bi-level images

抄録

We propose an efficient method for labeling connected components in bi-level images. The proposed algorithm uses a Deterministic Finite Automaton to obtain chain codes and label component boundaries, and use a tracing technique that is simpler than existing methods. Experiments on various types of images show that the proposed method improves contour tracing efficiency.