Union-Retire for Connected Components Analysis on FPGA

The Union-Retire CCA (UR-CCA) algorithm started a new paradigm for connected components analysis. Instead of using directed tree structures, UR-CCA focuses on connectivity. This algorithmic change leads to a reduction in required memory, with no end-of-row processing overhead. In this paper we descr...

Descripción completa

Detalles Bibliográficos
Autores principales: Bailey, Donald G., Klaiber, Michael J.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9030472/
https://www.ncbi.nlm.nih.gov/pubmed/35448215
http://dx.doi.org/10.3390/jimaging8040089
_version_ 1784692148034076672
author Bailey, Donald G.
Klaiber, Michael J.
author_facet Bailey, Donald G.
Klaiber, Michael J.
author_sort Bailey, Donald G.
collection PubMed
description The Union-Retire CCA (UR-CCA) algorithm started a new paradigm for connected components analysis. Instead of using directed tree structures, UR-CCA focuses on connectivity. This algorithmic change leads to a reduction in required memory, with no end-of-row processing overhead. In this paper we describe a hardware architecture based on UR-CCA and its realisation on an FPGA. The memory bandwidth and pipelining challenges of hardware UR-CCA are analysed and resolved. It is shown that up to 36% of memory resources can be saved using the proposed architecture. This translates directly to a smaller device for an FPGA implementation.
format Online
Article
Text
id pubmed-9030472
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-90304722022-04-23 Union-Retire for Connected Components Analysis on FPGA Bailey, Donald G. Klaiber, Michael J. J Imaging Article The Union-Retire CCA (UR-CCA) algorithm started a new paradigm for connected components analysis. Instead of using directed tree structures, UR-CCA focuses on connectivity. This algorithmic change leads to a reduction in required memory, with no end-of-row processing overhead. In this paper we describe a hardware architecture based on UR-CCA and its realisation on an FPGA. The memory bandwidth and pipelining challenges of hardware UR-CCA are analysed and resolved. It is shown that up to 36% of memory resources can be saved using the proposed architecture. This translates directly to a smaller device for an FPGA implementation. MDPI 2022-03-24 /pmc/articles/PMC9030472/ /pubmed/35448215 http://dx.doi.org/10.3390/jimaging8040089 Text en © 2022 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Bailey, Donald G.
Klaiber, Michael J.
Union-Retire for Connected Components Analysis on FPGA
title Union-Retire for Connected Components Analysis on FPGA
title_full Union-Retire for Connected Components Analysis on FPGA
title_fullStr Union-Retire for Connected Components Analysis on FPGA
title_full_unstemmed Union-Retire for Connected Components Analysis on FPGA
title_short Union-Retire for Connected Components Analysis on FPGA
title_sort union-retire for connected components analysis on fpga
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9030472/
https://www.ncbi.nlm.nih.gov/pubmed/35448215
http://dx.doi.org/10.3390/jimaging8040089
work_keys_str_mv AT baileydonaldg unionretireforconnectedcomponentsanalysisonfpga
AT klaibermichaelj unionretireforconnectedcomponentsanalysisonfpga

Ejemplares similares