Most of the fast block matching algorithms(BMAs) use the origin as the initial center of the search. To improve the accuracy of the fast BMAs

a new predicted search algorithm is proposed in this paper. Based on the spatial correlation of motion and the fast center-based BMAs

the four causal neighbour blocks are chosen to predict the start searching point and then the center-based BMA is used to find the final motion vector as the global minimum is more close to the predicted center. Experimental results show that the proposed predicted search algorithm overdrives the performance very well in most fast BMAs such as the new three-step search

the four-step search in terms of motion compensation errors. In addition

the average computational requirement is also reduced.