With many attractive attributes, photon counting detectors with many energy bins are being considered for clinical CT systems. In practice, a large amount of projection data acquired for multiple energy bins must be transferred in real time through slip rings and data storage subsystems, causing a bandwidth bottleneck problem. The higher resolution of these detectors and the need for faster acquisition additionally contribute to this issue. In this work, we introduce a new approach to lossless compression, specifically for projection data from photon counting detectors, by utilizing the dependencies in the multi-energy data. The proposed predictor estimates the value of a projection data sample as a weighted average of its neighboring samples and an approximation from other energy bins, and the prediction residuals are then encoded. Context modeling using three or four quantized local gradients is also employed to detect edge characteristics of the data. Using three simulated phantoms including a head phantom, compression of 2.3:1-2.4:1 was achieved. The proposed predictor using zero, three, and four gradient contexts was compared to JPEG-LS and the ideal predictor (noiseless projection data). Among our proposed predictors, three-gradient context is preferred with a compression ratio from Golomb coding 7% higher than JPEG-LS and only 3% lower than the ideal predictor. In encoder efficiency, the Golomb code with the proposed three-gradient contexts has higher compression than block floating point. We also propose a lossy compression scheme, which quantizes the prediction residuals with scalar uniform quantization using quantization boundaries that limit the ratio of quantization error variance to quantum noise variance. Applying our proposed predictor with three-gradient context, the lossy compression achieved a compression ratio of 3.3:1 but inserted a 2.1% standard deviation of error compared to that of quantum noise in reconstructed images. From the initial simulation results, the proposed algorithm shows good control over the bits needed to represent multienergy projection data.
[1]
アルバート ダブリュー ウェゲナー,et al.
Adaptive compression of computer tomography projection data
,
2009
.
[2]
April Khademi,et al.
Pan-Canadian Evaluation of Irreversible Compression Ratios (“Lossy” Compression) for Development of National Guidelines
,
2008,
Journal of Digital Imaging.
[3]
A.N. Netravali,et al.
Picture coding: A review
,
1980,
Proceedings of the IEEE.
[4]
Günter Lauritsch,et al.
Simulation tools for two-dimensional experiments in x-ray computed tomography using the FORBILD head phantom
,
2012,
Physics in medicine and biology.
[5]
Guillermo Sapiro,et al.
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
,
2000,
IEEE Trans. Image Process..
[6]
David A Koff,et al.
An overview of digital compression of medical images: can we use lossy image compression in radiology?
,
2006,
Canadian Association of Radiologists journal = Journal l'Association canadienne des radiologistes.
[7]
Solomon W. Golomb,et al.
Run-length encodings (Corresp.)
,
1966,
IEEE Trans. Inf. Theory.
[8]
Yi Ling,et al.
Real-time compression of raw computed tomography data: technology, architecture, and benefits
,
2009,
Medical Imaging.
[9]
Susan S. Young,et al.
Statisically lossless image compression for CR and DR
,
1999,
Medical Imaging.
[10]
David C. van Voorhis,et al.
Optimal source codes for geometrically distributed integer alphabets (Corresp.)
,
1975,
IEEE Trans. Inf. Theory.
[11]
S. Golomb.
Run-length encodings.
,
1966
.
[12]
B. Whiting,et al.
CT data storage reduction by means of compressing projection data instead of images: feasibility study.
,
2001,
Radiology.