Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A lot of different methods, with lower complexity, have been proposed to speed up the process of motion compensation, but the resultant image quality cannot be as good as FBMA does. A new motion estimated algorithm, with less computational complexity and similar image quality while comparing to FBMA, will be presented in this paper. By considering the relation between neighboring blocks, the search area in the algorithm is adjustable. Due to the adaptation of the search area, the computation complexity can be largely reduced and the actual motion vectors can still be found. On the Sun SPARC-II workstation, the speed of the proposed algorithm can be 61 times faster than that of FBMA, maximally.