RU2010103261A - WAY OF QUICK SEARCH IN THE CODE BOOK AT VECTOR QUANTIZATION - Google Patents

Abstract

 A quick search method in the codebook for vector quantization, namely, that K-dimensional space is divided into hyper-rectangular cells by constructing projections of the Voronoi polygon for each code vector on the coordinate axis j, j = 1, forming N overlapping projection intervals that form 2N projection boundaries, such that, in this case, the boundaries divide the jth coordinate axis into (2N-1) consecutive intervals {Ij (1), Ij (2), ... Ij (2N-1)}, where, m is the number of the interval , and each interval corresponds to a set of polygon indices Voronoi nicknames whose projection intervals partially or completely overlap with Ij (m), and the set of candidate code vectors is associated with each of the hyper-rectangular cells obtained in the pre-processing process and stored in a certain table, which is chosen by the final set of candidate vectors, on this small the set then conducts a search in which, for each component of the input vector, the interval into which the given component falls is determined, characterized in that in the search method in the codebook during vector quantization, used in the prototype, when constructing projections of the Voronoi polygons on the coordinate axis j, j ≠ 1, projections for each interval of the j-1 axis are constructed only of those Voronoi polygons that are included in the set of indices of this interval, i.e. for those whose projection intervals partially or completely overlap with the considered interval, then at the search stage the interval into which the component of the input vector falls is determined sequentially for all axes, and the last interval defines a hyper-rectangular cell with the final set of vectors k�

Claims (1)

A quick search method in the codebook for vector quantization, namely, that K-dimensional space is divided into hyper-rectangular cells by constructing projections of the Voronoi polygon for each code vector on the coordinate axis j, j = 1, forming N overlapping projection intervals that form 2N projection boundaries

such that

, while the boundaries divide the j-th coordinate axis into (2N-1) consecutive intervals {I ^j (1), I ^j (2), ... I ^j (2N-1)}, where

, m is the number of the interval, and each interval corresponds to a set of indices of Voronoi polygons whose projection intervals partially or completely overlap with I ^j (m), and the set of candidate code vectors is associated with each of the hyper-rectangular cells obtained during the preliminary processing and stored in some the table, which is chosen by the final set of candidate vectors, on this small set, a search is then carried out in which for each component of the input vector the interval into which this component falls characterized in that in the method of searching in the codebook for vector quantization used in the prototype, when constructing projections of the Voronoi polygons on the coordinate axis j, j ≠ 1, projections for each interval of the j-1 axis are constructed only of those Voronoi polygons that are included in the set indices of this interval, i.e. for those whose projection intervals partially or completely overlap with the considered interval, then at the search stage the interval into which the input vector component falls is determined sequentially for all axes, and the last interval defines a hyper-rectangular cell with the final set of candidate vectors.