全搜索算法重构图。像顾名思义，穷尽法就是对搜索范围内的每个位置都进行计算并比较，从原图像块中找到与待匹配块最相似（误差最小）位置的方法。对于一个搜索范围为[-7,7]的区域来说，x，y两个方向全部搜索一遍需要进行 15X15 = 225 次计算。穷尽法的缺点很明显就是计算量太大，速度很慢，另一方面，由于全部范围都进行了计算，其匹配精度是最高的。(Reconstruction graph of full search algorithm. As the name implies, the exhaustive method is to calculate and compare each position within the search range, and find the most similar (least error) position with the block to be matched from the original image block. For an area with a search range of [- 7,7], 15x15 = 225 calculations are required for searching both directions X and Y once. The disadvantage of exhaustive method is that the calculation is too large and the speed is very slow. On the other hand, the matching accuracy is the highest because all the ranges are calculated.)