Efficient multi-frame motion estimation algorithms for MPEG-4 AVC/JVT/H.264
50
Citation
4
Reference
10
Related Paper
Citation Trend
Abstract:
In H.264 standard, a lot of computational complexity is consumed in the encoder for motion estimation. It allows seven block sizes to perform the motion/compensation, and refers to previous five frames for searching the best motion vector to achieve lower bitrate and higher quality. Since the H.264 reference software uses the full search scheme to obtain the best performance, it spends a lot of searching time. In this paper we propose efficient searching algorithms by reuse of the motion vector information from the last reference frame. The proposed algorithms use the stored motion vectors to compose the current motion vector without performing the full search in each reference frame. Therefore, our proposed algorithms can obtain the speed up ratio 4 in average for encoding, which benefits from the prediction of the motion vector for reference frames in advance and maintain a good performance. Any fast search algorithm can be utilized to further largely reduce the computational load for the motion estimation from previous one frame.Keywords:
Quarter-pixel motion
Motion vector
Inter frame
Motion estimation is important for compression of video sequences. In this paper a new block motion estimation algorithm proposed. In the proposed method, the motion vector of previous frame are used to predict the initial motion vector and the search direction. The extent of search region is determined by predicted motion vector and motion vectors of four casual neighbours in the current frame. Results shows significant speed-up compared to existing ones.
Quarter-pixel motion
Motion vector
Inter frame
Motion field
Cite
Citations (1)
A motion compensation scheme suitable for super high definition (SHD) video, consisting of hierarchical motion estimation and background motion vector processing, has been proposed. The scheme is capable of compensating motion from a few pixels up to well over one hundred, designed to cope with very large motion (in terms of number of pixels) that is present in SHD video. The background motion processing technique identifies more than one background motion vector and saves a great deal of overhead motion vector information.
Quarter-pixel motion
Motion vector
Cite
Citations (2)
A new motion compensation mode of TM_BMC is proposed by this paper to improve video coding efficiency. In TM_BMC, the inter-prediction efficiency is improved by combining the predictor of template matching and predictor of traditional block motion compensation, the coding cost for motion vector of traditional block motion compensation is reduced by utilizing motion vector derived by template matching as motion vector predictor. Experiment results on H.264 KTA platform show that average 7.07% and up to 11.26% bit-rate can be saved by locally adaptive motion compensation mode between the traditional motion compensation mode of BMC and the proposed mode of TM_BMC.
Quarter-pixel motion
Motion vector
Algorithmic efficiency
Template matching
Cite
Citations (7)
As a result of a combination of template comparison for estimating block similarity, edge selection algorithms and an improved block search method, two versions of a generalized method for finding motion vectors, called TFEMVFAS (Three by Frame Edge Map Motion Vector Field Adaptive Search), were proposed. Both modifications of the method were tested according to the comprehensive testing recommendations of the international commission MPEG for the evaluation of complex video tools, on the example of 13 video sequences, with different bitrates. The effect of increasing the size of the blocks on which the image is divided on the PSNR value and the maximum acceleration was also investigated.
Motion vector
Quarter-pixel motion
Cite
Citations (0)
Motion estimation is important for compression of video sequences. In this paper a new block motion estimation algorithm proposed. In the proposed method, the motion vector of previous frame are used to predict the initial motion vector and the search direction. The extent of search region is determined by predicted motion vector and motion vectors of four casual neighbours in the current frame. Results shows significant speed-up compared to existing ones.
Quarter-pixel motion
Motion vector
Inter frame
Motion field
Cite
Citations (1)
In H.264 standard, a lot of computational complexity is consumed in the encoder for motion estimation. It allows seven block sizes to perform the motion/compensation, and refers to previous five frames for searching the best motion vector to achieve lower bitrate and higher quality. Since the H.264 reference software uses the full search scheme to obtain the best performance, it spends a lot of searching time. In this paper we propose efficient searching algorithms by reuse of the motion vector information from the last reference frame. The proposed algorithms use the stored motion vectors to compose the current motion vector without performing the full search in each reference frame. Therefore, our proposed algorithms can obtain the speed up ratio 4 in average for encoding, which benefits from the prediction of the motion vector for reference frames in advance and maintain a good performance. Any fast search algorithm can be utilized to further largely reduce the computational load for the motion estimation from previous one frame.
Quarter-pixel motion
Motion vector
Inter frame
Cite
Citations (50)
A new motion estirrration/compensation scheme for full-motion interframe video compression is proposed in this paper. The scheme is based on prediction of inter-block and inter-frame motion information using minimum absolute difference block matching and hence substantially increases tbe searching and computation efficiency. A comparison is also made widr the "optimal" full motion searching scheme for a standard test sequence.
Inter frame
Quarter-pixel motion
Motion vector
Cite
Citations (4)
The popular techniques to eliminate temporal redundancy in video sequences are Motion Estimation and Motion Compensation. These techniques have also been used in popular H.264, MPEG-2 and MPEG-4 video coding standards. Conventional fast Block Matching Algorithms (BMA) perform exhaustive search between the current and the reference frame. Although BMA technique gives the exact result but it is computationally very expensive. Another drawback of this method is that it easily gets trapped into the local minima which eventually lead to degradation of the video quality. The proposed Motion Estimation Technique exploits the fact that the human eyes are incapable of detecting different frames when they are run at particular frame rate. The experimental results on various video sequences demonstrate that the proposed technique has outperformed all the existing conventional motion estimation techniques.
Quarter-pixel motion
Inter frame
Rate–distortion optimization
Cite
Citations (2)
In the new video coding standard, H.264/MPEG-4 Part 10, motion compensation is allowed to use multiple reference frames that improves the rate distortion performance but at the cost of drastic increase in complexity. The increased computation is in proportion to the number of searched reference frames. However, the reduction of prediction residues is highly dependent on the nature of sequences. In this paper, we present a fast technique to predict the motion vector in reference frames to speed up the matching process for multiple reference frames. The proposed technique is based on choosing the motion centre and carrying the search around the centre with a radius of 1 or 2 pixels in all reference frames with the exception of the one which immediately precedes the current frame. For the reference frame that immediately precedes the current frame any motion estimation technique can be used. The results show that the proposed technique reduces the computational requirements down to that which is required for single reference frame motion estimation with only a negligible loss of objective quality
Motion vector
Quarter-pixel motion
Inter frame
Residual frame
Distortion (music)
Reference model
Cite
Citations (3)
In this paper, we introduce a new motion vector prediction method that could be used within multiple picture reference codecs, such as the H.264 (MPEG-4 AVC) video coding standard. Our method considers for each candidate motion vector the temporal distance of its corresponding reference picture compared to the current one for the generation of the predictor motion vector. This allows for more accurate motion vector prediction, and better exploitation of the temporal correlation that may exist within a video sequence. Furthermore, we also introduce a modification to the SKIP motion vector macroblock mode, according to which not only the motion vectors but also the reference indices are adaptively generated. Simulation results suggest that our proposed methods, combined with an improved Rate Distortion optimization strategy, if implemented within the existing H.264 codec, can allow for a considerable performance improvement of up to 8.6% bitrate reduction compared to the current H.264 standard.
Quarter-pixel motion
Motion vector
Codec
Inter frame
Macroblock
Rate–distortion optimization
Cite
Citations (2)