• Journal of Broadcast Engineering
• /
• v.19 no.6
• /
• pp.916-924
• /
• 2014

It is possible to improve the accuracy of the motion estimation for a video by applying a variable block size. However, it has limits in the zoom motion estimation. In this paper, we propose a method for estimating the zoom motion with variable block size. The proposed method separates the background within the object picture by depth information obtained from a depth camera, and only the object regions are applied to zoom scale, but the background is not applied. In addition, the object regions select efficiently variable block size mode in consideration of the generated motion vectors and the accuracy of motion estimation at the same time. Simulation results show the accuracy of the motion estimation and the number of motion vectors for the proposed method. It is verified that the proposed method can reduce the number of motion while maintaining the similar accuracy of motion estimation than the conventional motion estimation methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.1-8
• /
• 2008

This paper introduces three efficient frame selection schemes to reduce the computation complexity for the multi-reference and variable block size Motion Estimation (ME). The proposed RSP (Reference Selection Pass) scheme can minimize the overhead of frame selection. The MFS (Modified Frame Selection) scheme can reduce the number of search points about 18% compared with existing schemes considering the motion of image during the reference frame selection process. In addition, the TPRFS (Two Pass Reference frame Selection) scheme can minimize the frame selection operation for the variable block size ME in H.264/AVC using the character of selected reference frame according to the block size. The simulation results show the proposed schemes can save up to 50% of the ME computation without degradation of image Qualify. Because the proposed schemes can be separated from the block matching process, they can be used with any existing single reference fast search algorithms.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.128-136
• /
• 2008

In this paper, we propose a variable step search fast motion estimation algorithm using local statistics of neighboring motion vectors. Using the degree of correlation between neighboring motion vectors, motion search range is adaptively adjusted to reduce unnecessary search points. Based on the adjusted search range, motion vector is obtained by variable search step. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast full spiral search motion estimation and other fast motion estimation.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2271-2280
• /
• 1999

In this paper, a variable motion estimation scheme based on HBMA(Hierarchical Block Matching Algorithm) to improve the performance and to reduce heavy computational and transmission load, is presented. The proposed algorithm is composed of four steps. First, block activity for each block is defined using the edge information of differential image between two sequential images, and then average block activity of the present image is found by taking the mean of block activity. Secondly, camera pan compensation is carried out, according to the average activity of the image, in the hierarchical pyramid structure constructed by wavelet transform. Next, the LUT classifying each block into one among Moving, No Moving, Semi-Moving Block according to the block activity compensated camera pan is obtained. Finally, as varying the block size and adaptively selecting the initial search layer and the search range referring to LUT, the proposed variable HBMA can effectively carries out fast motion estimation in the hierarchical pyramid structure. The cost function needed above-mentioned each step is only the block activity defined by the edge information of the differential image in the sequential images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1121-1125
• /
• 2004

This paper is studied the fast block mode decision algorithm for H.264/AVC. The fast block mode decision algorithm is consist of block range decision and merge algorithm. The block range decision algorithm classifies the block over 8$\times$8 size or below for 16$\times$16 macroblock to decide the size and type of sub blocks. The block over 8$\times$8 size is divided into the blocks of 16$\times$8, 8$\times$16 and 16$\times$16 size using merging algorithm which is considered MVD(motion vector difference) of 8$\times$8 block. The sub block range decision reduces encoding arithmetic amount by 48.25% on the average more than the case not using block range decision.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8C
• /
• pp.764-771
• /
• 2009

In this paper, we propose a fast multiple reference frame selection method using neighboring motion vectors and the correlation of inter-mode blocks in H.264 video coding. Using the property that an optimal reference frame has the statistical characteristics, the motion estimation of small Inter-block size is estimated from the motion estimation of the larger Inter-block size. Simulation results show that the proposal method decreased the computations about 91%. Without the sacrifice of coding performance, comparing to the H.264 multiple reference picture coding.

• Annual Conference of KIPS
• /
• 2000.04a
• /
• pp.858-863
• /
• 2000

동영상은 시간 및 공간적으로 많은 상관성을 지니고 있으며, 움직임추정 방법에서 움직임의 시 공간 상관성을 이용하면 정확한 움직임 추정과 성능 개선을 가져올 수 있다. 한편, Zafar와 Zhang은 웨이브릿 변환 영역에서 가변 블록 (variable block-size)을 이용한 다해상도 움직임 추정(multire-solution motion estimation) 기법을 제안하였다

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.70-79
• /
• 2007

H.264/AVC has many repeated computation for motion estimation. Because of that, it takes much time to encode and it is very hard to implement into a real-time encoder. Many fast algorithms were proposed to reduce computation time but encoding quality couldn't be qualified. In this paper we proposed a new motion vector prediction method for efficient and fast full search H.264/AVC motion estimation. We proposed independent motion vector prediction and SAD share for motion estimation. Using our algorithm, motion estimation reduce calculation complexity 80% and less distortion of image (less PSNR drop) than previous full search scheme. We simulated our proposed method. Maximum Y PSNR drop is about 0.04 dB and average bit increasing is about 0.6%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.560-565
• /
• 2007

본 논문에서는 H.264 동영상 표준의 가변 움직임 블록을 위한 고속 움직임 예측 기법을 제안한다. 움직임 예측은 H.264의 비디오 코딩 과정에서 가장 많은 연산량을 차지하는 중요한 처리과정이다. 움직임 예측과정에서 정수배 화소 단위에서의 탐색에 비하여, 부화소 단위까지의 움직임 추정은 실제 움직임 벡터를 찾아낼 수 있지만, 이를 구하기 위한 계산량이 늘어나는 문제가 있다. 본 논문에서는 기준점을 기준으로 기준점으로부터 $\pm1$ 화소 내에서 두 번째로 작은 오차 값이 있는 특성 및 부화소 단위의 화소 보간 특성을 이용하여 움직임 추정 과정에서 탐색점을 줄임으로써 연산 처리 속도를 증가시키고, 계산의 복잡도를 줄이는 알고리즘을 제안하였다. 제안한 방법에서는 정수 화소 단위에서의 가장 작은 SATD를 갖는 점과 참조 영상으로부터 추출한 PMV를 비교하여 기준점을 정한 후, 기준점 주위의 8개의 화소 위치 가운데 두 번째로 SATD값이 작은 점을 찾아 해당 방향으로 1/2 화소 단위의 움직임 추정을 수행하였고, 1/4 화소 단위에서도 1/2 화소단위에서 두 번째로 SATD가 작은 점 방향으로 움직임 추정을 실행하였다. 그 결과 기존의 JM에서 사용한 고속 움직임 예측 알고리즘에 비해 PSNR값에 큰 변화가 없고, 움직임 벡터 예측 시간 면에서 약 18%의 시간을 줄이는 결과를 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1091-1097
• /
• 2005

In this paper, we propose fast motion estimation algorithm. Local statistics of a motion vector is highly correlated to motion vectors of its neighboring blocks. According to the property, block-based motion search range is adaptively determined in order to reduce unnecessary search points. Based on the determined search range, motion vector is obtained by variable step search motion estimation. Experimental results show that comparing to Full search motion estimation, the motion searching points of proposed algorithm is reduced as much as $98\%$. Moreover, PSNR and Bit Rate are almost same to Full search method.