Presentation 1998/3/6
Color Quantization Using Fast K-means Clustering
Hideo Kasuga, Hiroaki Yamamoto, Masayuki Okamoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Many color images have 24bits color data. But, we don't always need so many color data. This paper proposes a new algorithm for color image quantization. When we quantized color images, we seek quantized values that make sum of square error minimum. We used a fast K-means algorithm.This method groups K clusters, and decreases calculation frequency.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Color Quantization / K-Clustering / K-means Algorithm / Fast K-means Algorithm
Paper #
Date of Issue

Conference Information
Committee IE
Conference Date 1998/3/6(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Image Engineering (IE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Color Quantization Using Fast K-means Clustering
Sub Title (in English)
Keyword(1) Color Quantization
Keyword(2) K-Clustering
Keyword(3) K-means Algorithm
Keyword(4) Fast K-means Algorithm
1st Author's Name Hideo Kasuga
1st Author's Affiliation Graduate School of Engineering, Shinshu University()
2nd Author's Name Hiroaki Yamamoto
2nd Author's Affiliation Faculty of Engineering, Shinshu University
3rd Author's Name Masayuki Okamoto
3rd Author's Affiliation Faculty of Engineering, Shinshu University
Date 1998/3/6
Paper #
Volume (vol) vol.97
Number (no) 590
Page pp.pp.-
#Pages 6
Date of Issue