Subblock sum matching algorithm for block-based interframe coding

摘要

A fast block-matching algorithm for motion estimation is described for interframe image coding. Utilizing the fact that the motion is searched by a macroblock basis while the compression is performed by a block basis in many video compression standards, the proposed algorithm produces high PSNR and fast computation while keeping the bit-rate as low as those of conventional fast algorithms. The proposed algorithm uses the subblock sum as a matching parameter and the reversed square sum as a matching criterion. The new matching parameter and criterion reduce the total number of computations for block matching and also keep the quality of the decompressed image. The computational complexity and the compression performance of the proposed algorithm are compared with those of other block-matching algorithms.