Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Signal Image and Vid...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Signal Image and Video Processing
Article . 2017 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
DBLP
Article
Data sources: DBLP
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Memory-efficient 3D connected component labeling with parallel computing

Authors: Norihiro Ohira;

Memory-efficient 3D connected component labeling with parallel computing

Abstract

Connected component labeling is a frequently used image processing task in many applications. Moreover, in recent years, the use of 3D image data has become widespread, for instance, in 3D X-ray computed tomography and magnetic resonance imaging. However, because ordinary labeling algorithms use a large amount of memory and 3D images are generally large, labeling 3D image data can cause memory shortages. Furthermore, labeling a large image is time-consuming. In this paper, we proposed new memory-efficient connected component labeling algorithm for 3D images with parallel computing. In this method, we accelerate the labeling process using parallel computing. In addition, we use a spans matrix and compressed label matrix to reduce memory usage. We also use an equivalence chain approach to speed up the calculation. Furthermore, the algorithm has two options for further processing performance or further memory savings. In the experiments on real examples, the proposed algorithm with the option for processing speed was faster and used less memory than the conventional label equivalence method. In contrast, with the proposed method using the memory-efficient option, we could further reduce memory from one-eighth to one-thirteenth that used by the label equivalence method while maintaining the same performance.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!