The color cut quantization algorithm

Authors:
Rance D. Necaise;Richard H. Prosl
Affiliations:
Washington and Lee University, Lexington, VA;The College of William and Mary, Williamsburg, VA
Venue:
Proceedings of the 47th Annual Southeast Regional Conference
Year:
2009

Citing 7
Cited 1

Vector quantization and signal compression

Vector quantization and signal compression
Color Image Quantization By Agglomerative Clustering

IEEE Computer Graphics and Applications
Center-cut for color-image quantization

The Visual Computer: International Journal of Computer Graphics
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
Dynamic Color Quantization of Video Sequences

IEEE Transactions on Visualization and Computer Graphics
Color image quantization for frame buffer display

SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Computer Graphics in C#: Principles and Practices

Computer Graphics in C#: Principles and Practices

Using the color image quantization problem as a course-long project in CS2

Proceedings of the 49th Annual Southeast Regional Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Color quantization is the process of reducing the number of colors used in an image while maintaining the appearance of the original as much as possible. We introduce a new adaptive heuristic color quantization algorithm that can be used in solving this problem. The color cut algorithm iteratively sub divides the RGB color space into clusters containing an equal number of unique image colors from which a representative set is selected for recoloring the image. The new color cut algorithm produces better analytical and visual results compared to some of the more popular heuristic algorithms.