期刊
JOURNAL OF REAL-TIME IMAGE PROCESSING
卷 6, 期 2, 页码 117-135出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11554-009-0134-0
关键词
Connected component labeling; Run length labeling; Line relative labeling; Algorithm architecture adequation; Rosenfeld; Selkow; Real-time implementation; Transitive closure computation
This article introduces two fast algorithms for connected component Labeling of binary images, a peculiar case of coloring. The first one, Selkow (DT) is pixel-based and a Selkow's algorithm combined with the decision tree optimization technique. The second one called light speed labeling is segment-based line-relative labeling and was especially thought for commodity RISC architectures. An extensive benchmark on both structured and unstructured images substantiates that these two algorithms, the way they were designed, run faster than Wu's algorithm claimed to be the world fastest in 2007. Also they both show greater data independency hence runtime predictability.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据