最简单的块匹配算法是暴力搜索法,也叫穷举搜索法。
The simplest approach dealing patch match is exhaustive search , or called brute-force search .