A multi-stage multi-candidate algorithm for motion estimation

T. C. Liao*, S. M. Phoong, Yuan-Pei Lin

*此作品的通信作者

研究成果: Conference article同行評審

摘要

Motion compensation using the optimal full search algorithm is often too computational heavy for real time implementation. Many suboptimal fast search algorithms have been proposed. In particular, Liu and Zaccarin proposed the Alternating Subsampling Search Algorithm (ASSA). The ASSA reduces the computation by subsampling the pixels instead of limiting the search locations. It was shown that ASSA has nearly the same MSE performance as the full search but its complexity is only 1/4 of the full search. In this paper, we generalize the idea to the multi-stage case. Simulation results show that the proposed algorithm has a comparable performance to the ASSA but it has a much lower computational cost.

原文English
文章編號941244
頁(從 - 到)1613-1616
頁數4
期刊ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
3
DOIs
出版狀態Published - 7 5月 2001
事件2001 IEEE Interntional Conference on Acoustics, Speech, and Signal Processing - Salt Lake, UT, United States
持續時間: 7 5月 200111 5月 2001

指紋

深入研究「A multi-stage multi-candidate algorithm for motion estimation」主題。共同形成了獨特的指紋。

引用此