• Annual Conference of KIPS
• /
• 2002.04a
• /
• pp.779-782
• /
• 2002

영상 압축 분야에서 데이터의 압축이 필수적인데, 이때 가장 많은 중복성을 가지고 있는 시간적 중복성은 이전 프레임의 데이터를 이용하여 움직임 추정과 움직임 보상을 수행하고 추정된 움직임 벡터에 의해서 보상된 영상과 원 영상과의 차 신호를 부호화하여 데이터를 압축한다. 움직임 추정과 움직임 보상 기법은 비디오 영상압축에서 중요한 역할을 하지만 많은 계산량으로 인하여 실시간 응용 및 고해상도 응용에 많은 어려움을 가지고 있다. 만일 움직임 추정을 하기 전에 블록의 움직임을 예측할 수 있다면 이를 바탕으로 탐색 영역에서 초기 탐색점의 위치 및 탐색 패턴을 결정할 수 있다. 본 논문에서는 움직임 벡터의 높은 공간적 상관성을 이용하여 초기 탐색점의 위치와 탐색 패턴을 결정함으로써 적응적으로 움직임 벡터를 추정하는 새로운 기법을 제안하고 성능을 평가한다. 실험을 통하여 제안된 알고리즘은 계산량의 감소에 있어서 높은 성능 향상을 보였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1531-1536
• /
• 2016

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.69-77
• /
• 2002

Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.55-65
• /
• 2002

Wavelet transform has recently emerged as a promising technique for video processing applications due to its flexibility in representing non-stationary video signals. Motion estimation which uses wavelet transform of octave band division method is applied In many places but if motion estimation error happens in the lowest frequency band. motion estimation error is accumulated by next time strep and there has the Problem that time and the data amount that are cost In calculation at each steps are increased. On the other hand. wavelet packet that achieved the best image quality in a given bit rate from a rate-distortion sense is suggested. But, this method has the disadvantage of time costs on designing wavelet packet. In order to solve this problem we solved this problem by introducing Top_down method. But we did not find the optimum solution in a given butt rate. That image variance can represent image complexity is considered in this paper. In this paper. we propose a fast multiresolution motion estimation scheme based on the adaptive wavelet transform for video compression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.820-828
• /
• 2008

In order to achieve high coding efficiency, H.264/AVC video coding standard adopts the techniques such as variable block size coding, motion estimation with quarter-pel precision, multiple reference frames, rate-distortion optimization, and etc. However, these coding methods have a defect to greatly increase the complexity for motion estimation. Particularly, from multiple reference frame motion estimation, the computational burden increases in proportion to the number of the searched reference frames. Therefore, we propose the method to reduce the complexity by controlling the number of the searched reference frames in motion estimation. Proposed algorithm uses the optimal reference frame information in both $P16{\times}16$ mode and the adjacent blocks, thus omits unnecessary searching process in the rest of inter modes. Experimental results show the proposed method can save an average of 57.31% of the coding time with negligible quality and bit-rate difference. This method also can be adopted with any of the existing motion estimation algorithm. Therefore, additional performance improvement can be obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.9-15
• /
• 2007

We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.388-396
• /
• 2003

In this paper, a fast motion search algorithm that performs motion search for variable blocks in integer pixel unit is proposed. The proposed method is based on the successive elimination algorithm (SEA) using sum norms to find the best estimate of motion vector and obtains the best estimate of the motion vectors of blocks, including 16${\times}$8, 8${\times}$16, and 8${\times}$8, by searching eight pixels around the best motion vector of 16${\times}$16 block obtained from all candidates. And the motion vectors of blocks, including 8${\times}$4, 4${\times}$8, and 4${\times}$4, is obtained by searching eight pixels around the best motion vector of 8${\times}$8 block. The proposed motion search is applied to the H.264 encoder that performs variable blocks motion estimation (ME). In terms of computational complexity, the proposed search algorithm for motion estimation (ME) calculates motion vectors in about 23.8 times speed compared with the spiral full search without early termination and 4.6 times speed compared with the motion estimation method using hierarchical sum of absolute difference (SAD) of 4${\times}$4 blocks, while it shows 0.1dB∼0.4dB peak signal-to-noise ratio (PSNR) drop in comparison to the spiral full search.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.149-159
• /
• 2001

The conventional block-based motion prediction suffers, especially in low bit-rate video application, from shortcomings such as blocking artifacts of motion field and unstable motion estimation. To overcome the deficiency, this paper proposes one method of adopting a new motion compensation scheme based on the irregular triangular mesh structure while keeping the current block-based DCT coding structure of H.263 as much as possible. To represent the reconstructed previous frame using minimal number of control points, the proposed method designs content-adaptive irregular triangular meshes, and then, estimate the motion vector of each control point using the affine transformation-based matching. The predicted current frame is obtained by applying the affine transformation to each triangular mesh. Experiment with the several real video sequences shows improvement both in objective and subjective picture quality over the conventional block-based H.263 method.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.28-35
• /
• 2010

The variable block size motion estimation (ME) and compensation (MC) using multiple reference frames is adopted in H.264/AVC to improve coding efficiency. However, the computational complexity for ME/MC increases proportional to the number of reference frames and variable blocks. In this paper, we propose a new efficient reference frame selection algorithm to reduce the complexity while keeping the visual quality. First, a motion vector reference map is constructed by SAD of $4{\times}4$ block unit for multi reference frames. Next, the variable block size motion estimation and motion compensation is performed according to the motion vector reference map. The computer simulation results show that the average loss of BDPSNR is -0.01dB, the increment of BDBR is 0.27%, and the encoding time is reduced by 38% compared with the original method for H.264/AVC.