• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.392-400
• /
• 2005

Highly integrated MPEG-4@SP video compression engine, VideoCore, is proposed for mobile application. The primary components of video compression require the high memory bandwidth since they access the external memory frequently. They include motion estimation, motion compensation, quantization, discrete cosine transform, variable length coding, and so on. The motion estimation processor adopted in VideoCore utilizes the small-size local memories such that the video compression system accesses external memory as less frequently as possible. The entire video compression system is divided into two distinct sub-systems: the integer-unit motion estimation part and the others, and both operate concurrently in a pipelined architecture. Thus the VideoCore enables the real-time high-quality video compression with a relatively low operation frequency.

• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.1-9
• /
• 2009

In this paper, we propose the efficient processing technique for unavailable data in hardware implementation of motion estimator in H.264/AVC with parallel processing architecture. Motion estimation processing in the hardware is generally based on pipe-lining, some MV data of neighbor blocks are not available, whereas all MV data are valid in software processing where the data are sequentially processed. In this paper, we solve the problem of data being unavailable in MVp computation. To minimize the quality degradation caused by unavailable MVs, in the proposed method, the unavailable MV of a neighboring block is replaced with an integer pel unit MV, an MVp of neighboring blocks, or an MVcol (MV of co-located block). Comparing to the conventional method [7], our method outperformed maximally 0.832dB and 0.179dB for QCIF and CIF, respectively, in terms of BDPSNR.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.927-936
• /
• 2002

This paper presents the extraction of a feature by motion vector for efficient content-based retrieval for digital video. in this paper, divided by general size block for the current frame by video, using BMA(block matching algorithm) for an estimate by block move based on a time frame. but in case BMA appeared on a different pattern fact of motion in the vector obtain for the BMA. solve in this a problem to application for full search method this method is detected by of on many calculations. I propose an alternative plan in this paper Limit the search region to $\pm$15 and search is a limit integer pixel. a result, in this paper is make an estimate motion vector in more accurately using motion vector in adjoin in blocks. however, refer to the block vector because occurrence synchronism. Such addition information is get hold burden receive to transmit therefore, forecasted that motion feature each block and consider for problems for establish search region. in this paper Algorithm based to an examination Motion Estimation method by for motion Compensation is proposed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.54-63
• /
• 2000

We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.4
• /
• pp.235-242
• /
• 2016

The emerging High-Efficiency Video Coding (HEVC) standard attempts to improve coding efficiency by a factor of two over H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation (ME) is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Thus, fast mode decisions are not only an important issue to be researched, but also an urgent one. Several schemes for fast mode decisions have been presented in reference software and in other studies. However, the conventional hierarchical mode decision can be useless when block-level parallelism is exploited. This paper proposes operation-level exploration that offers more chances for early termination. An early termination condition is checked between integer and fractional MEs and between the parts of one partition type. The fast decision points of the proposed algorithm do not overlap those in previous works. Thus, the proposed algorithms are easily used with other fast algorithms, and consequently, independent speed-up is possible.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.390-393
• /
• 2012

H.264/AVC에서 움직임 추정에 소요되는 시간을 줄이면서 보다 나은 화질을 유지하기 위하여 본 논문에서는 정화소 움직임 추정 기법을 제안하였다. 본 논문에서는 정화소 움직임 추정을 위하여 대칭적인 탐색패턴을 이용한 계층적인 탐색 기법을 사용하였다. 제안한 정화소 움직임 추정 탐색 기법은 십자가 탐색 패턴, 다중 사각형 탐색 패턴, 작은 사각형 탐색 패턴, 다이아몬드 탐색 패턴들로 이루어져 있다. 제안한 움직임 추정 탐색 기법에서 사용한 탐색 패턴들은 블록 움직임이 수직으로 크거나 블록 움직임이 크면서 규칙적인 영상에서 국부적 최소화 문제를 해결하고 움직임 추정에 소요되는 시간을 줄이기 위하여 탐색 영역 내에 탐색 점들을 규칙적, 대칭적으로 배치하였다. 제안한 기법의 성능을 전역 탐색 기법의 성능과 비교하였을 때 움직임 추정에 소요되는 시간에 있어서 약 4~5.5 배의 속도 향상을 가져왔으며, 영상 화질에 있어서 전역 탐색 기법의 화질과 같거나 약간의 화질 저화를 보였다. 반면에, 비대칭 다중 육각형 탐색 기법의 성능과 비교하였을 때 움직임 추정 속도면에 있어서 약간의 성능 향상과 화질에 있어서 비슷하거나 최대 0.05 (dB)정도 향상을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.247-254
• /
• 2008

H.264 provides a good coding efficiency compared with existing video coding standards, H.263, MPEG-4, based on the use of multiple reference frame for variable block size motion estimation, quarter-pixel motion estimation and compensation, $4{\times}4$ integer DCT, rate-distortion optimization, and etc. However, many modules used to increase its performance also require H.264 to have increased complexity so that fast algorithms are to be implemented as practical approach. In this paper, among many approaches, fast mode decision algorithm by skipping variable block size motion estimation and spatial-predictive coding, which occupies most encoder complexity, is proposed. This approach takes advantages of temporal and spatial properties of fast mode selection techniques. Experimental results demonstrate that the proposed approach can save encoding time up to 65% compared with the H.264 standard while maintaining the visual perspectives.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.203-206
• /
• 2015

본 논문은 4K UHD 입력 영상에 대한 HEVC 고속 부호화를 위하여 대부분의 상용 CPU 및 AP 에서 사용되고 있는 SIMD (Single Instruction Mutiple Data) 명령어를 사용한 고속의 정수 화소 단위 움직임 추정 방법에 대한 연구이다. 특히, IT 기기에서의 고속 동영상 부호화를 위해 기존의 SIMD 명령어를 개량하여 동일한 CPU 실행시간에 다수의 움직임 추정을 수행할 수 있는 SIMD 명령어를 사용하여 보다 같은 실행시간에 보다 넓은 영역에 대한 움직임 벡터 탐색을 수행할 수 있도록 Search Box 기법을 새로이 개발하고 이를 토대로 기존 HEVC 에서 사용되고 있는 움직임 추정 방법에 대하여 연산시간을 줄이는 동시에 화질 열화를 최소화 시킬 수 있는 방법에 대하여 논한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.153-164
• /
• 2010

A program consumes energy by executing its instructions. The amount of cosumed power is mainly proportional to algorithm complexity and it can be calculated by using complexity information. Generally, the complexity of a S/W is estimated by the microprocessor simulator. But, the simulation takes long time why the simulator is a software modeled the hardware and it only provides the information about computational complexity quantitatively. In this paper, we propose a complexity estimation method of analysis of S/W on source code level and produce the complexity metric mathematically. The function-wise complexity metrics give the detailed information about the calculation-concentrated location in function. The performance of the proposed method is compared with the result of the gate-level microprocessor simulator 'SimpleScalar'. The used softwares for performance test are $4{\times}4$ integer transform, intra-prediction and motion estimation in the latest video codec, H.264/AVC. The number of executed instructions are used to estimate quantitatively and it appears about 11.6%, 9.6% and 3.5% of error respectively in contradistinction to the result of SimpleScalar.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.80-92
• /
• 2008

Many predominant video coding tools in terms of coding efficiency were adopted in the latest video coding standard, H.264/AVC. Regardless of development of these predominant video coding tools such as the variable block-size motion estimation/compensation, intra prediction based on various directions, and so on, the discrete cosine transform has been continuously used starting from the early video coding standards. Generally, the correlation coefficient of the residual signal is usually less than 0.5 when this residual signal is actually encoded. In this interval of correlation coefficient, the discrete cosine transform does not show the optimal coding gain, and the discrete sine transform which is a sub-optimal transform when the correlation coefficient is in the interval from -0.5 to 0.5 can be used in conjunction with the discrete cosine transform in the video coding. In this paper, an alternative transform that alternatively uses the discrete sine transform and integer cosine transform in H.264/AVC by using rate-distortion optimization is proposed. The proposed method achieves a BD-PSNR gain of up to 0.71 dB compared to H.264/AVC JM 10.2 at relatively high bitrates.