16 September 1996 Hybrid block-matching algorithm for motion estimation
Author Affiliations +
Abstract
Motion compensation is a key operation in video compression to remove the temporal redundancy in a video sequence. One of the application examples is the MPEG video compression standard. The most commonly used motion estimation algorithm is the block matching algorithm due to its regularity. Full search is the most straight forward block matching algorithm which can always locate the optimal motion vector. However, its computational complexity makes it impractical in real time applications. Fast algorithm required less computation but the obtained motion vector is suboptimal. In this paper, a hybrid block matching algorithm is proposed. In this algorithm, average intensities of groups of pixels are used to roughly estimate the motion first. Then, the fast search algorithm is applied in a reduced search region centered around the result of the first pass. Experimental results show that the performance of the estimation accuracy is quite close to that of the full search algorithm while the computational complexity is only slightly increased with respect to those fast algorithms.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tsang-Long Pao, Tsang-Long Pao, Jia-Shian Wu, Jia-Shian Wu, "Hybrid block-matching algorithm for motion estimation", Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, (16 September 1996); doi: 10.1117/12.251294; https://doi.org/10.1117/12.251294
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT


Back to Top