Digital medical images are becoming even more widespread and used in a large variety of applications. Such images are often stored in local repositories and need to be transmitted/received over the network. Therefore, data compression is an essential mechanism to adopt for improving the transmission time, as well as to optimize the required storage space. However, due to the clinical relevance of such data, lossless techniques are almost ever preferred, given that in such context it is not tolerated any loss of data. In this work, starting from the Medical Images Lossless Compression (MILC) algorithm, which enables the efficient coding of three-dimensional medical images achieving results comparable with the other state-of-art algorithms, we propose Parallel MILC, a fully parallelized version of that algorithm, which provides some attractive features with respect to MILC, especially in terms of execution speedup and scalability. In detail, we propose a novel design and implementation for the MILC algorithm, which is able to exploit the power and the capabilities of the parallel computing paradigm. It is important to point out that Parallel MILC can be executed on several heterogeneous device types supporting OpenCL (i.e. CPU, GPU, FPGA, etc.). The preliminary test results show a significant performance speedup of Parallel MILC compared to MILC. Consequently, the novel algorithm we propose provides MILC with strong scalability properties and complete transparency with respect the underlying hardware.
|Titolo:||Parallel low-complexity lossless coding of three-dimensional medical images|
|Data di pubblicazione:||2014|
|Appare nelle tipologie:||4.1.1 Proceedings con DOI|