This paper proposes a method to achieve a virtually-lossless compression of medical images. An image is normalized to the standard deviation of its noise, which is adaptively estimated in an unsupervised fashion. The resulting bit map is encoded without any further loss. The compression algorithm is based on a classified linear-regression prediction followed by context-based arithmetic coding of the outcome residuals. Images are partitioned into blocks, e.g., 16×16, and a minimum mean square (MMSE) linear predictor is calculated for each block. Given a preset number of classes, a Fuzzy-C-Means algorithm produces an initial guess of classified predictors to be fed to an iterative procedure which classifies pixel blocks simultaneously refining the associated predictors. All the predictors are transmitted along with the label of each block. Coding time are affordable thanks to fast convergence of the iterative algorithms. Decoding is always performed in real time. The compression scheme provides impressive performances, especially when applied to X-ray images.
Virtually-lossless compression of medical images through classified prediction and context-based arithmetic coding / Aiazzi, Bruno; Alparone, Luciano; Baronti, Stefano; Lotti, Franco. - STAMPA. - 3653:(1999), pp. 1033-1040. (Intervento presentato al convegno Proceedings of the 1999 Visual Communications and Image Processing tenutosi a San Jose, CA, USA nel 25 - 27 January 1999) [10.1117/12.334609].
Virtually-lossless compression of medical images through classified prediction and context-based arithmetic coding
ALPARONE, LUCIANO;
1999
Abstract
This paper proposes a method to achieve a virtually-lossless compression of medical images. An image is normalized to the standard deviation of its noise, which is adaptively estimated in an unsupervised fashion. The resulting bit map is encoded without any further loss. The compression algorithm is based on a classified linear-regression prediction followed by context-based arithmetic coding of the outcome residuals. Images are partitioned into blocks, e.g., 16×16, and a minimum mean square (MMSE) linear predictor is calculated for each block. Given a preset number of classes, a Fuzzy-C-Means algorithm produces an initial guess of classified predictors to be fed to an iterative procedure which classifies pixel blocks simultaneously refining the associated predictors. All the predictors are transmitted along with the label of each block. Coding time are affordable thanks to fast convergence of the iterative algorithms. Decoding is always performed in real time. The compression scheme provides impressive performances, especially when applied to X-ray images.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.