• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.15-20
• /
• 2000

In this paper, we presents a new MCDI(motion compensated difference image) coding method using CVQ(classifled vector quantization) whoes MCD(motion compensated difference) block is classified by proposed classifier using motion vector and compensated block The variance of MCD block is closely related with the magnitude of motion vector as well as the variance of compensated block, so using this property, we propose a new classifier. This scheme has no side information of the classifier what sub-codebook is selected, and simulation results show that the proposed method exhibits a good performance even when compared with a conventional method that requires classification bits.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.77-82
• /
• 2005

We propose a highly Integrated motion estimation processor (MEP) for efficient video compression in an SoC platform. When compressing video by the standards like MPEG-4 and H.263, the macroblock related functions motion compensation. mode decision, motion vector prediction, and motion vector difference calculation require the frequent intervention of MCU. Thus the proposed MEP incorporates those functions with the motion estimation capability to reduce the number of interrupts to MCU, which can lead to a highly efficient SoC system. For low-power consumption, the proposed MEP can prevent the temporally static area from motion estimation or can skip the half-pel motion estimation for those macroblocks whose modes are decided as INTRA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2372-2382
• /
• 1998

In this paper, we propose a new edge based finite state vector quantization method having better performance than conventional side-match finite state vector quantization. In our proposed scheme, each dCT transformed block is classified to 17 classes according to edge types. Each class has a different codebook based on its characteristis. Encoder classified each block to motion block or stationary block and constructed a merging map by using edge and motion information, and sent to decoder. We controled amoutn of bing bits transmitted with selecting modes accoridng to bandwidth of transmitting channel. Compared with conventional algorithms, H.263 and H.261 at low bit rate, our proposed algorithm shows better picture quality and good performance.

• ETRI Journal
• /
• v.40 no.2
• /
• pp.266-274
• /
• 2018

In error-prone wireless environments, it is difficult to realize video coding systems that are robust to various types of data loss. In this paper, a novel motion-vector refinement approach is presented for video error concealment. A traditional boundary-matching approach is exploited to reduce blocky effects along the block boundary. More specifically, a downhill simplex approach is combined with a boundary-matching approach to fine-tune the motion vectors, reducing the blocky effects along the prediction unit block boundary, and minimizing the computational cost. Extensive simulations are performed, and the results obtained verify the robustness and effectiveness of the proposed approach.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is 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 a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.

• 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.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.765-773
• /
• 2017

Ultra-high definition videos, panorama contents, and ultra-wide viewing videos have a huge spatial resolution. However, a whole region of images is not always interesting to viewers due to limitations of system resources and display devices. To allow one or more interesting tiles to be decoded freely without decoding other tiles, this paper introduces a tile-based independent coding method. The propose method restraints motion vectors to be within a tile region shifting motion search area and modifying an initial motion vector. Experiments results show that any desired tile is capable to be decoded independently of other tiles.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.578-591
• /
• 2016

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.275-285
• /
• 2003

The now video coding standard H.264 employs variable block size motion compensation, multiple references, and quarter-pel motion vector accuracy. These techniques are key features to accomplish higher coding gain, however, at the same time main factors that increase overall computational complexity. Therefore, in order to apply H.264 to many applications, key techniques are requested to improve their speed. For this reason, we propose a fast motion estimation which is suited for variable block size motion communication. In addition, we propose a fast mode decision method to choose the best mode at early stage. Experimental results show the reduction of the number of SAT SATD calculations by a factor of 4.5 and 2.6 times respectively, when we compare the proposed fast motion estimation and the conventional MVFAS $T^{［8-10］}$. Besides, the number of RDcost computations is reduced by about 45%. Therefore, the proposed methods reduces significantly its computational complexity without noticeable coding loss.