3 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 3 / 3
Yayın Rate-distortion and complexity joint optimization for fast motion estimation in H.264 video coding(IEEE, 2006) Ateş, Hasan Fehmi; Kanberoğlu, Berkay; Altunbaşak, YücelH.264 video coding standard offers several coding modes including inter-prediction modes that use macroblock partitions with variable block sizes. Choosing a rate-distortion optimal mode among these possibilities contributes significantly to the superior coding efficiency of the H.264 encoder. Unfortunately, searching for optimal motion vectors of each possible subblock incurs a heavy computational cost. In this paper, in order to reduce the complexity of integer-pel motion estimation, we propose a rate-distortion and complexity joint optimization method that selects for each MB a subset of partitions to evaluate during motion estimation. This selection is based on simple measures of spatio-temporal activity within the MB. The procedure is optimized to minimize mode estimation error at a certain level of computational complexity. Simulation results show that the algorithm speeds up the motion estimation module by a factor of up to 20 with little loss in coding efficiency.Yayın Occlusion aware motion compensation for video frame rate up-conversion(2010) Çizmeci, Burak; Ateş, Hasan FehmiSince the emergence of high definition (HD) display technologies, video standards conversion problem has become an important issue in storage, transmission and display of video content. Video frame rate up-conversion (FRUC) is considered as a standard task for today's HD displays because these displays reach high refresh rates of at least 100/120 Hz and low video frame rates should be pulled up by a factor of 2 or more before display. Motion compensated FRUC techniques are proposed to avoid motion blur and motion judder at high refresh rates, but these techniques suffer from spatial inconsistencies and artifacts especially in occluded regions of the interpolated frames. This paper introduces a new video FRUC method that aims to remove both motion judder and occlusion artifacts and generate smooth object motion for high quality displays. An occlusion adaptive overlapped block motion compensation (OBMC) technique is proposed, which provides spatio-temporally consistent frame interpolation. Covered/uncovered regions are detected by analyzing the discontinuities of the motion vector field. The occlusion regions are interpolated using this covered/uncovered decision and a new error metric that measures spatial consistency. Compared to existing methods, the proposed algorithm achieves FRUC with fewer artifacts and better spatial resolution especially in occluded areas.Yayın Rate-distortion and complexity optimized motion estimation for H.264 video coding(IEEE-INST Electrical Electronics Engineers Inc, 2008-02) Ateş, Hasan Fehmi; Altunbaşak, Yücel11.264 video coding standard supports several inter-prediction coding modes that use macroblock (MB) partitions with variable block sizes. Rate-distortion (R-D) optimal selection of both the motion vectors (MVs) and the coding mode of each MB is essential for an H.264 encoder to achieve superior coding efficiency. Unfortunately, searching for optimal MVs of each possible subblock incurs a heavy computational cost. In this paper, in order to reduce the computational burden of integer-pel motion estimation (ME) without sacrificing from the coding performance, we propose a R-D and complexity joint optimization framework. Within this framework, we develop a simple method that determines for each MB which partitions are likely to be optimal. MV search is carried out for only the selected partitions, thus reducing the complexity of the ME step. The mode selection criteria is based on a measure of spatiotemporal activity within the MB. The procedure minimizes the coding loss at a given level of computational complexity either for the full video sequence or for each single frame. For the latter case, the algorithm provides a tight upper bound on the worst case complexity/execution time of the ME module. Simulation results show that the algorithm speeds up integer-pel ME by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.
