In order to reduce the calculation number of matching position and keep the precision, we make use of the successive elimination algorithm. Therefore, the complexity was reduced.
为了减少块匹配过程中每个待匹配位置的运算次数，保持块匹配的精度，又引入了连续排除算法，降低了计算复杂度。
For decreasing the computational complexity of searching process in best neighborhood matching method, a fast error concealment algorithm using successive elimination was proposed.
为了减少自相似错误隐藏算法中搜索过程的计算复杂度，提出了一种基于连续淘汰的快速自相似错误隐藏算法。
For decreasing the computational complexity of searching process in best neighborhood matching method, a fast error concealment algorithm using successive elimination was proposed.
为了减少自相似错误隐藏算法中搜索过程的计算复杂度，提出了一种基于连续淘汰的快速自相似错误隐藏算法。
应用推荐