Fast algorithm for color vector quantization

Long-Wen Chang; Her-Hsing Chang

doi:10.1117/12.158621

20 October 1993 Fast algorithm for color vector quantization

Long-Wen Chang, Her-Hsing Chang

Proceedings Volume 2028, Applications of Digital Image Processing XVI; (1993) https://doi.org/10.1117/12.158621
Event: SPIE's 1993 International Symposium on Optics, Imaging, and Instrumentation, 1993, San Diego, CA, United States

Abstract

Color vector quantization is a very important technique to display a color image with N², typically N equals 256, colors in a personal computer and workstation or print a color image with K, typically K equals 256, colors without too much color degradation. The LBG algorithm is a popular suboptimal algorithm to solve the color vector quantization. However, it is very slow. Several fast algorithms such as the popularity algorithm, the median cut algorithm have been proposed. In this paper, we propose a new fast algorithm for color vector quantization. The proposed algorithm has been implemented in a tree structure. Assume that n is the number of pixels in the image and m is the dimension of the color space. In the tree structure, there is n leaves in the tree in the worst case, where n is the total pixel numbers in the original color image. The storage complexity of the proposed algorithm is O(n) and the time complexity if O(n log₂ N). It is much faster than the median cut algorithm. In the same space complexity O(mn) our algorithm has time complexity O(n log₂ K) while the median cut algorithm requires O(m log₂ Kn log₂ n), where m equals 3 is the dimensionality of the color space. Also, our algorithm finds the centroid of a compact cube instead of a rectangular shape in the median cut algorithm. Therefore, it produces better color images after vector quantization.

Citation Download Citation

Long-Wen Chang and Her-Hsing Chang "Fast algorithm for color vector quantization", Proc. SPIE 2028, Applications of Digital Image Processing XVI, (20 October 1993); https://doi.org/10.1117/12.158621

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available