A vector quantization algorithm based on the nearest neighbor of the furthest color

In order to optimize the codebook used by the vector quantization compression scheme, we have developed a process based on the max-min algorithm. This process optimizes color space partitioning from vector blocks selected iteratively within the training set according to three algorithms. The partitioning algorithm is based on the nearest neighbor query. The selection algorithm searches the furthest color of the nearest vector block of the training set already computed. A centroid process generates the codebook in refining the vector block selection. In order to counterbalance cases of study for which the centroid process modifies the vector block selection, we have introduced three tests. These tests restrict the training set from which representative colors can be selected