New error criterion for near-lossless image compression

Nasir Memon, Nader Moayeri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents a new criterion for near-lossless image compression and compares it with the more familiar maximum pixel error criterion in terms of compression performance and coded image subjective quality. In this new framework we compress an image in such a way that at each pixel the total error between the original and the coded images over a W×W window around the pixel does not exceed ε in magnitude. The new criterion's main advantage is that it preserves image brightness and color. The compression scheme used in this work is similar to a trellis-searched scheme proposed by Ke and Marcellin in that our scheme is also a predictive, context-based scheme. However, the search for an optimal path, representing a set of reconstruction values for an image row that satisfies the error criterion and yields the minimum bit rate, has to be done in a planar directed graph instead of a trellis. We show that this framework is also applicable to a joint image filtering and compression scenario. We present simulation results showing the performance of the new error criterion and compare it with the maximum pixel error criterion.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Image Processing
PublisherIEEE Comp Soc
Pages662-665
Number of pages4
Volume3
StatePublished - 1997
EventProceedings of the 1997 International Conference on Image Processing. Part 2 (of 3) - Santa Barbara, CA, USA
Duration: Oct 26 1997Oct 29 1997

Other

OtherProceedings of the 1997 International Conference on Image Processing. Part 2 (of 3)
CitySanta Barbara, CA, USA
Period10/26/9710/29/97

Fingerprint

Image compression
Pixels
Directed graphs
Luminance
Color

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Memon, N., & Moayeri, N. (1997). New error criterion for near-lossless image compression. In IEEE International Conference on Image Processing (Vol. 3, pp. 662-665). IEEE Comp Soc.

New error criterion for near-lossless image compression. / Memon, Nasir; Moayeri, Nader.

IEEE International Conference on Image Processing. Vol. 3 IEEE Comp Soc, 1997. p. 662-665.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Memon, N & Moayeri, N 1997, New error criterion for near-lossless image compression. in IEEE International Conference on Image Processing. vol. 3, IEEE Comp Soc, pp. 662-665, Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, 10/26/97.
Memon N, Moayeri N. New error criterion for near-lossless image compression. In IEEE International Conference on Image Processing. Vol. 3. IEEE Comp Soc. 1997. p. 662-665
Memon, Nasir ; Moayeri, Nader. / New error criterion for near-lossless image compression. IEEE International Conference on Image Processing. Vol. 3 IEEE Comp Soc, 1997. pp. 662-665
@inproceedings{0ed8dc34fd804e18b2fb4c4a9a1c5b27,
title = "New error criterion for near-lossless image compression",
abstract = "This paper presents a new criterion for near-lossless image compression and compares it with the more familiar maximum pixel error criterion in terms of compression performance and coded image subjective quality. In this new framework we compress an image in such a way that at each pixel the total error between the original and the coded images over a W×W window around the pixel does not exceed ε in magnitude. The new criterion's main advantage is that it preserves image brightness and color. The compression scheme used in this work is similar to a trellis-searched scheme proposed by Ke and Marcellin in that our scheme is also a predictive, context-based scheme. However, the search for an optimal path, representing a set of reconstruction values for an image row that satisfies the error criterion and yields the minimum bit rate, has to be done in a planar directed graph instead of a trellis. We show that this framework is also applicable to a joint image filtering and compression scenario. We present simulation results showing the performance of the new error criterion and compare it with the maximum pixel error criterion.",
author = "Nasir Memon and Nader Moayeri",
year = "1997",
language = "English (US)",
volume = "3",
pages = "662--665",
booktitle = "IEEE International Conference on Image Processing",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - New error criterion for near-lossless image compression

AU - Memon, Nasir

AU - Moayeri, Nader

PY - 1997

Y1 - 1997

N2 - This paper presents a new criterion for near-lossless image compression and compares it with the more familiar maximum pixel error criterion in terms of compression performance and coded image subjective quality. In this new framework we compress an image in such a way that at each pixel the total error between the original and the coded images over a W×W window around the pixel does not exceed ε in magnitude. The new criterion's main advantage is that it preserves image brightness and color. The compression scheme used in this work is similar to a trellis-searched scheme proposed by Ke and Marcellin in that our scheme is also a predictive, context-based scheme. However, the search for an optimal path, representing a set of reconstruction values for an image row that satisfies the error criterion and yields the minimum bit rate, has to be done in a planar directed graph instead of a trellis. We show that this framework is also applicable to a joint image filtering and compression scenario. We present simulation results showing the performance of the new error criterion and compare it with the maximum pixel error criterion.

AB - This paper presents a new criterion for near-lossless image compression and compares it with the more familiar maximum pixel error criterion in terms of compression performance and coded image subjective quality. In this new framework we compress an image in such a way that at each pixel the total error between the original and the coded images over a W×W window around the pixel does not exceed ε in magnitude. The new criterion's main advantage is that it preserves image brightness and color. The compression scheme used in this work is similar to a trellis-searched scheme proposed by Ke and Marcellin in that our scheme is also a predictive, context-based scheme. However, the search for an optimal path, representing a set of reconstruction values for an image row that satisfies the error criterion and yields the minimum bit rate, has to be done in a planar directed graph instead of a trellis. We show that this framework is also applicable to a joint image filtering and compression scenario. We present simulation results showing the performance of the new error criterion and compare it with the maximum pixel error criterion.

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

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

M3 - Conference contribution

AN - SCOPUS:0031338624

VL - 3

SP - 662

EP - 665

BT - IEEE International Conference on Image Processing

PB - IEEE Comp Soc

ER -