This paper presents a fast full search algorithm for motion estimation. The proposed method is a successive elimination algorithm (SEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image is less intensive in computation compared with that for the first reference image. Simulation results explain that our method reduces computation complexity although it has the same quality as the full search algorithm (FSA). © Springer-Verlag 2004.
CITATION STYLE
Kang, H. S. (2004). A fast successive elimination algorithm for multiple reference images. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3311, 187–193. https://doi.org/10.1007/978-3-540-30493-7_17
Mendeley helps you to discover research relevant for your work.