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

In this paper, we propose a do-interlacing algorithm using integral projection-based motion estimation considering Region Of Interest(ROI). The proposed motion estimation method finds the motion of the given ROI accurately with low computational cost. In order to incorporate the motion estimation in do-interlacing, an entire image is first segmented into multiple ROIs according to the temporally predicted block-wise motion types and spatial positions. Then, motion vectors of respective ROIs are obtained by the integral projection method. In this paper, totally five ROIs, one for the global motion and four for the local motions, are made, and therefore, five motion vectors are produced for each field. By using the estimated motion vectors, motion compensation is performed for increasing the vortical resolution of the converted frames. Finally, do-interlaced frames are obtained by effectively combining the results of motion compensation and stable intra-field do-interlacing according to the reliability of motion compensation. Experimental results show that the proposed algorithm provides better image quality than existing algorithms in both subjective and objective measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.1-16
• /
• 1996

In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2112-2122
• /
• 1997

This paper presents a new video codec which is based on 2-D triangular mesh-based motion compensation and two step grid point motion estimation. With this approach the efficiency of compression and the quality of reconstructed images are improved. The compensation of motion for each triangular patch is performed by image warping using motion vectors at the grid points. The prediction error coding and the rate control meet MPEG-4 VM 3.0 specification. The experimental results show that the codec system proposed is simple in complexity and moreover, the quality of decoded images is improved.

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

• Journal of Broadcast Engineering
• /
• v.8 no.2
• /
• pp.181-197
• /
• 2003

Notion Compensation(MC) technique using Sub-Band Coding with the hierarchical structure is efficient to estimate real motion. In the hierarchical pyramid method, low-band MC pyramid method is popular, where the upper layer estimate the glover motion and next lower layer estimate the local motion. The low-band MC pyramid scheme has two problems. First, because the quantization errors at lower layer are accumulated when using coding and quantizing, it is impossible to search the exact Motion Vector(MV) Second, because of the top-down search problem in the hierarchical structure, MV mismatch in upper layer causes serious MV in lower layer So. we propose new hierarchical MC pyramid method based on edge classification. In this Paper, we show that the performance of proposed Pass-band motion compensation pyramid technique is better than low-band motion compensation pyramid. Also, in the pyramid motion estimation, we propose initial MV estimation scheme based on the edge-pattern classification. As a result, we find that PSNR was increased.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.426-428
• /
• 2000

화상회의 시스템의 영상 압축표준 중 하나인 H.261은 화상전화기에서 주로 사용되고 있다. 본 논문에서는 기존의 H.261 영상에 부가영상을 삽입하는 방법을 제안한다. H.261 영상에 단순히 부가영상을 삽입하면 움직임보상 데이터 처리를 하지 않기 때문에 전달된 H.261 영상으로부터 원래의 영상을 복원하기 어렵다. 이를 해결하는 방법으로 원시 H.261 영상 전체를 복호화 한 후 부가영상을 삽입하고 다시 부호화 하는 방법이 있으나 이 경우 처리해 주어야 할 데이터가 너무 많아 수행속도의 저하를 가져온다. 제안한 방법은 움직임 보상 정보가 영상에 아무 영향을 미치지 않을 경우에는 허프만 복/부호화만을 사용하여 단순 삽입을 하고, 움직임 보상 정보가 부가영상과 겹치게 되어 부가 영상이 포함된 영상을 전달 받는 측에서 문제가 될 경우만 복호화해 두었던 영상데이터를 보낸다. 간단한 실험을 통하여 제안된 알고리즘의 성능을 분석한 결과 전체를 복/부호화하는 방법에 비하여 대략 3배의 속도의 향상을 보였다.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.291-299
• /
• 2002

This paper proposes an efficient motion compensation algorithm for video sequences with brightness variations. In the proposed algorithm, the brightness variation parameters are estimated and local motions are compensated. To detect the frame with large brightness variations. we employ the frame classification based on the cross entropy between histograms of two successive frames, which can reduce the computational redundancy. Simulation results show that the proposed method yields a higher peak signal to noise ratio (PSNR) than the conventional methods, with a low computational load, when the video scene contains large brightness changes.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.299-302
• /
• 2011

분산비디오압축(DVC, Distributed Video Coding) 기술은 부호화기의 복잡한 과정을 복호화기로 이동시킴으로써 경량화 비디오 부호화를 위한 새로운 방법으로 주목 받고 있다. 하지만 복호화기에서 채널 복호 과정과 움직임 추정/보상 과정이 수행됨으로써 복호화기의 복잡도가 상당히 증가하게 되며, 이에 복호화기 채널 복호 과정을 고속화하기 위한 방법이 지속적으로 제안되고 있다. 그러나 채널 복호 과정이 고속화될수록 움직임 추정/보상에 소요되는 계산량이 상대적으로 증가하게 되어, 이에 대한 연구가 필요하다. 따라서 본 논문에서는 상대적으로 증가하는 움직임 추정/보상 과정에 적응적 탐색 영역 방법을 적용하여 DVC 복호화기를 고속화하는 알고리즘을 제안한다. 제안 방법은 고정된 탐색 영역을 사용한 보조 정보 생성 방법과 비교하여 평균 76%의 시간절감이 가능하며, 성능저하는 BDBR이 약 0.31% 증가하는 정도로 크지 않다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.149-159
• /
• 2001

The conventional block-based motion prediction suffers, especially in low bit-rate video application, from shortcomings such as blocking artifacts of motion field and unstable motion estimation. To overcome the deficiency, this paper proposes one method of adopting a new motion compensation scheme based on the irregular triangular mesh structure while keeping the current block-based DCT coding structure of H.263 as much as possible. To represent the reconstructed previous frame using minimal number of control points, the proposed method designs content-adaptive irregular triangular meshes, and then, estimate the motion vector of each control point using the affine transformation-based matching. The predicted current frame is obtained by applying the affine transformation to each triangular mesh. Experiment with the several real video sequences shows improvement both in objective and subjective picture quality over the conventional block-based H.263 method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.160-168
• /
• 2001

Change detection using difference picture has been used to detect the location of moving targets and to track them. This method needs the assumption of static camera, and the global motion compensation is required in case of a moving camera. This paper suggests a method for finding a minimum bounding rectangles(MBR) of moving targets in the image sequences using moving region detection, especially with a moving camera. If the global motion parameter is inaccurately estimated, the estimated locations of targets will be accurate either To alleviate this problem, we introduce the concept of the confidence measure and achieve more accurate estimation of global motion. Experimental results show that the proposed method successfully removes background region and extracts MBRs of the targets. Even with a moving camera, the new global motion estimation algorithm performs more precise]y and it reduces the background compensation errors of change detection.