Dynamic search-window adjustment and interlaced search for block-matching algorithm

A technique called dynamic search-window adjustment is proposed to improve the performance of three-step searches (TSS) and to prevent the search direction from being easily misdirected by insufficient information. An interlaced-search technique is presented for the purpose of reducing the search positions. A fast search algorithm using both techniques is proposed. It is shown that the average displaced frame difference and search positions of the proposed algorithm are about 1-7% and 24-44% fewer than TSS, respectively.>