A linked list run-length-based single-pass connected component analysis for real-time embedded hardware

Conventional connected component analysis (CCA) algorithms render a slow performance in real-time embedded applications due to multiple passes to resolve label equivalences. As this fundamental task becomes crucial for stream processing, single-pass algorithms were introduced to enable a stream-orie...

Full description

Saved in:
Bibliographic Details
Main Authors: Tang, Jia Wei, Shaikh-Husin, Nasir, Sheikh, Usman Ullah, Marsono, Muhammad Nadzir
Format: Article
Published: Springer Verlag 2016
Subjects:
Online Access:http://eprints.utm.my/id/eprint/72825/
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84963700595&doi=10.1007%2fs11554-016-0590-2&partnerID=40&md5=695f804cf835a5c6bc3d1fb23f3bd0ea
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.72825
record_format eprints
spelling my.utm.728252017-11-20T08:14:58Z http://eprints.utm.my/id/eprint/72825/ A linked list run-length-based single-pass connected component analysis for real-time embedded hardware Tang, Jia Wei Shaikh-Husin, Nasir Sheikh, Usman Ullah Marsono, Muhammad Nadzir TK7885-7895 Computer engineer. Computer hardware Conventional connected component analysis (CCA) algorithms render a slow performance in real-time embedded applications due to multiple passes to resolve label equivalences. As this fundamental task becomes crucial for stream processing, single-pass algorithms were introduced to enable a stream-oriented hardware design. However, most single-pass CCA algorithms in the literature inhibit maximum streaming throughput as additional time such as horizontal blanking period is required to resolve label equivalence. This paper proposes a novel single-pass CCA algorithm, using a combination of linked list and run-length-based techniques to label and resolve equivalences as well as extracting the object features in a single raster scan. The proposed algorithm involves a label recycling scheme which attains low memory requirement design. Experimental results show the implementation of the proposed CCA achieves one cycle per pixel throughput and surpasses the most memory-efficient state-of-the-art work up to 25 % reduction in memory usage for (Formula presented.) pixels image. Springer Verlag 2016 Article PeerReviewed Tang, Jia Wei and Shaikh-Husin, Nasir and Sheikh, Usman Ullah and Marsono, Muhammad Nadzir (2016) A linked list run-length-based single-pass connected component analysis for real-time embedded hardware. Journal of Real-Time Image Processing . pp. 1-19. ISSN 1861-8200 (In Press) https://www.scopus.com/inward/record.uri?eid=2-s2.0-84963700595&doi=10.1007%2fs11554-016-0590-2&partnerID=40&md5=695f804cf835a5c6bc3d1fb23f3bd0ea
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic TK7885-7895 Computer engineer. Computer hardware
spellingShingle TK7885-7895 Computer engineer. Computer hardware
Tang, Jia Wei
Shaikh-Husin, Nasir
Sheikh, Usman Ullah
Marsono, Muhammad Nadzir
A linked list run-length-based single-pass connected component analysis for real-time embedded hardware
description Conventional connected component analysis (CCA) algorithms render a slow performance in real-time embedded applications due to multiple passes to resolve label equivalences. As this fundamental task becomes crucial for stream processing, single-pass algorithms were introduced to enable a stream-oriented hardware design. However, most single-pass CCA algorithms in the literature inhibit maximum streaming throughput as additional time such as horizontal blanking period is required to resolve label equivalence. This paper proposes a novel single-pass CCA algorithm, using a combination of linked list and run-length-based techniques to label and resolve equivalences as well as extracting the object features in a single raster scan. The proposed algorithm involves a label recycling scheme which attains low memory requirement design. Experimental results show the implementation of the proposed CCA achieves one cycle per pixel throughput and surpasses the most memory-efficient state-of-the-art work up to 25 % reduction in memory usage for (Formula presented.) pixels image.
format Article
author Tang, Jia Wei
Shaikh-Husin, Nasir
Sheikh, Usman Ullah
Marsono, Muhammad Nadzir
author_facet Tang, Jia Wei
Shaikh-Husin, Nasir
Sheikh, Usman Ullah
Marsono, Muhammad Nadzir
author_sort Tang, Jia Wei
title A linked list run-length-based single-pass connected component analysis for real-time embedded hardware
title_short A linked list run-length-based single-pass connected component analysis for real-time embedded hardware
title_full A linked list run-length-based single-pass connected component analysis for real-time embedded hardware
title_fullStr A linked list run-length-based single-pass connected component analysis for real-time embedded hardware
title_full_unstemmed A linked list run-length-based single-pass connected component analysis for real-time embedded hardware
title_sort linked list run-length-based single-pass connected component analysis for real-time embedded hardware
publisher Springer Verlag
publishDate 2016
url http://eprints.utm.my/id/eprint/72825/
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84963700595&doi=10.1007%2fs11554-016-0590-2&partnerID=40&md5=695f804cf835a5c6bc3d1fb23f3bd0ea
_version_ 1643656521824862208
score 13.160551