• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.745-747
• /
• 1999

디지털 TV의 동영상 표준인 MPEG2는 방대한 양의 디지털 데이터를 발생한다. 그러나 현재 사용하고 있는 디지털 저장 매체의 수용 능력에는 한계가 있으므로 저장을 위해 전송된 high bit rate의 MPEG2 bitstream을 더욱 낮은 bit rate의 bitstream으로 전환하는 transcoding 기법이 반드시 필요하다. 기존의 encoder와 decoder를 이용하여 구현 가능한 장점이 있는 cascade transcoder는 reencoding시 motion estimation에 많은 수행 시간이 소요되므로, motion estimation 과정을 최소화하면서 optimal motion vector를 구할 수 있는 motion vector refinement 기법을 MPEG2 cascade transcoder에 적용하였다. 결과 처리 속도는 3-5배 향상되었고 화질은 기존의 72 transcoder에 비해 평균 0.1dB 이상의 FSNR 향상이 있었다. 또한 1Mbps와 같은 low bit rate에서 더욱 큰 화질 향상이 있었다.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.133-143
• /
• 2011

In this paper, a complexity-balancing algorithm is proposed for distributed video coding based on entropy coding. In order to reduce complexity of DVC-based decoders, the proposed method employs an entropy coder instead of channel coders and the complexity-balancing method is designed to improve RD performance with minimal computational complexity. The proposed method performs motion estimation in the decoder side and transmits the estimated motion vectors to the encoder. The proposed encoder can perform more accurate refinement using the transmitted motion vectors from the decoder. During the motion refinement, the optimal predicted motion vectors are decided by the received motion vector and the predicted motion vectors and complexity load of block is allocated by adjusting the search range based on the difference between the received motion vector and the predicted motion vectors. The computational complexity of the proposed encoder is decreased 11.9% compared to the H.264/AVC encoder and that of the proposed decoder are reduced 99% compared to the conventional DVC decoder.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.66-69
• /
• 2017

본 논문에서는 프레임율 향상 기법 (Frame Rate Up-Conversion, FRUC)에 사용되는 새로운 움직임 예측(motion estimation)알고리즘을 제시한다. 제안된 알고리즘은 단 방향 움직임 예측(unilateral motion estimation)에 의해 순방향 및 역방향의 움직임 벡터(motion vector)를 독립적으로 추정한다. 움직임 벡터를 찾은 후, weighted motion vector smoothing(WMVS)가 적용된다. 다음으로, 보간 프레임 (interpolated frame)의 관점에서 현재 블록의 인접 블록들의 모션 벡터들을 후보들로 사용하여 현재 블록과 가장 잘 일치하는 움직임 벡터를 찾는다. 그 후, 선택된 움직임 벡터를 현재 블록의 유도 움직임 벡터 (guidance motion vector)로 정한다. 그런 다음 motion vector shifting error 를 없애기 위해 motion vector refinement (MVR)가 진행된다. 마지막 단계에서는 각 움직임 벡터의 신뢰도를 계산하여 순방향 및 역방향 움직임 벡터 중 최종 움직임 벡터를 선택한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.1
• /
• pp.50-61
• /
• 2005

To provide adaptively video streaming services on network environment, video transcoding is introduced. The one of transcoding methods is the frame-rate conversion. it needs a re-estimation about a motion vector of the frame to refer a skipping frame. This re-estimation makes higher the computational complexity in video transcoding. To reduce the computational complexity of a motion vector refinement, this paper proposes a region & activity based motion vector composition scheme that refine the moving vector of a skipping frame. This scheme composes each motion vector from the weight based on the activity information of a macroblock and the site of the overlapped area. The experiment result shows that RABVC has a higher PSNR than the value of existing weight-based motion vector selection schemes though the computational complexity of our scheme is similar to that of other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1669-1676
• /
• 2004

In H.264, 7 modes {16${\times}$16, 16${\times}$8, 8${\times}$16, 8${\times}$8, 8${\times}$4, 4${\times}$8, 4${\times}$4) are used to enhance the coding efficiency. The motion vector estimation with 7 modes may require huge computing time. In this paper, to speed up the motion vector estimation procedure while the high image quality remains, we propose a motion vector refinement scheme using the temporary motion vector generated with little computation. The proposed estimation process consists of three phases: Mode decision for a 16${\times}$16 macroblock, Composing a temporary motion vector, Refinement of the temporary motion vector. We demonstrate the effectiveness of the proposed method by computer simulation. In the results, the encoding time consumed by the proposed scheme has been reduced significantly while the encoded video quality remains unchanged.

• 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 Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.135-142
• /
• 2009

Since hold-type display systems have been developed, frame-rate up conversion (FRUC) is an essential technique to improve the temporal resolution in the display. FRUC improves the temporal resolution by interpolating one or multiple intermediate frames between two adjacent frames. In this paper, a new frame-rate up-conversion algorithm based on bilateral motion refinement with rotation is proposed. First, we perform bi-directional motion estimation between adjacent two frames to obtain a motion vector for each block. Then, we apply a modified median filtering to motion vectors for outlier-rejection and motion field smoothing. The filtered motion vectors are updated by the bilateral motion refinement with rotation. After the refined motion vector is obtained, the intermediate frame is generated by applying the overlapped block motion compensation (OBMC). Experimental results show that the proposed algorithm provides a better performance than the previous methods subjectively and objectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.9-12
• /
• 2002

In this Paper, we propose an efficient de-interlacing algorithm using temporal and spatial domain information. In the proposed scheme, motion estimation is performed same parity fields, i.e., if current field is even field, reference fields are previous even field and forward even field. And then motion vector refinement is performed to improve the accuracy of motion vectors. In the interpolating step, we use median filter to reduce the interpolation error caused by incorrect motion vector. Simulations conducted for various video sequences have shown the efficiency of the proposed interpolator with significant improvement over previous methods in terms of both PSNR and perceived image quality.