1 November 1992 Fast block-matching algorithm by successive refinement of matching criterion
Author Affiliations +
Proceedings Volume 1818, Visual Communications and Image Processing '92; (1992) https://doi.org/10.1117/12.131471
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
Abstract
This paper describes a new fast block matching algorithm alleviating the local minimum problem based on successive refinement of motion vector candidates. The proposed algorithm employs a layered structure. At the first layer, a full search is performed with an approximated matching criterion to obtain a candidate set for the motion vector within a short computation time. In each successive searching process, the matching criterion becomes refined and the search is performed with it only for the candidate set obtained at the preceding layer to refine the candidates. By repeating this process, at the last layer, only a single motion vector can be selected from a few candidates using the conventional MAD (Mean Absolute Difference) criterion without approximation. Since a full search is performed with a coarse matching criterion at the first layer, the proposed algorithm can diminish the local minimum problem in the existing fast search algorithms and also reduce the computation time drastically compared with a brute force search.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kangwook Chun and Jong Beom Ra "Fast block-matching algorithm by successive refinement of matching criterion", Proc. SPIE 1818, Visual Communications and Image Processing '92, (1 November 1992); doi: 10.1117/12.131471; https://doi.org/10.1117/12.131471
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top