Low-complexity block-based motion estimation algorithm using adaptive search range adjustment

  • Kim, Ilseung
  • Kim, Joohyeok
  • Jeon, Gwanggil
  • Jeong, Jechang
Citations

WEB OF SCIENCE

5
Citations

SCOPUS

5

초록

We propose an adaptive search range adjustment algorithm that is particularly suitable for low-bit-depth motion estimation approaches. Typical low-bit-depth motion estimation approaches, such as one-bit transform (1BT), two-bit transform (2BT), and truncated gray-coded bit-plane matching (TGCBM), perform a full search with low-bit expression. We propose combining a search-range adjustment, which can be predicted by using motion vector information of the reference frame and the existing bit-wise matching methods, such as 1BT, 2BT, and TGCBM. Combining this proposed algorithm and low-bit expression enhances both motion estimation accuracy and time consumption. Experimental results show that low-bit-depth motion estimation approaches using this proposed algorithm have an outstanding performance compared with those without the proposed algorithm both in motion estimation accuracy and time consumption.

키워드

motion estimationbit-wise block matchingsearch range adjustmentSUCCESSIVE ELIMINATION ALGORITHMONE-BIT TRANSFORMTERMINATION ALGORITHM2-BIT TRANSFORM
제목
Low-complexity block-based motion estimation algorithm using adaptive search range adjustment
저자
Kim, IlseungKim, JoohyeokJeon, GwanggilJeong, Jechang
DOI
10.1117/1.OE.51.6.067010
발행일
2012-06
유형
Article
저널명
Optical Engineering
51
6