• Title/Summary/Keyword: Multiple reference frame selection

Search Result 13, Processing Time 0.031 seconds

Fast Multiple Reference Frame Selection Method for Motion Estimation and Compensation in Video Coding (동영상 부호화의 움직임 추정 및 보상을 위한 고속 다중 참조 프레임 선택 기법)

  • Kim, Jae-Hoon;Kim, Myoung-Jin;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11C
    • /
    • pp.1066-1072
    • /
    • 2007
  • In this paper, we propose a fast multiple reference frame selection method for motion estimation and compensation in video coding. Reference frames selected as an optimal reference frame by variable block sizes motion estimation have the statistical characteristic that was based on block size. Using the statistical characteristic, reference frames for smaller block size motion estimation can be selected from reference frame which was decided as an optimal one for the upper layer block size. Simulation results show that the proposal method decreased the computations about 60%. Nevertheless, PSNR and bit rate were almost same as the performances of original H.264 multiple reference motion estimation.

Fast Multiple Reference Frame Selection for H.264 Encoding (H.264 부호화를 위한 고속 다중 참조 화면 결정 기법)

  • Jeong, Jin-Woo;Cheo, Yoon-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.419-420
    • /
    • 2006
  • In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames for improve the rate-distortion performance. The complexity of multi-frame motion estimation increases linearly with the number of used reference frame. However, the distortion gain given by each reference frame varies with the video sequence, and it is not efficient to search through all the candidate frames. In this paper, we propose a fast mult-frame selection method using all zero coefficient block (AZCB) prediction and sum of difference (SAD) of neighbor block. Simulation results show that the speed of the proposed algorithm is up to two times faster than exhaustive search of multiple reference frames with similar quality and bit-rate.

  • PDF

Fast Multiple Reference Frame Selection Method Using Neighboring Motion Vectors and Inter-mode Correlation (인접 블록의 움직임 벡터 및 인터모드간 상관관계를 이용한 고속 다중 참조 프레임 선택 기법)

  • Jeong, Chan-Young;Kim, Myoung-Jin;Joo, Won-Hee;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8C
    • /
    • pp.764-771
    • /
    • 2009
  • In this paper, we propose a fast multiple reference frame selection method using neighboring motion vectors and the correlation of inter-mode blocks in H.264 video coding. Using the property that an optimal reference frame has the statistical characteristics, the motion estimation of small Inter-block size is estimated from the motion estimation of the larger Inter-block size. Simulation results show that the proposal method decreased the computations about 91%. Without the sacrifice of coding performance, comparing to the H.264 multiple reference picture coding.

Fast Reference Frame Selection Method Based on Best Reference Frame Index Correlation

  • Kim, Hyungwook;Lim, Sojeong;Yu, Sungwook
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.179-182
    • /
    • 2014
  • This letter presents a very simple yet very effective solution for fast reference frame (RF) selection in H.264/AVC. By efficiently making use of the correlation between the best RF indices in various inter modes, the proposed method significantly reduces the number of RFs to be examined at the expense of a very small miss rate. Simulation results show that the proposed method not only improves upon the coding performance of conventional methods but also reduces the encoding time significantly.

Fuzzy Logic Based Temporal Error Concealment for H.264 Video

  • Lee, Pei-Jun;Lin, Ming-Long
    • ETRI Journal
    • /
    • v.28 no.5
    • /
    • pp.574-582
    • /
    • 2006
  • In this paper, a new error concealment algorithm is proposed for the H.264 standard. The algorithm consists of two processes. The first process uses a fuzzy logic method to select the size type of lost blocks. The motion vector of a lost block is calculated from the current frame, if the motion vectors of the neighboring blocks surrounding the lost block are discontinuous. Otherwise, the size type of the lost block can be determined from the preceding frame. The second process is an error concealment algorithm via a proposed adapted multiple-reference-frames selection for finding the lost motion vector. The adapted multiple-reference-frames selection is based on the motion estimation analysis of H.264 coding so that the number of searched frames can be reduced. Therefore the most accurate mode of the lost block can be determined with much less computation time in the selection of the lost motion vector. Experimental results show that the proposed algorithm achieves from 0.5 to 4.52 dB improvement when compared to the method in VM 9.0.

  • PDF

Efficient Fast Multiple Reference Frame Selection Technique for H.264/AVC (H.264/AVC에서의 효율적인 고속 다중 참조 프레임 선택 기법)

  • Lee, Hyun-Woo;Ryu, Jong-Min;Jeong, Je-Chang
    • 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.

Fast Reference Frame Selection Algorithm Based on Motion Vector Reference Map (움직임 벡터 참조 지도 기반의 고속 참조 영상 선택 방법)

  • Lee, Kyung-Hee;Ko, Man-Geun;Seo, Bo-Seok;Suh, Jae-Won
    • 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.

Robust Scalable Video Transmission using Adaptive Multiple Reference Motion Compensated Prediction (적응 다중 참조 이동 보상을 이용한 에러에 강인한 스케일러블 동영상 전송 기법)

  • 김용관;김승환;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3C
    • /
    • pp.408-418
    • /
    • 2004
  • In this paper, we propose a novel scalable video coding algorithm based on adaptively weighted multiple reference frame method. To improve the coding efficiency in the enhancement layer, the enhancement frame is predicted by the sum of adaptively weighted double motion compensated frames in the enhancement layer and the current frame in the base layer, according to the input video characteristics. By employing adaptive reference selection scheme at the decoder, the proposed method reduce the drift problem significantly. From the experimental results, the proposed algorithm shows more than 1.0 ㏈ PSNR improvement, compared with the conventional scalable H.263+ for various packet loss rate channel conditions.

Adaptive Keyframe and ROI selection for Real-time Video Stabilization (실시간 영상 안정화를 위한 키프레임과 관심영역 선정)

  • Bae, Ju-Han;Hwang, Young-Bae;Choi, Byung-Ho;Chon, Je-Youl
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.288-291
    • /
    • 2011
  • Video stabilization is an important image enhancement widely used in surveillance system in order to improve recognition performance. Most previous methods calculate inter-frame homography to estimate global motion. These methods are relatively slow and suffer from significant depth variations or multiple moving object. In this paper, we propose a fast and practical approach for video stabilization that selects the most reliable key frame as a reference frame to a current frame. We use optical flow to estimate global motion within an adaptively selected region of interest in static camera environment. Optimal global motion is found by probabilistic voting in the space of optical flow. Experiments show that our method can perform real-time video stabilization validated by stabilized images and remarkable reduction of mean color difference between stabilized frames.

  • PDF

Spatial Correlation Based Fast Coding Depth Decision and Reference Frame Selection in HEVC (HEVC의 공간적 상관성 기반 고속 부호화 깊이 및 참조영상 결정 방법)

  • Lee, Sang-Yong;Kim, Dong-Hyun;Kim, Jae-Gon;Choi, Hae-Chul;Kim, Jin-Soo;Choi, Jin-Soo
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.716-724
    • /
    • 2012
  • In this paper, we propose a fast decision method of maximum coding depth decision and reference frame selection in HEVC. To reduce computational complexity and encoding time of HEVC, two methods are proposed. In the first method, the maximum depth of each coding unit (CU) in a largest CU (LCU) is constrained by using the maximum coding depth used by adjacent LCUs based on the assumption that the spatial correlation is very high and rate-distortion (R-D) cost. And we constrain the number of reference pictures for prediction unit (PU) performing motion estimation by using the motion information of the upper depth PU. The proposed methods reduce computational complexity of the HEVC encoder by constraining the maximum coding depth and the reference frame. We could achieve about 39% computational complexity reduction with marginal bitrate increase of 1.2% in the comparison with HM6.1 HEVC reference software.