A fast vector quantization encoding algorithm using multiple projection axes

doi:10.1016/S0165-1684(99)00035-3

Return

A fast vector quantization encoding algorithm using multiple projection axes

1999-01-01

PRE

Seung Joon Baek

Myung-Jin Bae

DOI：10.1016/S0165-1684(99)00035-3

Original

Original request for help

Save

Abstract

En 中文

Computation of nearest neighbor generally requires a large number of expensive distance calculations. In this paper, we present an algorithm which uses multiple projection axes to accelerate the encoding process of VQ by eliminating the necessity of calculating many distances. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as a conventional full search algorithm. The simulation results confirm the effectiveness of the proposed algorithm. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

Keywords:

multiple projection axes

fast encoding algorithm

vector quantization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.