Deliberation with "fast full-search block matching"

In this paper, two iffy proofs have been pointed out and were eliminated by reasonable proofs and description. A fast full-search block-matching algorithm, called an extended successive elimination algorithm (ESEA), was developed previously. There are two extensions for the successive elimination algorithm (SEA) the region-splitting technique to introduce the tighter bounds to exclude more search positions, and the successive approximation technique of the error measure to reduce the computational requirements for the remaining search positions by exploiting the already calculated lower bounds during the calculation of the matching criterion.