• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.162-165
• /
• 2010

In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.

• Journal of Broadcast Engineering
• /
• v.1 no.2
• /
• pp.152-164
• /
• 1996

This paper describes the hardware architecture and implementation trade-offs of the Grand Alliance HDTV video encoder system. The implemented video encoder accepts video in 1125 line(30Hz) interlaced format, and produces a bit-stream compliant with the motion picture experts group version 2(MPEG-2) standards. The encoder processing includes large- area motion estimation and an advanced rate control mechanism. To keep the system complexity realizable, we adopt a fast hierarchical motion estimation method and developed its hardware architecture. Furthermore an adaptive perceptual quantization method is adopted to improve the perceptual quality. The developed system Is based on the 4-way parallel processing architecture and is implemented by using programmable IC, memory IC, and special-purpose processors such as DCT and motion estimation processors.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.77-88
• /
• 1995

It is assumed in the block matching algorithm(BMA) that all the pels in a block have a same motion vector. Then, the motion vector of a block in the BMA is matched to only one or none of the objects in the worst case if objects in a block have different motion vectors. This is apparent in the motion estimation using the fast BMA which has the effect of reducing the computation time and hardware complexity, compared to the full search BMA. Although the motion vector in the motion estimation using small block size is accurate, the increased number of bits is required to represent motion vectors. In this paper, new motion vector segmentation with less additional information and hardware complexity than the conventional method is proposed. In the proposed method, a motion vector is derived from the block for motion vector segmentation and another motion vector is extracted from four neighboring blocks to consiture a motion vector pair. For the accurate motion vector of each subblock, the motion vector is assigned to each subblock by mean squared error measure. And the overlapped motion compensation using window is also applied to reduce displaced frame difference.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.561-564
• /
• 2004

The motion estimation which requires huge computation consumes large power in a video encoder. Although a number of fast-search algorithms are proposed to reduce the power consumption, the smaller the computation, the worse the performance they have. In this paper, we propose an architecture that a low energy management scheme can be applied with several fast-search algorithm. In addition. we show that ECVH, a software scheduling scheme which dynamically changes the search algorithm, the operating frequency, and the supply voltage using the remaining slack time within given power-budget, can be applied to the architecture, and show that the power consumption can be reduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.781-783
• /
• 2001

동영상을 효율적으로 압축하기 위한 움직임벡터 예측에 관한 많은 연구가 진행되어 왔다. 가장 일반적인 FBMA(Full search-based Block Matching Algorithm)는 화질은 좋지만 계산량이 많기 때문에 실시간 인코딩을 요구하는 시스템에서 사용하는데 문제가 있다. 좋은 화질을 유지하면서 인코딩 속도를 해결하기 위한 많은 알고리즘들이 제안되어 왔지만 ASIC이나 소형 시스템에서 사용할 수 있는 방법이 계속 요구되고 있다. 본 논문에서는 계산량을 더욱 줄여 속도향상을 가져오면서 FBMA와 비숫한 SNR을 유지하는 방법인 NMS(New Fast Motion Estimation Search With Subsmapling Method)를 제안하였다. NMS는 서브샘플림한 값을 이용하여 SAD값을 구하고 또한 새로운 Search를 제안하여 기존 방법들이 제공하는 주관적 화질이나 PSNR을 높게 유지하면서도 속도를 10~15% 정도 개선시킬 수 있다.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.419-420
• /
• 2006

In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames for improve the rate-distortion performance. The complexity of multi-frame motion estimation increases linearly with the number of used reference frame. However, the distortion gain given by each reference frame varies with the video sequence, and it is not efficient to search through all the candidate frames. In this paper, we propose a fast mult-frame selection method using all zero coefficient block (AZCB) prediction and sum of difference (SAD) of neighbor block. Simulation results show that the speed of the proposed algorithm is up to two times faster than exhaustive search of multiple reference frames with similar quality and bit-rate.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.903-904
• /
• 2008

This paper suggests a simple scheme of block motion estimation in which the search pattern selection is based on the classification of motion content available in the spatio temporal neighboring blocks. The search area is divided into eight sectors and the search pattern selection is also based on the direction of predicted motion vector. Experimental results show that the proposed algorithm has achieved good predicted image quality measured in terms of PSNR and has very less computational complexity.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.268-270
• /
• 2014

본 논문은 FME (Fractional Motion Estimation)의 선택적 수행을 통한 HEVC (High Efficiency Video Coding)의 부호화 고속화 방법을 제안한다. HEVC 는 H.264/AVC 에 비해 약 2 배의 압축 효율을 보이지만, 쿼드트리 구조의 재귀적 호출은 복잡도를 크게 증가시켰다. 이러한 이유로 인하여 HEVC 부호화기의 고속 모드 결정 및 고속화 연구가 활발히 진행되고 있다. 본 논문에서는 HEVC 부호화기 중 가장 높은 복잡도를 갖는 화면 간 예측 모드의 부화소 움직임 추정 (FME: Fractional Motion Estimation)의 선택적 수행을 통하여 부호화기를 고속화하는 방법을 제안한다. 제안하는 방법을 HEVC 레퍼런스 소프트웨어인 HM-12.0 에 적용하여 평균 2.0%의 BD-BR 가 증가하였으나, 평균 36.0%의 부호화 시간 감소 효과를 얻을 수 있었다.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.753-758
• /
• 2012

As the next-generation video coding standard, High Efficiency Video Coding (HEVC) has adopted advanced coding tools despite the increase in computational complexity. In this paper, we propose a selective bi-prediction method to reduce the encoding complexity of HEVC. The proposed method evaluates the statistical property of the sum of absolute differences in the motion estimation process and determines whether bi-prediction is performed. A performance comparison of the complexity reduction is provided to show the effectiveness of the proposed method compared to the HEVC test model version 4.0. On average, 50% of the bi-prediction time can be reduced by the proposed method, while maintaining a negligible bit increment and a minimal loss of image quality.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.103-112
• /
• 2011

Motion estimation (ME) is regarded as an important component in a video encoding process, because it consumes a large computation complexity. H.264/AVC requires additional computation overheads for fractional search and interpolation. This causes a problem that computational complexity is increased. In Motion estimation, SATD(Sum of Transform Difference) has the characteristics of a parabolic based on the minimum point. In this paper, we propose new prediction algorithm to reduce search point in motion estimation by sub-pixel interpolation characteristics. The proposed algorithm reduces the time of encoding process by decreasing computational complexity. Experimental results show that the proposed method reduces 20% of the computation complexity of motion estimation, while the degradation in video quality is negligible.