Lossless and near-lossless image compression with successive refinement

İsmail Avcibaş, Nasir Memon, Bülent Sankur, Khalid Sayood

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in progressive reconstruction of the image just like 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 each layer of the successively refinable bitstream is decoded. We formulate the image data compression problem as one of asking the optimal questions to determine, respectively, the value or the interval of the pixel, depending on whether one is interested in lossless or near-lossless compression. New prediction methods based on the nature of the data at a given pass are presented and links to the existing methods are explored. The trade-off between non-causal prediction and data precision is discussed within the context of successive refinement. Context selection for prediction in different passes is addressed. Finally, experimental results for both lossless and near-lossless cases are presented, which are competitive with the state-of-the-art compression schemes.

Original languageEnglish (US)
Pages (from-to)41-52
Number of pages12
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume4310
DOIs
StatePublished - Jan 1 2001

Fingerprint

Lossless Image Compression
Image compression
Refinement
Lossless Compression
predictions
Prediction
data compression
Data compression
Progressive Transmission
Image Compression
Data Compression
Pixels
pixels
intervals
Wavelets
Compression
Pixel
Trade-offs
Interval
Experimental Results

Keywords

  • Causal non-causal prediction
  • Density estimation
  • Embedded bit stream
  • Lossless compression
  • Near-lossless compression
  • Rate scalable compression
  • Successive refinement

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Lossless and near-lossless image compression with successive refinement. / Avcibaş, İsmail; Memon, Nasir; Sankur, Bülent; Sayood, Khalid.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 4310, 01.01.2001, p. 41-52.

Research output: Contribution to journalArticle

@article{d3f98b662a4440308b23b0408f28d943,
title = "Lossless and near-lossless image compression with successive refinement",
abstract = "We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in progressive reconstruction of the image just like 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 each layer of the successively refinable bitstream is decoded. We formulate the image data compression problem as one of asking the optimal questions to determine, respectively, the value or the interval of the pixel, depending on whether one is interested in lossless or near-lossless compression. New prediction methods based on the nature of the data at a given pass are presented and links to the existing methods are explored. The trade-off between non-causal prediction and data precision is discussed within the context of successive refinement. Context selection for prediction in different passes is addressed. Finally, experimental results for both lossless and near-lossless cases are presented, which are competitive with the state-of-the-art compression schemes.",
keywords = "Causal non-causal prediction, Density estimation, Embedded bit stream, Lossless compression, Near-lossless compression, Rate scalable compression, Successive refinement",
author = "İsmail Avcibaş and Nasir Memon and B{\"u}lent Sankur and Khalid Sayood",
year = "2001",
month = "1",
day = "1",
doi = "10.1117/12.411838",
language = "English (US)",
volume = "4310",
pages = "41--52",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

T1 - Lossless and near-lossless image compression with successive refinement

AU - Avcibaş, İsmail

AU - Memon, Nasir

AU - Sankur, Bülent

AU - Sayood, Khalid

PY - 2001/1/1

Y1 - 2001/1/1

N2 - We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in progressive reconstruction of the image just like 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 each layer of the successively refinable bitstream is decoded. We formulate the image data compression problem as one of asking the optimal questions to determine, respectively, the value or the interval of the pixel, depending on whether one is interested in lossless or near-lossless compression. New prediction methods based on the nature of the data at a given pass are presented and links to the existing methods are explored. The trade-off between non-causal prediction and data precision is discussed within the context of successive refinement. Context selection for prediction in different passes is addressed. Finally, experimental results for both lossless and near-lossless cases are presented, which are competitive with the state-of-the-art compression schemes.

AB - We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in progressive reconstruction of the image just like 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 each layer of the successively refinable bitstream is decoded. We formulate the image data compression problem as one of asking the optimal questions to determine, respectively, the value or the interval of the pixel, depending on whether one is interested in lossless or near-lossless compression. New prediction methods based on the nature of the data at a given pass are presented and links to the existing methods are explored. The trade-off between non-causal prediction and data precision is discussed within the context of successive refinement. Context selection for prediction in different passes is addressed. Finally, experimental results for both lossless and near-lossless cases are presented, which are competitive with the state-of-the-art compression schemes.

KW - Causal non-causal prediction

KW - Density estimation

KW - Embedded bit stream

KW - Lossless compression

KW - Near-lossless compression

KW - Rate scalable compression

KW - Successive refinement

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

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

U2 - 10.1117/12.411838

DO - 10.1117/12.411838

M3 - Article

AN - SCOPUS:0035054602

VL - 4310

SP - 41

EP - 52

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -