Title
Parallel Execution of a Connected Component Labeling Operation on a Linear Array Architecture
Abstract
This work presents a novel parallel algorithm and architecture for finding connected components in an image. Simulation results indicate that the proposed algorithm has an execution time of N-2 +6N-4 cycles for an NxN image using an architecture containing 4 parallel processors. The proposed hardware can process a 128 x 128 image in 0.8574 ms and uses only 4 processors, compared to 0.85 ms and 128 processors for the work of Ranganathan et al. [14], and 94.6 ms and 16384 processors for the MPP [22]. Among the advantages of the novel architecture are modularity, expandability, regular data flow, and simple hardware. These properties are extremely desirable for VLSI implementations. Additionally, the execution time of the algorithm is independent of its image content; thus, it is quite flexible.
Year
Venue
Keywords
2003
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
connected component labeling,parallel algorithm,parallel processing,linear array,processing element
Field
DocType
Volume
Architecture,Computer science,Parallel algorithm,Parallel computing,Image content,Execution time,Connected component,Connected-component labeling,Modularity,Data flow diagram,Distributed computing
Journal
19
Issue
ISSN
Citations 
2
1016-2364
18
PageRank 
References 
Authors
1.44
16
4
Name
Order
Citations
PageRank
Kuang-bor Wang1292.50
Tsorng-Lin Chia25910.26
Zen Chen313925.78
Der-Chyuan Lou446837.88