A successively refinable lossless image-coding algorithm

Ismail Avcibaş, Nasir Memon, Bülent Sankur, Khalid Sayood

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

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 refining 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.

Original languageEnglish (US)
Pages (from-to)445-452
Number of pages8
JournalIEEE Transactions on Communications
Volume53
Issue number3
DOIs
StatePublished - Mar 1 2005

Fingerprint

Image coding
Probability density function
Data compression
Refining
Decoding
Pixels

Keywords

  • Embedded bit stream
  • Image compression
  • Lossless compression
  • Near-lossless compression
  • Probability mass estimation
  • Successive refinement

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

A successively refinable lossless image-coding algorithm. / Avcibaş, Ismail; Memon, Nasir; Sankur, Bülent; Sayood, Khalid.

In: IEEE Transactions on Communications, Vol. 53, No. 3, 01.03.2005, p. 445-452.

Research output: Contribution to journalArticle

Avcibaş, Ismail ; Memon, Nasir ; Sankur, Bülent ; Sayood, Khalid. / A successively refinable lossless image-coding algorithm. In: IEEE Transactions on Communications. 2005 ; Vol. 53, No. 3. pp. 445-452.
@article{4cf14674a4ee4ecdb2318b8a1345a303,
title = "A successively refinable lossless image-coding algorithm",
abstract = "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 refining 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.",
keywords = "Embedded bit stream, Image compression, Lossless compression, Near-lossless compression, Probability mass estimation, Successive refinement",
author = "Ismail Avcibaş and Nasir Memon and B{\"u}lent Sankur and Khalid Sayood",
year = "2005",
month = "3",
day = "1",
doi = "10.1109/TCOMM.2005.843421",
language = "English (US)",
volume = "53",
pages = "445--452",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - A successively refinable lossless image-coding algorithm

AU - Avcibaş, Ismail

AU - Memon, Nasir

AU - Sankur, Bülent

AU - Sayood, Khalid

PY - 2005/3/1

Y1 - 2005/3/1

N2 - 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 refining 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.

AB - 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 refining 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.

KW - Embedded bit stream

KW - Image compression

KW - Lossless compression

KW - Near-lossless compression

KW - Probability mass estimation

KW - Successive refinement

UR - http://www.scopus.com/inward/record.url?scp=17644378390&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17644378390&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2005.843421

DO - 10.1109/TCOMM.2005.843421

M3 - Article

VL - 53

SP - 445

EP - 452

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 3

ER -