共 4 条
- [1] DAVIES ER, 1990, MACHINE VISION, P128
- [2] Leighton F.T., 1992, Introduction to Parallel Algorithms and Architecture: Arrays. Trees. Hypercubes
- [3] LI H, 1991, RECONFIGURABLE MASSI
- [4] ROSENFELD A, 1982, DIGITAL PICTURE PROC, V2, P205
Connected component labeling for binary images on a reconfigurable mesh architecture
被引：23
作者：
Bhattacharya, P
机构：
[1] Dept. of Comp. Sci. and Engineering, University of Nebraska-Lincoln, Lincoln
关键词：
connected component labeling;
reconfigurable mesh;
VLSI;
binary image;
D O I：
10.1016/1383-7621(96)00027-6
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show how some existing component labeling algorithms for binary images could be speeded up by using the reconfigurable mesh architecture. Two algorithms are presented, the first one uses the ability of the reconfigurable mesh to perform certain operations in constant time, and the second one uses a bottom-up divide-and-conquer strategy, Both these algorithms have run times that are logarithmic functions of the image size.
引用
收藏
页码：309 / 313
页数：5
相关论文