A genetic approach towards optimal color image quantization

In this paper the problem of local optimality of color image quantization procedures is discussed. The well-known and frequently used C-means clustering algorithm (CMA) is applied to the problem, and its dependence on initial conditions is studied. A hybrid approach, combining CMA with a genetic alg...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:1996 IEEE International Conference on Image Processing Proceedings Ročník 3; s. 1031 - 1034 vol.3
Hlavný autor: Scheunders, P.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1996
Predmet:
Clustering algorithms
Color
Displays
Genetic algorithms
Genetic mutations
Humans
Machine vision
Physics
Pixel
Quantization
ISBN:9780780332591, 0780332598
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper the problem of local optimality of color image quantization procedures is discussed. The well-known and frequently used C-means clustering algorithm (CMA) is applied to the problem, and its dependence on initial conditions is studied. A hybrid approach, combining CMA with a genetic algorithm is constructed, and it is shown that this approach is insensitive to its initial conditions. Results compare the performance of the genetic approach with CMA on three different types of initial conditions: random initial conditions and two popular color image quantization algorithms: the median-cut algorithm and the variance-based algorithm. In all cases the genetic approach outperforms CMA.
ISBN:9780780332591
0780332598
DOI:10.1109/ICIP.1996.561008