Modified TZ Search Method for Motion Estimation in Multi-View Video Coding

2013 ◽  
Vol 717 ◽  
pp. 754-759
Author(s):  
Hyo Sun Yoon ◽  
Mi Young Kim
Keyword(s):  
Computational Complexity ◽  
Image Quality ◽  
Motion Estimation ◽  
Video Coding ◽  
Video Compression ◽  
Motion Vector ◽  
Three Dimensional ◽  
Search Method ◽  
Optimal Motion ◽  
Quality Degradation

Motion estimation (ME) plays an important role in digital video compression. But it requires huge complexity to find an optimal motion vector. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity for motion estimation in multi view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, a modified TZ search method for motion estimation in multi-view video coding is proposed in this paper. The proposed search method exploits the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over Pel Block Search and TZ search method (JMVC) can be up to more than 77 times and 1.8 ~4.5 times faster respectively by reducing the computational complexity and the image quality degradation is about to 0.05 ~ 1(dB) and 0.010.24 (dB) respectively.

Improvements on Motion Estimation Algorithms in Video Coding for H.264/AVC

2013 ◽  
Vol 756-759 ◽  
pp. 3455-3460
Author(s):  
Xiao Li Wang ◽  
Long Zhao
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Real Time ◽  
Video Compression ◽  
Motion Vector ◽  
Coding Efficiency ◽  
Estimation Algorithms ◽  
Whole Process ◽  
Motion Activity ◽  
Precision Motion

Motion estimation is the most important step in video compression. By using high precision motion vector in the H.264 encoder, the calculation is rapidly increased, but in the whole process of coding, motion estimation occupies about 80%. Although many motion estimation algorithms have been proposed to reduce the computational complexity of motion estimation, it still cannot meet the strict real-time demand. In this paper, based on the analysis of UMHexagonS algorithm, dynamic searching window is chosen in the UMHexagonS algorithm, then according to the motion activity, it uses different template to reduce the motion estimation time and improve video coding efficiency. Proved by the experiments on various test sequences, compared with the UMHexagonS algorithm, the motion estimation time of the proposed algorithm average saves 17.7525% in the case of the quality of the reconstructed image and rate close. It not only reduces the complexity of the algorithm, but also improves the real-time performance of the encoder.

Adaptive Return Prediction Block Matching Algorithms for Video Coding

2011 ◽  
Vol 145 ◽  
pp. 277-281
Author(s):  
Vaci Istanda ◽  
Tsong Yi Chen ◽  
Wan Chun Lee ◽  
Yuan Chen Liu ◽  
Wen Yen Chen
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Web Site ◽  
Motion Vector ◽  
Temporal Correlation ◽  
Block Matching ◽  
Asynchronous Learning ◽  
Learning And Teaching ◽  
Block Motion ◽  
Reconstruction Image

As the development of network learning, video compression is important for both data transmission and storage, especially in a digit channel. In this paper, we present the return prediction search (RPS) algorithm for block motion estimation. The proposed algorithm exploits the temporal correlation and characteristic of returning origin to obtain one or two predictive motion vector and selects one motion vector, which presents better result, to be the initial search center. In addition, we utilize the center-biased block matching algorithms to refine the final motion vector. Moreover, we used adaptive threshold technique to reduce the computational complexity in motion estimation. Experimental results show that RPS algorithm combined with 4SS, BBGDS, and UCBDS effectively improves the performance in terms of mean-square error measure with less average searching points. On the other hand, accelerated RPS (ARPS) algorithm takes only 38% of the searching computations than 3SS algorithm, and the reconstruction image quality of the ARPS algorithm is superior to 3SS algorithm about 0.30dB in average overall test sequences. In addition, we create an asynchronous learning environment which provides students and instructors flexibility in learning and teaching activities. The purpose of this web site is to teach and display our researchable results. Therefore, we believe this web site is one of the keys to help the modern student achieve mastery of complex Motion Estimation.

scholarly journals A Fast Fractal Video Coding Algorithm Using Cross-Hexagon Search for Block Motion Estimation

2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
Kamel Belloulata ◽  
Shiping Zhu ◽  
Zaikuo Wang
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Search Algorithm ◽  
Motion Vector ◽  
Block Matching ◽  
Block Motion ◽  
Search Patterns ◽  
Vector Distribution ◽  
Search Speed ◽  
Block Motion Estimation

We propose a novel fractal video coding method using fast block-matching motion estimation to overcome the drawback of the time-consuming character in the fractal coding. As fractal encoding essentially spends most time on the search for the best-matching block in a large domain pool, search patterns and the center-biased characteristics of motion vector distribution have large impact on both search speed and quality of block motion estimation. In this paper, firstly, we propose a new hexagon search algorithm (NHEXS), and, secondly, we ameliorate, by using this NHEXS, the traditional CPM/NCIM, which is based on Fisher's quadtree partition. This NHEXS uses two cross-shaped search patterns as the first two initial steps and large/small hexagon-shaped patterns as the subsequent steps for fast block motion estimation (BME). NHEXS employs halfway stop technique to achieve significant speedup on sequences with stationary and quasistationary blocks. To further reduce the computational complexity, NHEXS employs modified partial distortion criterion (MPDC). Experimental results indicate that the proposed algorithm spends less encoding time and achieves higher compression ratio and compression quality compared with the traditional CPM/NCIM method.

The Improve of HFPS Algorithm in AVS Video Coding

2012 ◽  
Vol 457-458 ◽  
pp. 867-871
Author(s):  
Xi Nan Zhang ◽  
Ai Lin Liu
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Video Sequence ◽  
Search Algorithm ◽  
Motion Vector ◽  
Video Sequences ◽  
The Law ◽  
Motion Characteristics ◽  
Algorithm Search ◽  
Improved Algorithm

To reduce the complexity of AVS sub-pixel motion vector search, this paper proposes a new improved algorithm based on little diamond window searching policies according to the law of the general video sequence motion vector focusing on the near of the initial searching point at the time of the subpixel motion estimation on the basis of deeping analysis to HFPS algorithm. Comparing with the sub-pixel HFPS algorithm search algorithm, the time of sub-pixel motion estimation can reduce 51.97％ on average and efficiently decrease the computational number of sub-pixel motion estimation on average PSNR lost less than 0.01dB to the video sequences with different motion characteristics.

scholarly journals IMPLEMENTATION OF ROBUST ARCHITECTURE FOR ERROR DETECTION AND DATA RECOVERY IN MOTION ESTIMATION ON FPGA

2013 ◽  
pp. 29-33
Author(s):  
V.V.. S.V.S RAMACHANDRAM ◽  
DANIEL N. FINNEY
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Video Compression ◽  
Error Detection ◽  
Video Data ◽  
Data Recovery ◽  
Concurrent Error Detection ◽  
Coding Systems ◽  
Wide Range ◽  
Total Data

Video compression is necessary in a wide range of applications to reduce the total data amount required for transmitting or storing video data. Among the coding systems, Motion Estimation is of priority concern in exploiting the temporal redundancy between successive frames, yet also the most time consuming aspect of coding. This paper presents an error detection and data recovery (EDDR) design, based on the residue-and quotient (RQ) code that is embed into ME for video coding testing applications. Based on the Concurrent Error Detection (CED) concept, this work develops a robust EDDR architecture based on the RQ code to detect errors and recovery data in PEs of a ME and, in doing so, further guarantee the excellent reliability for video coding applications. We synthesized this design using Xilinx tool.

The Improvement of UMHexagonS Algorithm in AVS Video Coding

2012 ◽  
Vol 457-458 ◽  
pp. 819-824
Author(s):  
Xi Nan Zhang ◽  
Yan Jun Gong
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Video Sequence ◽  
Motion Vector ◽  
Motion Feature ◽  
Adaptive Adjustment ◽  
Search Template ◽  
Calculated Amount

To reduce the complexity of AVS pixel motion vector search, this paper proposes a improved AVS pixel motion estimation UMHexagonS algorithm. The algorithm adds the improve of advanced new array and adaptive adjustment search template. To the video sequence of different motion feature, compare with UMHexagonS algorithm, in the case of mean PSNR descend less than 0.01dB and bitrate only mean increase 0.54％, the time of pixel motion estimation is reduced by 8.72％～20.25％ and the calculated amount of pixel motion estimation is also reduced.

Sign in / Sign up

Export Citation Format

Share Document