A successively refinable lossless image-coding algorithm

Avcibas I., Memon N., Sankur B., Sayood K.

IEEE TRANSACTIONS ON COMMUNICATIONS, vol.53, no.3, pp.445-452, 2005 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Article
  • Volume: 53 Issue: 3
  • Publication Date: 2005
  • Doi Number: 10.1109/tcomm.2005.843421
  • Journal Indexes: Science Citation Index Expanded, Scopus
  • Page Numbers: pp.445-452


We present a compression technique that provides progressive transmission as well as lossless and near-lossless compression in a single framework. The proposed technique produces a bit stream that results in a progressive, and ultimately lossless, reconstruction of an image similar to what one can obtain with a reversible wavelet codec. In addition, the proposed scheme provides near-lossless reconstruction with respect to a given bound, after decoding of each layer of the successively refinable bit stream. We formulate the image data-compression problem as one of successively relining the probability density function (pdf) estimate of each pixel. Within this framework, restricting the region of support of the estimated pdf to a fixed size interval then results in near-lossless reconstruction. We address the context-selection problem, as well as pdf-estimation methods based on context data at any pass. Experimental results for both lossless and near-lossless cases indicate that the proposed compression scheme, that innovatively combines lossless, near-lossless, and progressive coding attributes, gives competitive performance in comparison with state-of-the-art compression schemes.