Filtreler

2006 - 20084
Filtreleri Sıfırla

Ayarlar

Yazar: Altunbaşak, Yücel × Konu: Video coding ×

Arama Sonuçları

Listeleniyor 1 - 4 / 4
  • Küçük Resim
    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ücel
    H.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.
  • Küçük Resim
    Yayın
    Low complexity inter-mode selection for H.264
    (IEEE, 2006) Ba, Seydou Nourou; Altunbaşak, Yücel; Ateş, Hasan Fehmi
    The coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitions, the Motion estimation module has extremely high complexity that makes it unpractical for most real-time applications on resource-limited platforms such as hand held devices. In this paper we propose a novel algorithm that significantly reduces the encoding complexity while maintaining high rate distortion performance. The proposed method reduces the Motion estimation (ME) computational complexity by accurately predicting the optimal MB partitions and restricting the number of candidate modes based on a-priori probabilities computed from spatio-temporal information. The experimental results show that the speed up of UmHexagonS [1] (one of the most efficient ME algorithms) can be doubled while maintaining the coding efficiency of Full Search.
  • Küçük Resim
    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ücel
    11.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.
  • Küçük Resim
    Yayın
    H.264 video kodlamada çerçeve seviyesinde karmaşıklık kontrolü
    (IEEE, 2007) Ateş, Hasan Fehmi; Altunbaşak, Yücel
    H.264 kodlama standardı, değişken blok boyutlu makroblok bölüntüleri kullanan çok sayıda farklı çerçeveler arası kestirim kipini desteklemektedir. Ne var ki, her olası bölüntü için eniyi devinim vektörlerini aramanın hesaplama masrafı çok yüksektir. Bu bildiride, her makroblok için hangi bölüntülerin en iyi olabileceğini tahmin eden orijinal bir çerçeve seviyesinde karmaşıklık kontrol algoritması öneriyoruz. Devinim vektörlerinin aranması sadece bu seçilen bölüntüler için yürütülmekte, dolayısıyla devinim kestirimi adımının karmaşıklığı azaltılabilmektedir. Kip seçim kriteri olarak makrobloğun uzay-zamansal etkinliğinin basit bir ölçütü kullanılmıştır. Yöntem, her çerçevede belli bir yürütüm süresi bütçesinin sağlanmasını kodlama verimliliğinde en az bir kayıpla garanti etmektedir. Benzetim sonuçları, algoritmanın, 0.2 dB’den az bir kodlama kaybıyla, tamsayı-piksel devinim kestirimini 40 kata kadar hızlandırdığını göstermektedir.