A novel method for reversible compression of 2D and 3D data is presented. An adaptive spatial prediction is followed by a context-based classification with 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. 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 wed. 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 and 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 data patterns.
Reversible compression of 2D and 3D data through a fuzzy linear prediction with context-based arithmetic coding / Aiazzi, Bruno; Alba, Pasquale S.; Alparone, Luciano; Baronti, Stefano. - STAMPA. - 3456:(1998), pp. 126-133. (Intervento presentato al convegno Mathematics of Data/Image Coding. Compression, and Encryption tenutosi a San Diego, CA, usa nel 21 - 22 July 1998) [10.1117/12.330363].
Reversible compression of 2D and 3D data through a fuzzy linear prediction with context-based arithmetic coding
ALPARONE, LUCIANO;
1998
Abstract
A novel method for reversible compression of 2D and 3D data is presented. An adaptive spatial prediction is followed by a context-based classification with 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. 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 wed. 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 and 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 data patterns.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.