Fast vector quantization with the calculation of the weighted Euclidean distance metric
The problem of improving the performance of computer systems for multimedia, including voice information, by reducing the vector quantization time in codebooks. The approach based on the kd-tree is developed that combines the advantages of fast vector search and using the weighted Euclidean metric. Achieved reduction in computational complexity enables the implementation of the proposed method on processors with limited capacity.