A novel method for reversible compression of 2D and 3D data is presented. It consists of a spatial prediction followed by context-based classification and arithmetic coding of the outcome residuals. Prediction of a pixel to be encoded is obtained from the fuzzy-switching of a set of linear predictors, i.e., yielding linear combinations of surrounding pixels. The coefficients of each predictor are calculated to minimize prediction MSE for pixels belonging to a cluster in the hyperspace of graylevel patterns lying on a preset causal neighborhood. In the 3D case, pixels both on the current slice and on previously encoded slices may be used. The size and shape of the causal neighborhood, as well as the number of predictors to be switched, may be chosen before running the algorithm to determine the trade-off between coding performances and computational cost. The method exhibits impressive performances, for both 2D and 3D data, mainly thanks to the optimality of predictors, due to their skill in fitting patterns of data.

Lossless image compression based on a fuzzy linear prediction with context based entropy coding / Aiazzi, Bruno; Alba, Pasquale S.; Alparone, Luciano; Baronti, Stefano. - STAMPA. - 3:(1998), pp. 905-909. (Intervento presentato al convegno Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) tenutosi a Chicago, IL, USA nel 1998) [10.1109/ICIP.1998.727398].

Lossless image compression based on a fuzzy linear prediction with context based entropy coding

ALPARONE, LUCIANO;
1998

Abstract

A novel method for reversible compression of 2D and 3D data is presented. It consists of a spatial prediction followed by context-based classification and arithmetic coding of the outcome residuals. Prediction of a pixel to be encoded is obtained from the fuzzy-switching of a set of linear predictors, i.e., yielding linear combinations of surrounding pixels. The coefficients of each predictor are calculated to minimize prediction MSE for pixels belonging to a cluster in the hyperspace of graylevel patterns lying on a preset causal neighborhood. In the 3D case, pixels both on the current slice and on previously encoded slices may be used. The size and shape of the causal neighborhood, as well as the number of predictors to be switched, may be chosen before running the algorithm to determine the trade-off between coding performances and computational cost. The method exhibits impressive performances, for both 2D and 3D data, mainly thanks to the optimality of predictors, due to their skill in fitting patterns of data.
1998
IEEE International Conference on Image Processing
Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3)
Chicago, IL, USA
1998
Aiazzi, Bruno; Alba, Pasquale S.; Alparone, Luciano; Baronti, Stefano
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1075603
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 1
social impact