Combinatorial Transforms : Application in Lossless Image Compression

Abstract : Common image compression standards are usually based on frequency transform such as Discrete Cosine Transform. We present a different approach for lossless image compression, which is based on a combinatorial transform. The main transform is Burrows Wheeler Transform (BWT) which tends to reorder symbols according to their following context. It becomes one of promising compression approach based on context modeling. BWT was initially applied for text compression software such as BZIP2 nevertheless it has been recently applied to the image compression field. Compression schemes based on the Burrows Wheeler Transform have been usually lossless; therefore we implement this algorithm in medical imaging in order to reconstruct every bit. Many variants of the three stages which form the original compression scheme can be found in the literature. We propose an analysis of the latest methods and the impact of their association and present an alternative compression scheme with a significant improvement over the current standards such as JPEG and JPEG2000.
Type de document :
Article dans une revue
Discrete Mathematical Sciences & Cryptography, 2011, 14 (2), pp.129-147
Liste complète des métadonnées
Contributeur : Julien Dubois <>
Soumis le : vendredi 6 janvier 2012 - 09:29:01
Dernière modification le : mardi 6 février 2018 - 15:56:16


  • HAL Id : hal-00657213, version 1



Syahrul Elfitrin, Julien Dubois, Vajnovszki Vincent. Combinatorial Transforms : Application in Lossless Image Compression. Discrete Mathematical Sciences & Cryptography, 2011, 14 (2), pp.129-147. 〈hal-00657213〉



Consultations de la notice