A differential lossless image compression scheme

Khalid Sayood, Karen Anderson

Research output: Contribution to conferencePaper

Abstract

A simple, easy to implement real-time lossless image coding algorithm which takes into account the pixel-to-pixel correlation in an image is presented. The algorithm has built-in limits to the variance in the size of the codewords, and seems to react robustly to mismatch between the assumed and actual statistics. Because of the limited dynamic range in codeword size it is not expected to have significant buffer overflow and underflow problems. Test results using this algorithm are presented.

Original languageEnglish (US)
Pages329-332
Number of pages4
StatePublished - Dec 1 1990
EventProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) - Champaign, IL, USA
Duration: Aug 14 1989Aug 16 1989

Other

OtherProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2)
CityChampaign, IL, USA
Period8/14/898/16/89

Fingerprint

Image compression
Pixels
Image coding
Buffers
Statistics

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Cite this

Sayood, K., & Anderson, K. (1990). A differential lossless image compression scheme. 329-332. Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .

A differential lossless image compression scheme. / Sayood, Khalid; Anderson, Karen.

1990. 329-332 Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .

Research output: Contribution to conferencePaper

Sayood, K & Anderson, K 1990, 'A differential lossless image compression scheme', Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, 8/14/89 - 8/16/89 pp. 329-332.
Sayood K, Anderson K. A differential lossless image compression scheme. 1990. Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .
Sayood, Khalid ; Anderson, Karen. / A differential lossless image compression scheme. Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .4 p.
@conference{d2528d88133c42b1b2d09bdc817c8e88,
title = "A differential lossless image compression scheme",
abstract = "A simple, easy to implement real-time lossless image coding algorithm which takes into account the pixel-to-pixel correlation in an image is presented. The algorithm has built-in limits to the variance in the size of the codewords, and seems to react robustly to mismatch between the assumed and actual statistics. Because of the limited dynamic range in codeword size it is not expected to have significant buffer overflow and underflow problems. Test results using this algorithm are presented.",
author = "Khalid Sayood and Karen Anderson",
year = "1990",
month = "12",
day = "1",
language = "English (US)",
pages = "329--332",
note = "Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) ; Conference date: 14-08-1989 Through 16-08-1989",

}

TY - CONF

T1 - A differential lossless image compression scheme

AU - Sayood, Khalid

AU - Anderson, Karen

PY - 1990/12/1

Y1 - 1990/12/1

N2 - A simple, easy to implement real-time lossless image coding algorithm which takes into account the pixel-to-pixel correlation in an image is presented. The algorithm has built-in limits to the variance in the size of the codewords, and seems to react robustly to mismatch between the assumed and actual statistics. Because of the limited dynamic range in codeword size it is not expected to have significant buffer overflow and underflow problems. Test results using this algorithm are presented.

AB - A simple, easy to implement real-time lossless image coding algorithm which takes into account the pixel-to-pixel correlation in an image is presented. The algorithm has built-in limits to the variance in the size of the codewords, and seems to react robustly to mismatch between the assumed and actual statistics. Because of the limited dynamic range in codeword size it is not expected to have significant buffer overflow and underflow problems. Test results using this algorithm are presented.

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

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

M3 - Paper

AN - SCOPUS:0025627118

SP - 329

EP - 332

ER -