Reordering palettes for archiving color-mapped images

Nasir D. Memon, Ayalur S. Venkateswaran

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

Abstract

Linear predictive techniques perform poorly when used with color-mapped images where pixel values represent indices that point to color values in a look-up table. Re-ordering the color table, however, can lead to a lower entropy of prediction errors. In this paper we investigate the problem of ordering the color table such that the absolute sum of prediction errors is minimized. The problem turns out to be intractable, even for the simple case of 1D prediction schemes. We given two heuristic solutions for the problem and use them for ordering the color table prior to encoding the image by lossless DPCM like techniques. The first heuristic is based on a simulated annealing approach and is computationally expensive. The second heuristic, however, is simple and sacrifices optimality for computational efficiency. It involves successive merging of ordered sets of color table entries until all the entries have been merged into a single set. Simulation results giving comparison of the two heuristics with previous approaches are presented. It is seen that significant improvements can be obtained with the proposed heuristics. We then use a simple error modeling technique to encode prediction residuals and demonstrate the improvements in actual bit rates that can be achieved over dictionary based coding schemes that are commonly employed for color-mapped images.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsC.-C.J. Kuo
Pages221-231
Number of pages11
Volume2606
StatePublished - 1995
EventDigital Image Storage and Archiving Systems - Philadelphia, PA, USA
Duration: Oct 25 1995Oct 26 1995

Other

OtherDigital Image Storage and Archiving Systems
CityPhiladelphia, PA, USA
Period10/25/9510/26/95

Fingerprint

Color
color
predictions
entry
coding
differential pulse code modulation
dictionaries
simulated annealing
Glossaries
Computational efficiency
Simulated annealing
Merging
Entropy
Pixels
pixels
entropy
simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Memon, N. D., & Venkateswaran, A. S. (1995). Reordering palettes for archiving color-mapped images. In C-CJ. Kuo (Ed.), Proceedings of SPIE - The International Society for Optical Engineering (Vol. 2606, pp. 221-231)

Reordering palettes for archiving color-mapped images. / Memon, Nasir D.; Venkateswaran, Ayalur S.

Proceedings of SPIE - The International Society for Optical Engineering. ed. / C.-C.J. Kuo. Vol. 2606 1995. p. 221-231.

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

Memon, ND & Venkateswaran, AS 1995, Reordering palettes for archiving color-mapped images. in C-CJ Kuo (ed.), Proceedings of SPIE - The International Society for Optical Engineering. vol. 2606, pp. 221-231, Digital Image Storage and Archiving Systems, Philadelphia, PA, USA, 10/25/95.
Memon ND, Venkateswaran AS. Reordering palettes for archiving color-mapped images. In Kuo C-CJ, editor, Proceedings of SPIE - The International Society for Optical Engineering. Vol. 2606. 1995. p. 221-231
Memon, Nasir D. ; Venkateswaran, Ayalur S. / Reordering palettes for archiving color-mapped images. Proceedings of SPIE - The International Society for Optical Engineering. editor / C.-C.J. Kuo. Vol. 2606 1995. pp. 221-231
@inproceedings{3a193ac308a64b0bb6ea40ac8a031bb4,
title = "Reordering palettes for archiving color-mapped images",
abstract = "Linear predictive techniques perform poorly when used with color-mapped images where pixel values represent indices that point to color values in a look-up table. Re-ordering the color table, however, can lead to a lower entropy of prediction errors. In this paper we investigate the problem of ordering the color table such that the absolute sum of prediction errors is minimized. The problem turns out to be intractable, even for the simple case of 1D prediction schemes. We given two heuristic solutions for the problem and use them for ordering the color table prior to encoding the image by lossless DPCM like techniques. The first heuristic is based on a simulated annealing approach and is computationally expensive. The second heuristic, however, is simple and sacrifices optimality for computational efficiency. It involves successive merging of ordered sets of color table entries until all the entries have been merged into a single set. Simulation results giving comparison of the two heuristics with previous approaches are presented. It is seen that significant improvements can be obtained with the proposed heuristics. We then use a simple error modeling technique to encode prediction residuals and demonstrate the improvements in actual bit rates that can be achieved over dictionary based coding schemes that are commonly employed for color-mapped images.",
author = "Memon, {Nasir D.} and Venkateswaran, {Ayalur S.}",
year = "1995",
language = "English (US)",
isbn = "0819419702",
volume = "2606",
pages = "221--231",
editor = "C.-C.J. Kuo",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - Reordering palettes for archiving color-mapped images

AU - Memon, Nasir D.

AU - Venkateswaran, Ayalur S.

PY - 1995

Y1 - 1995

N2 - Linear predictive techniques perform poorly when used with color-mapped images where pixel values represent indices that point to color values in a look-up table. Re-ordering the color table, however, can lead to a lower entropy of prediction errors. In this paper we investigate the problem of ordering the color table such that the absolute sum of prediction errors is minimized. The problem turns out to be intractable, even for the simple case of 1D prediction schemes. We given two heuristic solutions for the problem and use them for ordering the color table prior to encoding the image by lossless DPCM like techniques. The first heuristic is based on a simulated annealing approach and is computationally expensive. The second heuristic, however, is simple and sacrifices optimality for computational efficiency. It involves successive merging of ordered sets of color table entries until all the entries have been merged into a single set. Simulation results giving comparison of the two heuristics with previous approaches are presented. It is seen that significant improvements can be obtained with the proposed heuristics. We then use a simple error modeling technique to encode prediction residuals and demonstrate the improvements in actual bit rates that can be achieved over dictionary based coding schemes that are commonly employed for color-mapped images.

AB - Linear predictive techniques perform poorly when used with color-mapped images where pixel values represent indices that point to color values in a look-up table. Re-ordering the color table, however, can lead to a lower entropy of prediction errors. In this paper we investigate the problem of ordering the color table such that the absolute sum of prediction errors is minimized. The problem turns out to be intractable, even for the simple case of 1D prediction schemes. We given two heuristic solutions for the problem and use them for ordering the color table prior to encoding the image by lossless DPCM like techniques. The first heuristic is based on a simulated annealing approach and is computationally expensive. The second heuristic, however, is simple and sacrifices optimality for computational efficiency. It involves successive merging of ordered sets of color table entries until all the entries have been merged into a single set. Simulation results giving comparison of the two heuristics with previous approaches are presented. It is seen that significant improvements can be obtained with the proposed heuristics. We then use a simple error modeling technique to encode prediction residuals and demonstrate the improvements in actual bit rates that can be achieved over dictionary based coding schemes that are commonly employed for color-mapped images.

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

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

M3 - Conference contribution

AN - SCOPUS:0029528582

SN - 0819419702

SN - 9780819419705

VL - 2606

SP - 221

EP - 231

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

A2 - Kuo, C.-C.J.

ER -