A multi-stage multi-candidate algorithm for motion estimation
Journal
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Journal Volume
3
Pages
1613-1616
Date Issued
2001
Author(s)
Abstract
Motion compensation using the optimal full search algorithm is often too computationally heavy for real-time implementation. Many suboptimal fast search algorithms have been proposed. In particular, Liu and Zaccarin (1993) 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. 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.
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00941244.pdf
Size
350.88 KB
Format
Adobe PDF
Checksum
(MD5):67478155e6c1f0cda89fe86313cf4caf