Last Friday, Dr R. Necaise of computer science dept. of USM gave us a very nice seminar on the color image quantization.

At first, Dr Necaise introduced the contents of the lecture: 1. Introduction. 2. Area using quantization. 3. Image quantization. 4. Formal defination. 5. Algorithms groups. 6. Popular algorithms.

Then Dr Necaise presented the concept of the quantization, the use of quantization, and the image quantization. The quantization conclude the scalar and vector quantization. It may be used in mathematics, communication, voice recognition, computer vision/graphing, finger print matching, and image processing, etc. The compressing of image quantization includes the recoloring and dithering processes. The image is a 2-D array of discrete pixel or color values.

Then Dr Necaise presented the defination of the partition and quantization, the method of designing a quantizer, and the algorithms group.

Then Dr Necaise introduced the k-means algorithm, heuristic quantization, heuristic algorithm, fixed quantization algorithm, adaptive quantization algorithm, median cut algorithm, center cut algorithm. He also gave the detail comparisons of these algorithms.

At last, Dr Necaise presented the color cut algorithm.

Last Update: 3/17/98
Web Author: Zizhong Wang
The report is for Dr Paprzycki@ marcin.paprzycki@ibspan.waw.pl or@ Home Page