| 摘要 |
Method for directed search of vectors for compacting language signals includes formation of adjacency tables on basis of Voronoy’s diagram, with calculation of distance from input vector to current one its comparison to distances between input vector and list of neighbors of the current one, in case if distance from input vector to one of neighboring ones is smaller compared to that to current vector transition takes place at once and that vector becomes current one, etc., and if for each vector for adjacency table distance is not less than that to current one search is completed and current vector is considered to be the most close to the input vector. Beforehand prepared tables of adjacency are preliminary arranged by levels of majorization, at search one first determines the level of majorizatioin to which input vector belongs and beginning from that level one performs search of vector closest to it. |
