Abstract

An improved block-matching algorithm for fast motion estimation is proposed. The matching criterion is the sum of absolute difference. The basic idea is to obtain the best estimation of motion vectors by an optimization of the search process which can terminate the time-consuming computation of matching evaluation between the current block and the ineligible candidate block as early as possible and eliminate the search positions as many as possible in the search area. The performance of this algorithm is evaluated by theoretic analysis and compared with the full search algorithm (FSA). The simulation results demonstrate that the computation load of this algorithm is much less than that of FSA, and the motion vectors obtained by this algorithm are identical to those of FSA.

© 2005 Chinese Optics Letters

Robust block-matching algorithm for motion estimation using an anti-interference similarity criterion and the bilateral optimization scheme

Shuiquan Pang, Xianmin Zhang, Hai Li, and Yihua Lu
Appl. Opt. 60(16) 4746-4754 (2021)

Projection-based, frequency-domain estimation of superimposed translational motions

Peyman Milanfar
J. Opt. Soc. Am. A 13(11) 2151-2162 (1996)

Nonuniformity correction for an infrared focal plane array based on diamond search block matching

Rong Sheng-hui, Zhou Hui-xin, Qin Han-lin, Lai Rui, and Qian Kun
J. Opt. Soc. Am. A 33(5) 938-946 (2016)

RobustPPG: camera-based robust heart rate estimation using motion cancellation

Akash Kumar Maity, Jian Wang, Ashutosh Sabharwal, and Shree K. Nayar
Biomed. Opt. Express 13(10) 5447-5467 (2022)

Matching entropy based disparity estimation from light field data

Ligen Shi, Chang Liu, Di He, Xing Zhao, and Jun Qiu
Opt. Express 31(4) 6111-6131 (2023)