Download now Free registration required
This paper describes a novel approach to the connected component labeling problem, derived from two fast labeling algorithms, Wu et al. and Park et al. The authors propose a method that improves over existing divide and conquer methods. They propose two new methods - First, hierarchical (coarse to fine) label propagation from various sub images. Second, the recursive boundary labeling method is only one neighbor based and thus is 4-6 times faster than the conventional 8 neighborhood scan. They study the theoretical labeling performance and speedup.
- Format: PDF
- Size: 386.86 KB