10 January 1997 Fast hierarchical block matching algorithm utilizing spatial motion vector correlation
Author Affiliations +
Abstract
A new hierarchical block matching algorithm specially proper for a large search area, is proposed. The algorithm utilizes the spatial motion vector correlation under the fixed hierarchical search structure. Motion vectors of the causally neighboring blocks can be used to predict the motion vector of the current block, if the spatial motion vector correlation is strong. However, they are not helpful for searching complex or random motion. The proposed algorithm consists of two level searching steps. The higher one selects two initial estimates, one obtained by using motion vector correlation for continuous motion, the other by using minimum mean absolute difference for random or complex motion among rectangularly-sampled motion vector candidates in the search area, and the lower one is for the final motion vector refinement. Compared with previous hierarchical block matching algorithms, the scheme improves the accuracy of the estimated motion vector for random/complex motion as well as continuous motion. it is also proper for hardware implementation because of simple, fast, and regular search procedure. Simulation results show that the proposed algorithm drastically reduces the computational complexity to 5.0 percent of that of full search block matching algorithm, with the minor PSNR degradation of 0.4dB even in the worst case.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kyoung Won Lim, Byung Cheol Song, and Jong Beom Ra "Fast hierarchical block matching algorithm utilizing spatial motion vector correlation", Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263241; https://doi.org/10.1117/12.263241
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top