DocumentCode
2498500
Title
A run-length based connected component algorithm for FPGA implementation
Author
Appiah, Kofi ; Hunter, Andrew ; Dickinson, Patrick ; Owens, Jonathan
Author_Institution
Dept. of Comput. & Inf. Fac. of Media, Humanities & Technol. Univ. of Lincoln, Lincoln
fYear
2008
fDate
8-10 Dec. 2008
Firstpage
177
Lastpage
184
Abstract
This paper introduces a real-time connected component labelling algorithm designed for field programmable gate array (FPGA) implementation. The algorithm run-length encodes the image, and performs connected component analysis on this representation. The run-length encoding, together with other parts of the algorithm, is performed in parallel; sequential operations are minimized as the number of runs are typically less than the number of pixels. The architecture is designed mainly on Block RAM (i.e. internal RAM) of the FPGA. A comparison with the multi-pass algorithm in hardware and software is presented to show the advantages of the algorithm. The algorithm runs comfortably in real-time with reasonably low resource utilization, making integration with other real-time algorithms feasible.
Keywords
field programmable gate arrays; image coding; image representation; parallel algorithms; random-access storage; runlength codes; FPGA implementation; block internal RAM; field programmable gate array; image representation; parallel sequential operation; real-time connected component algorithm; run-length image encoding; Algorithm design and analysis; Computer architecture; Encoding; Field programmable gate arrays; Hardware; Image analysis; Labeling; Performance analysis; Resource management; Software algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
ICECE Technology, 2008. FPT 2008. International Conference on
Conference_Location
Taipei
Print_ISBN
978-1-4244-3783-2
Electronic_ISBN
978-1-4244-2796-3
Type
conf
DOI
10.1109/FPT.2008.4762381
Filename
4762381
Link To Document