18 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 18
Yayın Spectral coding of mesh geometry with a hierarchical set partitioning algorithm(Spie-Int Soc Optical Engineering, 2008) Konur, Umut; Bayazıt, Uluğ; Ateş, Hasan Fehmi; Gürgen, Sadık FikretThis work proposes a progressive mesh geometry coder, which expresses geometry information in terms of spectral coefficients obtained through a transformation and codes these coefficients using a hierarchical set partitioning algorithm that assigns right priorities to those coefficients at all bit planes. The spectral transformation used is the one proposed in [8] where the spectral coefficients are obtained by projecting the mesh geometry on an orthonormal basis determined by mesh topology. The set partitioning method used in coding, treats spectral coefficients belonging to the three spatial coordinates with the right priority at all bit planes and realizes a truly embedded system by achieving implicit bit allocation via joint coding the zeroes of coefficients at the bit planes. The experiments performed on common irregular meshes reveal that the rate-distortion performance of the coder is significantly superior to the coding system proposed in [8].Yayın Tel file geometrilerinin sıradüzensel küme bölüntüleme ile spektral kodlaması(IEEE, 2007-09-04) Konur, Umut; Bayazıt, Uluğ; Ateş, Hasan Fehmi; Gürgen, Sadık FikretÇalışmamızda bir dönüşümle elde edilen spektral katsayılar kullanılarak betimlenen tel file geometri bilgisi, katsayılara bütün bit düzlemlerinde en doğru öncelikler atanarak sıradüzensel bir küme bölüntüleme algoritmasıyla aşamalı biçimde kodlanmaktadır. Kullanılan spektral dönüşüm [8]’de önerilmekte ve geometri bilgisinin topolojiden belirlenen birimdik bir doğuray üzerine düşümlenerek katsayıların elde edilmesi ilkesine dayanmaktadır. Kodlamada kullanılan küme bölüntüleme yöntemi, üç ayrı uzamsal koordinata ait farklı katsayıların bitlerine her bit düzleminde doğru önceliği tanımakta ve katsayıların bit düzlemlerindeki sıfırları birleşik kodladığı için dolaylı bit atamasını başararak tamamen gömülü bir yapıyı sağlayabilmektedir. Yaygın düzensiz tel filelerle yapılan deneylerde önerilen yöntemin hız-bozunum başarımı, [8]’deki kodlama yönteminin hız-bozunum başarımına göre açık bir üstünlük sağlamaktadır.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 Low complexity inter-mode selection for H.264(IEEE, 2006) Ba, Seydou Nourou; Altunbaşak, Yücel; Ateş, Hasan FehmiThe 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.Yayın Spherical coding algorithm for wavelet image compression(IEEE-Inst Electrical Electronics Engineers Inc, 2009-05) Ateş, Hasan Fehmi; Orchard, Michael T.In recent literature, there exist many high-performance wavelet coders that use different spatially adaptive coding techniques in order to exploit the spatial energy compaction property of the wavelet transform. Two crucial issues in adaptive methods are the level of flexibility and the coding efficiency achieved while modeling different image regions and allocating bitrate within the wavelet subbands. In this paper, we introduce the "spherical coder," which provides a new adaptive framework for handling these issues in a simple and effective manner. The coder uses local energy as a direct measure to differentiate between parts of the wavelet subband and to decide how to allocate the available bitrate. As local energy becomes available at finer resolutions, i.e., in smaller size windows, the coder automatically updates its decisions about how to spend the bitrate. We use a hierarchical set of variables to specify and code the local energy up to the highest resolution, i.e., the energy of individual wavelet coefficients. The overall scheme is nonredundant, meaning that the subband information is conveyed using this equivalent set of variables without the need for any side parameters. Despite its simplicity, the algorithm produces PSNR results that are competitive with the state-of-art coders in literature.Yayın Wavelet image coding using the spherical representation(IEEE, 2005) Ateş, Hasan Fehmi; Orchard, Michael T.In this paper, we introduce the "spherical representation", which provides a new adaptive framework for modeling and coding the image information in wavelet subbands. Based on this representation, a practical coding algorithm is developed. This coder uses local energy as a direct measure to differentiate between parts of the wavelet subband and to decide how to allocate the available bitrate. As local energy becomes available at finer resolutions, i.e. in smaller size windows, the coder automatically updates its decisions about how to spend the bitrate. We use a hierarchical set of variables to specify and code the local energy up to the highest resolution, i.e. the energy of individual wavelet coefficients. The overall scheme is nonredundant, meaning that the subband information is conveyed using this equivalent set of variables without the need for any side parameters. Despite its simplicity, the algorithm produces PSNR results that are competitive with the state-of-art coders in literature.Yayın Decoder side true motion estimation for very low bitrate b-frame coding(IEEE, 2011) Ateş, Hasan Fehmi; Çizmeci, BurakIn H.264 standard, coding of motion vectors constitutes a significant portion of total bitrate especially at low bitrate regimes. This is because differential coding of motion vectors is inefficient when the bit budget is very low. In this paper, we propose a novel estimation and coding algorithm for motion vectors of B-frames at very low bitrates. In this method, the encoder selects the optimal motion vector from a limited set of candidate vectors that are determined at the decoder side using true motion estimation. Since these candidate vector sets are fixed by the decoder for each macroblock, there is no need for explicit coding of motion information, which reduces the bitrate required for coding. Also, true motion vector estimates are used for improved direct mode coding in B-frames. The algorithm provides an average of 0.68 dB PSNR gain for B-frames when compared to the reference H.264 results at the same bitrates. Simulation results also indicate significant improvement in visual quality of the compressed B-frames.Yayın Fast inter-mode decision and selective quarter-pel refinement in H.264 video coding(IEEE, 2008) Ateş, Hasan FehmiIn H.264 video coding standard, there exist several inter - prediction modes that use macroblock partitions with variable block sizes. Choosing a rate-distortion optimal coding mode for each macroblock is essential for the best possible coding performance, but also prohibitive due to the heavy computational complexity associated with the required rate-distortion calculations. Likewise, sub-pel motion refinement improves the coding efficiency, but becomes a major computational bottleneck when integer-pel search is executed fast. In this paper, we present a simple strategy to reduce the complexity of quarter-pel refinement and inter-mode decision with minimum loss of coding efficiency. Based on the results of the half-pel motion estimation step, our method evaluates the likelihood of each inter-coding mode being optimal. Then, quarter-pel refinement and actual rate and distortion are computed for only those coding modes with sufficient chance of being optimal. We claim that this method minimizes optimal mode estimation error at a given level of refinement and mode decision complexity. Simulation results show that the algorithm speeds up quarter-pel search and inter-mode selection modules by a factor of about 6 with less than 0.12 dB PSNR loss.Yayın An algorithm and its architecture for half-pixel variable block size motion estimation(IEEE, 2007) Fatemi, Mohammad Reza Hosseiny; Salleh, Rosli Bin; Ateş, Hasan FehmiThis paper presents an accurate half-pixel variable block size motion estimation algorithm and its hardware architecture. The proposed algorithm does not require interpolation of the reference frame pixels and has near performance to the conventional interpolation-search methods. These simplifications cause high level reduction in computational time and gate count without the need for internal or external half-pixel accuracy search memory. A simple, low latency, high throughput and fully utilized pipelined architecture of proposed algorithm is implemented in VHDL The proposed hardware architecture uses shift registers for multiplication and pipelining technique and can support half-pixel accuracy variable block size motion estimation for the real time HDTV format (1920 x1280 resolution and 30 Frames/sec).Yayın İmge kodlaması için dalgacık paketlerinde küresel gösterim(IEEE, 2008-09-26) Ateş, Hasan Fehmi; Tamer, EnginBu bildiride, dalgacık dönüşümü için geliştirdiğimiz küresel kodlama algoritmasının dalgacık paketlerine uyarlanması sunulmuştur. Bu kodlayıcıda yerel katsayı enerjisi, dalgacık altbantlarında varolan uzamsal bilgiyi ayırt etmekte ve mevcut bit hızının bant içinde nasıl dağıtılacağına karar vermekte direk bir ölçüt olarak kullanılır. Yerel enerji daha yüsek çözünürlükte yani daha küçük boyutlu pencerelerde tanımlandıkça, kodlayıcı, bit hızını nasıl harcayacağı hakkındaki kararlarını otomatik olarak günceller. Bir sıradüzensel değişkenler kümesi kullanılarak yerel enerjinin en yüksek çözünürlüğe kadar yani dalgacık katsayılarının bireysel enerjilerine kadar belirlenmesi ve kodlanması mümkün olmaktadır. Enerji dağılımı açısından en iyi dalgacık paketinin kullanılması, algoritmanın kodlama performansı artırmaktadır. Sonuçta, özellikle dokulu imgeler için 1 dB’nin üzerinde kodlama kazancı elde edilmiştir.
