Share Email Print

Optical Engineering

Low-complexity block-based motion estimation algorithm using adaptive search range adjustment
Author(s): Ilseung Kim; Joohyeok Kim; Jechang Jeong; Gwanggil Jeon
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 8 June 2012
PDF: 10 pages
Opt. Eng. 51(6) 067010 doi: 10.1117/1.OE.51.6.067010
Published in: Optical Engineering Volume 51, Issue 6
Show Author Affiliations
Ilseung Kim, Hanyang Univ. (Korea, Republic of)
Joohyeok Kim, Hanyang Univ. (Korea, Republic of)
Jechang Jeong, Hanyang Univ. (Korea, Republic of)
Gwanggil Jeon, Univ. of Incheon (Korea, Republic of)

© SPIE. Terms of Use
Back to Top