Abstract
A method to reduce the number of computation steps, named "in Σ method", is proposed for the search of Motion-Vectors by Block Matching. In this method, the computation is interrupted, if the partial summation exceeds the temporal (previous) minimum value. There are no risks of "local optimum", since the method is of full search and only the redundant summation is eliminated. Simulation has made it clear that the steps are reduced to 20〜60%.