• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.7
• /
• pp.70-77
• /
• 2010

Motion estimation occupies most of the required computation in video compression, and many fast search algorithms were propsoed to reduce huge computation. SAD (sum-of-absolute difference) calculation is the most computation-intensive process in the motion estimation. Early termination is widely used in SAD calculation, where SAD calculation is terminated and it proceeds to next search position if partial SAD during SAD calculation exceeds current minimum SAD. In this paper, we proposed a modified 3-step search algorithm for effective early termination where only search order of search positions are adaptive rearranged. Simulation results show that the proposed motion estimation algorithm reduces computation by 17~30% over conventional 3-step search algorithm without extra computation, while maintaining same performance.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.179-187
• /
• 2009

In this paper, an efficient multi-level successive elimination algorithm using the locality in block was proposed for motion estimation. If SAD(sum of absolute difference) is calculated from large absolute difference values to small absolute difference values, SAD is increased rapidly. So, partial distortion elimination in SAD calculation can be done very early. Hence, the computations of SAD calculation can be reduced. In this paper, an efficient algorithm to calculate SAD from large absolute difference values to small absolute difference values by using the locality in block. Experimental results show that the proposed algorithm is an efficient algorithm with 100% motion estimation accuracy for the motion estimation of motion vectors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.602-608
• /
• 2003

In this paper, we propose an efficient DCT calculation method for fast video encoding. We show that the SAD obtained in the motion estimation and compensation process is decomposed into the positive and negative terms. Based on a theoretical analysis, it is shown that the DCT calculation is classified into 4 cases - DCT Skip, Reduced_DCT1 , Reduced_DCT2, and original DCT- according to the positive and negative terms. In the proposed algorithm, one of 4 cases is used for DCT in order to reduce the computational complexity. The simulation results show that the proposed algorithm achieves computational saving approximately 25.2% without image degradation and computational overhead.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.397-400
• /
• 2016

In this paper, we propose an efficient algorithm for computing architecture for high-performance Inter Prediction SAD HEVC encoder. HEVC Motion Estimation (ME) of the Inter Prediction is a process for searching for the currently high prediction block PU and the correlation in the interpolated reference picture in order to remove temporal redundancy. ME algorithm uses full search(FS) or fast search algorithm. Full search technique has the guaranteed optimal results but has many disadvantages which include high calculation and operational time due to the motion prediction with respect to all candidate blocks in a given search area. Therefore, this paper proposes a new algorithm which reduces the computational complexity by reusing the SAD operation in full search to reduce the amount of calculation and computational time of the Inter Prediction. The proposed algorithm is applied to an HEVC standard software HM16.12. There was an improved operational time of 61% compared to the traditional full search algorithm, BDBitrate was decreased by 11.81% and BDPSNR increased by about 0.5%.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.23-25
• /
• 2007

The partial distortion elimination (PDE) scheme is used to decrease the sum of absolute difference (SAD) computational complexity, since the SAD calculation has been taken much potion of the video compression. In motion estimation (ME) based on PDE, it is ideal that the initial value of SAD in summing performance has large value. The traditional scan order methods have many operation time and high operational complexity because these adopted the division or multiplication. In this paper, we introduce the new scan order and search order by using only adder. We define the average value which is called to rough average value (RAVR). Which is to reduce the computational complexity and increase the operational speed and then we can obtain the improvement of SAD performance. And also this RAVR is used to decide the search order sequence, since the difference RAVR between the current block and candidate block is small then this candidate block has high probability to suitable candidate. Thus, our proposed algorithm combines above two main concepts and suffers the improving SAD performance and the easy hardware implementation methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.223-226
• /
• 2008

본 논문은 움직임 추정(motion estimation)과정에서 SAD(Sum of Absolute Difference)값을 추출하기 위해 사용되는 SAD 연산기의 게이트 수를 줄이는데 초점을 두고 하드웨어를 구현하였다. 게이트 수(gate count)를 줄이기 위한 방법으로 1의 보수 (one's complement)의 수 체계를 이용하였다. 하드웨어 구현 결과, 게이트 수를 약 $12%{\sim}25%$ 줄일 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1925-1938
• /
• 2001

In this paper, a new block-matching algorithm for standard video encoder is presented. The slice competition method is proposed as a new scheme, as opposed to a coarse-to-fine approach. The order of calculating the SAD(Sum of Absolute Difference) to fad the best matching block is changed from a raster order to a dispersed one. Based on this scheme, the increasing SAD curve during its calculation is more linear than that of other curves. Then, the candidates of low probability can be removed in the early stage of calculation. And new MV prediction technique with an adaptive search range scheme also assists the proposed block-matching algorithm. As a result, an average of 13% improvement in computational power is recorded by only the proposed MV prediction technique. Synthetically, the computational power is reduced by 3977∼77% than that of the conventional BMAs. The average MAD is always low in various sequences. The results are also very close to the MAD of the full search block-matching algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.539-547
• /
• 2003

According to the PDE scheme, it is desirable to make the value of SAD to be rapidly increased in motion estimation. In this paper, we propose a new block matching algorithm based on the combination of a new scan and search order. In the proposed scan order, a current block is divided by the frequency that is estimated by summing the difference between the mean and the values of the pixels. And then the calculation of SAD is performed from the highest frequency area. In the proposed search order based on DC difference between the current and the candidate block, candidate blocks with low DC are early checked in motion estimation. Simulation results show that the proposed method achieves about 6% computational gain compared with the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1605-1614
• /
• 2008

This paper proposed a new VLSI architecture of motion estimation (ME) and compensation (MC) for efficient video compression and implemented it to hardware. ME is generally calculated using SAD result. So we proposed a new arithmetic method for SAD. The proposed SAD calculation method increases arithmetic efficiency and decreases external memory usage. Finally it increases performance of ME/MC. The proposed ME/MC hardware was implemented to ASIC with TSMC 90nm HVT CMOS library. The implemented hardware occupies about 330K gates and stably operates the clock frequency of 143MHz.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1439-1445
• /
• 2007

In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.