• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.539-548
• /
• 2013

Although Motion estimation (ME) plays an important role in digital video compression, it requires a complicated search procedure 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 of motion estimation for Multi-view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, a low complexity motion estimation search method is proposed in this paper. The proposed search method consists of four-grid diamond search patten, two-gird diamond search pattern and TZ 2 Point search pattern. These search patterns exploit 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 TZ search method (JMVC) can be up to 1.8~4.5 times faster by reducing the computational complexity and the image quality degradation is about to 0.01~0.24 (dB).

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.62-69
• /
• 1992

The conventional BMA is performed with the fixed block size. For better performance at low bitrate, the block size is required to be large in relatively stationary area, while small in moving area. Thus, in this paper, a video coding technique using variable block size model is proposed. It decides the block size based on the degree of local motion defined by the local mean and variance of blocks. Computer simulation shows that the proposed method gives comparable performance to the conventional one with less bits required for motion vector coding.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.99-111
• /
• 1994

A motion picture compression scheme using subband coding with motion compensation is presneted in this paper. A hierarchical subband decomposition is used to split the image signal into 10 subbands with a 3-layer pyramid structure and motion compensation is used in each band. However, in this case, motion vector information is drastically increased; therefore, initial motion vectors are estimated in the highest pyramid and motion vectors are refined using the reconsructed subband signal in each layer. Simulation results show that the proposed method compares favorably in terms of prediction error energy and side informatio with methods requiring additional information. Images recostructed from the proposed method show good quality compared to those reconstructed using blockwise DCT.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.140-151
• /
• 2012

In Wyner-Ziv coding, key picture is encoded by conventional H.264/AVC intra coding which has low complexity. Although inter coding is more efficient than intra coding, its complexity is much higher than intra coding due to its motion estimation. Since the main feature of Wyner-Ziv coding is low complexity of encoder, inter coding is not suitable to encode key picture in Wyner-Ziv coding. However, inter picture coding with zero motion vector can be usable for Wyner-Ziv key picture coding instead of intra coding. Moreover, while current transform-domain Wyner-Ziv residual coding only utilizes temporal correlation of WZ picture, if zero motion coding is jointly used to encode key picture in transform-domain Wyner-Ziv residual coding, there will be a significant improvement in R-D performance. Experimental results show that the complexity of Wyner-Ziv coding with the proposed zero motion key picture coding is higher than conventional Wyner-Ziv coding with intra key picture coding by about 9%, however, there are BDBR gains up to 54%. Additionally, if the proposed zero motion key coding is implemented on top of the transform-domain Wyner-Ziv residual coding, the result shows rate gains up to 70% in BDBR compared to conventional Wyner-Ziv coding with intra key picture coding.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1075-1088
• /
• 2001

In this paper, we propose a method for dynamic selection of unrestricted motion vector(UMV) or default prediction mode(DPM) in H.263 bit stream. For this, we use the error of compensated image and the magnitude of motion vector. In the proposed strategy, the UMV mode is dynamically applied in a frame according to average magnitude of motion vector and error of compensated image. This scheme has improved the quality of image compared to the fixed mode UMV or DPM only. Number of searching points are greatly reduced when comparing to UMV The proposed method is more profitable to long video sequences having camera movement locally.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.7
• /
• pp.997-1014
• /
• 2001

In this paper, we propose a method for dynamic selection of unrestricted motion vector(UMV) or default prediction mode(DPM) in H.263 bit stream. For this, we use the error of compensated image and the magnitude of motion vector. In the proposed strategy, the UMV mode is dynamically applied in a frame according to average magnitude of motion vector and error of compensated image. This scheme has improved the quality of image compared to the fixed mode UMV or DPM only. Number of searching points are greatly reduced when comparing to UMV. The Proposed method is more profitable to long video sequences having camera movement locally.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.211-219
• /
• 1988

In this paper effective block matching algorithms are proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e.pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of this algorithm is the reduction of the computation time. In order to reduce the computation time, three mathods are proposed in this paper. These new algorithms are faster than other methods. Compared with the three step algorithm by Koga et al., the average ratio of the computational savings obtained from the proposed algorithm is about 3-4.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.49-51
• /
• 2021

Versatile Video Coding(VVC)에서 동영상 압축 효율을 증가시키기 위한 다양한 화면 간 예측(inter prediction) 기법 중에 적응적 움직임 벡터 해상도(Adaptive motion vector resolution, 이하 AMVR) 기술이 채택되었다. 다만 AMVR을 위해서는 다양한 움직임 벡터 해상도를 테스트해야 하는 부호화 복잡도를 야기하였다. AMVR의 부호화 복잡도를 줄이기 위하여, 본 논문에서는 가벼운 신경망 모델 기반의 AMVR 조기 판별 기법을 제안한다. 이에 따라 불필요한 상황을 미리 조기에 인지하여 대응한다면 나머지 AMVR 과정을 생략할 수 있기에 부호화 복잡도의 향상을 볼 수 있다.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.577-587
• /
• 2010

The layered coding structure of scalable video coding (SVC) with adaptive inter-layer prediction causes noticeable computational complexity increments when compared to existing video coding standards. To lighten the computational complexity of SVC, we present a fast algorithm to speed up the inter-mode decision process. The proposed algorithm terminates inter-mode decision early in the enhancement layers by estimating the rate-distortion (RD) cost from the macroblocks of the base layer and the enhancement layer in temporal, spatial, and inter-layer directions. Moreover, a search range decision algorithm is also proposed in this paper to further increase the motion estimation speed by using the motion vector information from temporal, spatial, or inter-layer domains. Simulation results show that the proposed algorithm can determine the best mode and provide more efficient total coding time saving with very slight RD performance degradation for spatial and quality scalabilities.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.737-740
• /
• 2008

Block-matching motion estimation plays an important role in video coding. In this paper, we propose an Efficient Search Algorithm for Fast Motion Estimation. The proposed algorithm detects motion variation for reducing computational complexity before determining motion vector. Experimental results show that the proposed algorithm has good performance than conventional algorithms through quantitative evaluation.