• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.7
• /
• pp.47-52
• /
• 2009

H.264 video coding standard is widely used due to the high compression rate and quality. The motion compensation is the most time-consuming and complex unit in the H.264 decoder. The performance of the motion compensation is determined by the calculation of pixel interpolation and management of the reference pixels. The reference pixels read from external memory using efficient memory management for data reuse is necessary along with the high performance interpolators. We propose the architecture of a motion compensation unit for H.264 decoders. It is composed of 2-dimensional circular register files, a motion vector predictor and high performance interpolators with low complexity. The 2-dimensional circular register files reuse reference pixel data as much as possible, and feed reference pixel data to interpolators without any latency and complex logic circuits. We design a motion compensation unit and a intra-prediction unit and integrate them into a prediction unit and verify the operation and the performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.7-14
• /
• 2002

This paper proposes a camera motion estimation technique using special relations of motion vectors of geometrically symmetrical triple points of two consecutive views of single camera. The proposed technique uses camera-induced motion vectors and their relations other than feature points and epioplar constraints. As contrast to the time consuming iterations or numerical methods in the calculation of E-matrix or F-matrix induced by epipolar constraints, the proposed technique calculates camera motion parameters such as panning, tilting, rolling, and zooming at once by applying the proposed linear equation sets to the motion vectors. And by devised background discriminants, it effectively reflects only the background region into the calculation of motion parameters, thus making the calculation more accurate and fast enough to accommodate MPEG-4 requirements. Experimental results on various types of sequences show the validity and the broad applicability of the proposed technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.820-828
• /
• 2008

In order to achieve high coding efficiency, H.264/AVC video coding standard adopts the techniques such as variable block size coding, motion estimation with quarter-pel precision, multiple reference frames, rate-distortion optimization, and etc. However, these coding methods have a defect to greatly increase the complexity for motion estimation. Particularly, from multiple reference frame motion estimation, the computational burden increases in proportion to the number of the searched reference frames. Therefore, we propose the method to reduce the complexity by controlling the number of the searched reference frames in motion estimation. Proposed algorithm uses the optimal reference frame information in both $P16{\times}16$ mode and the adjacent blocks, thus omits unnecessary searching process in the rest of inter modes. Experimental results show the proposed method can save an average of 57.31% of the coding time with negligible quality and bit-rate difference. This method also can be adopted with any of the existing motion estimation algorithm. Therefore, additional performance improvement can be obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.53-61
• /
• 2008

In this paper, we propose an algorithm for generation of multi-view video from conventional 2 dimensional video. Color and motion information of an object are used for segmentation and from the segmented objects, multi-view video is generated. Especially, color information is used to extract the boundary of an object that is barely extracted by using motion information. To classify the homogeneous regions with color, luminance and chrominance components are used. A pixel-based motion estimation with a measurement window is also performed to obtain motion information. Then, we combine the results from motion estimation and color segmentation and consequently we obtain a depth information by assigning motion intensity value to each segmented region. Finally, we generate multi-view video by applying rotation transformation method to 2 dimensional input images and the obtained depth information in each object. The experimental results show that the proposed algorithm outperforms comparing with conventional conversion methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.258-268
• /
• 2001

The compression method is necessarily used to send the high quality moving picture that contains a number of data in image processing. In the field of moving picture compression method, the motion estimation algorithm is used to reduce the temporal redundancy. Block matching algorithm to be usually used is distinguished partial search algorithm with full search algorithm. Full search algorithm be used in this paper is the method to compare the reference block with entire block in the search window. It is very efficient and has simple data flow and control circuit. But the bigger the search window, the larger hardware size, because large computational operation is needed. In this paper, we design the full search block matching motion estimator. Using the DCT DC values, we decide luminance. And we apply 3 bit compare-selector using bit plane to I(Intra coded) picture, not using 8 bit luminance signals. Also it is suggested that use the same selective bit for the P(Predicted coded) and B(Bidirectional coded) picture. We compare based full search method with PSNR(Peak Signal to Noise Ratio) for C language modeling. Its condition is the reference block 8$\times$8, the search window 24$\times$24 and 352$\times$288 gray scale standard video images. The result has small difference that we cannot see. And we design the suggested motion estimator that hardware size is proved to reduce 38.3％ for structure I and 30.7％ for structure II. The memory is proved to reduce 31.3％ for structure I and II.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.343-345
• /
• 2010

H.264/AVC는 율-왜곡 계산에 기반한 화면 내 예측과 화면 간 예측을 통하여 높은 압축효율을 나타낸다. 그러나 모든 예측 모드의 율-왜곡 값을 계산하여 하나의 최적의 모드를 구하는 기존의 방법은 높은 계산량을 가지며 부호화에 걸리는 시간을 현저히 증가시킨다. 이러한 높은 계산량을 갖는 모든 예측모드의 율-왜곡 계산을 보완하기 위하여, 본 논문에서는 매크로블록의 움직임 특성 을 고려한 고속 부호화 모드 결정 방법을 제안한다. 각각의 매크로블록을 부호화하기 위해 미리 계산되는 SKIP모드에 대한 율-왜곡 값을 바탕으로 두 가지 문턱 값을 사용하여 움직임의 특성을 판단한다. 움직임의 특성에 따라 매크로블록은 3가지 분류로 나뉘게 되며, 각 분류에 따라 경쟁 모드를 적응적으로 선별하여 최적의 모드를 선택한다. 이러한 움직임 특성을 고려한 선택적 부호화 모드 결정을 통하여 부호화 효율의 큰 손실 없이 계산량을 감소시킴으로서 H.264/AVC의 고속 부호화가 가능한 x.264 대비 MMX를 사용하였을 때 16%, MMX를 사용하지 않았을 때 22%의 속도향상을 가져왔다.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.432-440
• /
• 2007

In this paper, we propose a small target detection algorithm for FLIR image with complex background. First, we compute the motion information of target from the difference between the current frame and the created background image. However, the slow speed of target cause that it has the very low gray level value in the difference image. To improve the gray level value, we perform the local gamma correction for difference image. So, the detection index is computed by using statistical characteristics in the improved image and then we chose the lowest detection index a true target. Experimental results show that the proposed method has significantly the good detection performance.