Simplex minimisation for multiple-reference motion estimation
نویسندگان
چکیده
This paper investigates the properties of the multiple-reference block motion field. Guided by the results of this investigation, the paper proposes three fast multiple-reference block matching motion estimation algorithms. The proposed algorithms are extensions of the single-reference simplex minimisation search (SMS) algorithm. The algorithms provide different degrees of compromise between prediction quality and computational complexity. Simulation results using a multi-frame 'memory of 50 frames indicate that the proposed multiple-reference SMS algorithms have a computational complexity comparable to that of single-reference full-search while still maintaining the prediction gain of multiplereference motion estimation.
منابع مشابه
Fast Multi-reference Motion Estimation via Enhanced Downhill Simplex Search
Block motion estimation can be regarded as a function minimization problem in a finite-dimensional space. Therefore, fast block motion estimation can be achieved by using an efficient function minimization algorithm instead of a predefined search pattern, such as diamond search. Downhill simplex search is an efficient derivative-free function minimization algorithm. In this paper, we proposed a...
متن کاملFast Long−term Motion Estimation for High Definition Video Sequences Based on Spatio−temporal Tubes and Using the Nelder−mead Simplex Algorithm
Multi−frame motion estimation is a new specificity of the video coding standard H.264/MPEG−4 Advanced Video Coding (AVC) to improve compression performances. These reference frames can be short or long−term. However, a long−term motion estimation needs to have a good initial search point to be effective. In this paper, we propose a new method for a fast long−term motion estimation with high def...
متن کاملMultiple Reference Motion Compensation: A Tutorial Introduction and Survey
Motion compensation exploits temporal correlation in a video sequence to yield high compression efficiency. Multiple reference frame motion compensation is an extension of motion compensation that exploits temporal correlation over a longer time scale. Devised mainly for increasing compression efficiency, it exhibits useful properties such as enhanced error resilience and error concealment. In ...
متن کاملFast Multiple Reference Frame Selection Method in H.264 Video Encoding
The new JVT H.264 video coding standard is becoming the dominant standard, mainly due to its high coding efficiency. Among all modules in the encoder, motion estimation plays a key role since it can significantly affect the output quality of an encoded sequence. However, motion estimation requires a significant part of the encoding time. One reason is because H.264 allows motion estimation base...
متن کاملData reuse algorithm for multiple reference frame motion estimation
A data reuse algorithm for multiple reference frame motion estimation is described. The proposed algorithm reduces memory access by modifying the reference frame search order and search centre such that the likelihood of data reuse is increased. Experimental results show that the algorithm reduces memory access by 15–30% compared to the conventional fast reference frame selection algorithm, whi...
متن کامل