Low-complexity Three-dimensional Discrete Hartley Transform Approximations for Medical Image Compression
V. A. Coutinho, F. M. Bayer, R. J. Cintra

TL;DR
This paper introduces multiplierless 3D DHT approximations for medical image compression, significantly reducing computational complexity and execution time, suitable for resource-constrained biomedical devices.
Contribution
It proposes novel fixed-point, multiplierless 3D DHT approximations derived via tensor formalism, enabling efficient implementation in low-power medical imaging devices.
Findings
Achieves over 98% SSIM in lossy compression
Reduces multiplicative complexity by 100%
Decreases execution time by up to 90% on ARM Cortex-M0+
Abstract
The discrete Hartley transform (DHT) is a useful tool for medical image coding. The three-dimensional DHT (3D DHT) can be employed to compress medical image data, such as magnetic resonance and X-ray angiography. However, the computation of the 3D DHT involves several multiplications by irrational quantities, which require floating-point arithmetic and inherent truncation errors. In recent years, a significant progress in wireless and implantable biomedical devices has been achieved. Such devices present critical power and hardware limitations. The multiplication operation demands higher hardware, power, and time consumption than other arithmetic operations, such as addition and bit-shifts. In this work, we present a set of multiplierless DHT approximations, which can be implemented with fixed-point arithmetic. We derive 3D DHT approximations by employing tensor formalism. Such proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
