| Paul Heckbert.
Color Image Quantization for Frame Buffer Display, Computer Graphics July 1982.
Vol. 16 No. 3
pp. 297-307.
http://pecan.srv.cs.cmu.edu/afs/cs.cmu.edu/user/ph/www/ciq_thesis
|
ABSTRACT:
Algorithms for adaptive, tapered quantization of color images are described. The research is motivated by the desire to display high-quality reproductions of color images with small frame buffers. It is demonstrated that many color images which would normally require a frame buffer having 15 bits per pixel can be quantized to 8 or fewer bits per pixel with little subjective degradation. In most cases, the resulting images look significantly better than those made with uniform quantization.
Available at: http://pecan.srv.cs.cmu.edu/afs/cs.cmu.edu/user/ph/www/ciq_thesis The color image quantization task is broken into four phases: 1) Sampling the original image for color statistics 2) Choosing a colormap based on the color statistics 3) Mapping original colors to their nearest neighbors in the colormap 4) Quantizing and redrawing the original image (with optional dither). Several algorithms for each of phases 2-4 are described, and images created by each given. CR CATEGORIES: H.3.3 (Information Storage and Retrieval): Information Search and Retrieval - clustering; search process; 1.3.3 (Computer Graphics): Picture/Image Generation - digitization and scanning; display algorithms; 1.4.1 (Image Processing): Digitization - quantization. General Terms: Algorithms. Additional Key Words and Phrases: dither | ||||||||
|
| Neil's Homepage | Steganography | JJTC Main Page | Copyright, ©1995-2008, Neil F. Johnson. All Rights Reserved.
| |||||||||
