All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Speed up of volumetric nonlocal transform-domain filter

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F17%3A10237363" target="_blank" >RIV/61989100:27740/17:10237363 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.ctresources.info/ccp/paper.html?id=9226" target="_blank" >http://www.ctresources.info/ccp/paper.html?id=9226</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4203/ccp.111.4" target="_blank" >10.4203/ccp.111.4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Speed up of volumetric nonlocal transform-domain filter

  • Original language description

    We present a parallel implementation of Non-local Transform-Domain filter (BM4D) in this paper. Effectiveness of this implementation is presented on de-noising of 3D images from Computed Tomography (CT) and Magnetic Resonance Imaging (MRI) scans. The principle of BM4D filter is that this filter performs grouping and collaborative filtering where mutually similar data within the image are stacked together and filtered. In BM4D cubes of voxels, called patches, are used as basic image elements for filtering. Using voxels instead of pixels means that the area for searching the similar patches is quite large. Because of this and due to the application of multi-dimensional transformations the BM4D&apos;s computation time is extremely long. Despite that, only single-threaded implementation is presented in the literature. To speed up the filtering process, multi-core or even multi-node parallel implementation is necessary. In this paper, we present original parallel version of the filter. To parallelize the BM4D implementation, the filtering concept is decomposed to smaller parts which can be solved concurrently. Our implementation uses hybrid parallelization, which combines OpenMP and MPI technologies. We use OpenMP for the parallelization on one computational node and MPI for parallelization among more computational nodes. The speed up of our parallel implementation is demonstrated on several numerical examples. © Civil-Comp Press, 2017.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/LM2015070" target="_blank" >LM2015070: IT4Innovations National Supercomputing Center</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Civil-Comp Proceedings. Volume 111

  • ISSN

    1759-3433

  • e-ISSN

  • Volume of the periodical

    111

  • Issue of the periodical within the volume

    podzim

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    13

  • Pages from-to

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85020478523