Local minimum is one of the inherent problems of block based matching. In order to reduce the chance of falling into this problem, the improved search templates and searching steps are introduced.
陷入局部最优是快速块匹配算法的固有缺陷，为了减少陷入局部最优的概率，详细讲述了块像素匹配的搜索模板与搜索步骤。
Local minimum is one of the inherent problems of block based matching. In order to reduce the chance of falling into this problem, the improved search templates and searching steps are introduced.
陷入局部最优是快速块匹配算法的固有缺陷，为了减少陷入局部最优的概率，详细讲述了块像素匹配的搜索模板与搜索步骤。
应用推荐