Fast sub-sampling block matching algorithm employing adaptively assigned sizes and locations of search windows
Tadayoshi Enomoto, Nobuaki Kobayashi, Shimon Isaka · 2009
To significantly reduce the number of block-matching (BM) processes for motion vector estimation (ME), we have developed a fast sub-sampling block matching (FSBM) algorithm for H.264. FSBM consists of three steps: a pre-processing step to define conditions for the second step, an alternate sub-sampling process to quickly find the precise location at which the third step starts, and cyclic four-point searches to pinpoint the final motion vector. FSBM not only improves the processing speed of a full search (FS) algorithm by a factor of up to 866, but also that of the simplified unsymmetrical-cross multi-hexagon-grid search (S-UMHS) algorithm for HDTV by a factor of up to 2.18, while achieving the same visual quality as that of FS.