穷尽搜索算法 meaning in Chinese
full search algorithm
Examples
- The traditional codeword search algorithm ? full algorithm ( fs ) has a serious disadvantage , whose computation quantity will rise sharply with the increase of the codebook size and the codeword dimension
传统的码字搜索算法? ?穷尽搜索算法会随着码书规模的增大和码字维数增加,计算量急剧增加。 - Firstly , based on conventional vq , a fast algorithm named equal - sum block - extending nearest neighbor search ( ebnns ) is presented , which not only can achieve the reconstructed image of full search algorithm but also can greatly reduce both the codeword search ratio and chip area . in order to improve coding efficiency , a new algorithm called correlation - inheritance coding is proposed , which is embedded in conventional vq system to improve compression ratio by re - encoding the indexes
首先，在普通矢量量化基础上提出了等和值块扩展最近邻快速码字搜索算法( ebnns ) ，该算法在图像画质达到穷尽搜索算法的前提下，大大降低了码字搜索率和硬件实现面积；为了提高编码效率，在相关性编码方面，提出了相关继承编码算法，对普通矢量量化后的编码索引进行无损重编码。 - Then , in order to reduce the coding time of each image vector , a fast algorithm based on mean - order - search is proposed . the simulation results of this algorithm show that its coding speed is twenty times faster than that of full search algorithm ( fs ) , but its reconstructed image is badly ruined
其次，为减少每个矢量的编码时间，提出一种基于均值排序码书的快速搜索算法，测试结果显示，该算法编码速度是穷尽搜索算法的二十多倍，但是恢复图像的质量大大地降低了。