21 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 21
Yayın Optimal primary-secondary user pairing and power allocation in cognitive cooperative multiple access channels(IEEE, 2014) Bakşi, Saygın; Kaya, OnurWe develop jointly optimal power control and primary-secondary user partnering strategies for a cognitive cooperative multiple access channel with K primary and K secondary users. For each primary user, a cooperating secondary user is assigned. We consider both underlay and overlay modes for cognition/cooperation. In overlay mode, each secondary user decodes and relays part of its assigned primary user's message, and simultaneously transmits its own independent message, while ensuring the primary user achieves at least its single user capacity with power control. The encoding is based on channel adaptive block Markov superposition coding, where the powers assigned to primary and secondary user codewords are optimized so as to maximize either the system's sum rate, or the sum of secondary users' rates. In underlay mode, each secondary user employs independent signalling and allocates its power to maximize its own rate, without decreasing its assigned primary user's rate. The partnering problem for either mode is reduced to a maximum weighted matching (MWM) problem on a bipartite graph, and solved jointly optimally with the power allocation problem.Yayın Optimum power control for transmitter cooperation in OFDMA based wireless networks(IEEE, 2011) Bakım, İsmail Sezi; Kaya, OnurFor a cooperative orthogonal frequency division multiple access (OFDMA) system with two transmitters (TXs), and full channel state information (CSI), we obtain the optimal power allocation (PA) policies which maximize the rate region achievable by a recently introduced version of block Markov superposition encoding (BMSE): inter-subchannel cooperative encoding (ISCE) [1]. We provide the optimality conditions that need to be satisfied by the powers associated with the transmitted codewords. We propose two algorithms that yield the optimal power distribution: a subgradient algorithm which achieves an arbitrary rate point on the achievable rate region boundary, and an iterative waterfilling-like algorithm which maximizes the sum rate, and converges much faster. We observe that, utilization of power control to take advantage of the diversity offered by the cooperative OFDMA system, not only leads to a remarkable improvement in achievable rates, but also may help determine how the subchannels have to be instantaneously allocated to various tasks in cooperation.Yayın Cooperative strategies and achievable rates for two user OFDMA channels(IEEE-INST Electrical Electronics Engineers Inc, 2011-12) Bakım, İsmail Sezi; Kaya, OnurWe propose three encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding (BMSE). We obtain the expressions for the resulting achievable rate regions for all three encoding strategies. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved. We demonstrate potential rate gains attained by cooperative OFDMA, through simulations.Yayın Decoder-side super-resolution and frame interpolation for improved H.264 video coding(IEEE, 2013) Ateş, Hasan FehmiIn literature decoder-side motion estimation is shown to improve video coding efficiency of both H.264 and HEVC standards. In this paper we introduce enhanced skip and direct modes for H.264 coding using decoder-side super-resolution (SR) and frame interpolation. P-and B-frames are downsampled and H.264 encoded at lower resolution (LR). Then reconstructed LR frames are super-resolved using decoder-side motion estimation. Alternatively for B-frames, bidirectional true motion estimation is performed to synthesize a B-frame from its reference frames. For P-frames, bicubic interpolation of the LR frame is used as an alternative to SR reconstruction. A rate-distortion optimal mode selection algorithm determines for each MB which of the two reconstructions to use as skip/direct mode prediction. Simulations indicate an average of 1.04 dB PSNR improvement or 23.0% bitrate reduction at low bitrates when compared to H.264 standard. Average PSNR gains reach as high as 3.95 dB depending on the video content and frame rate.Yayın Birleşik çöz/sıkıştır ve ilet tabanlı işbirlikçi çoklu erişim(IEEE, 2012-04-18) Güneş, Mehmet; Kaya, OnurBu bildiride, iki kullanıcılı bir işbirlikçi çoklu erişim kanalı için çöz-ilet ve sıkıştır-ilet tekniklerinin eş zamanlı kullanılmasına dayalı kodlama ve kodçözme teknikleri geliştiriyor, ve karşılık gelen erişilebilir veri hızı ifadelelerini türetiyoruz. Sonuçlarımızı bilinen bazı çift yönlü işbirliği stratejilerinin veri hızları ile kıyaslayarak, iki tekniğin bir arada kullanılmasının erişilebilir veri hızı bölgesini genişletebildiğini benzetimler yolu ile gösteriyoruz.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 Achievable rates for two user cooperative OFDMA(IEEE, 2010) Bakım, İsmail Sezi; Kaya, OnurWe propose two encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding. We obtain the expressions for the resulting achievable rate regions for both encoding strategies, and evaluate them through simulations. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved.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 Kernel kod-tablosu kodlaması ile sahne etiketleme(IEEE, 2017-06-27) Ateş, Hasan Fehmi; Sünetci, SercanSahne bölütleme ve etiketlemede son yıllarda süperpiksel tabanlı yaklaşımların başarılı olduğu görülmektedir. Öncelikle görüntü bir süperpiksel algoritması ile görsel olarak tutarlı küçük parçalara bölütlenmekte; daha sonra her süperpiksel için çeşitli öznitelik betimleyicileri hesaplanıp sınıflandırma yapılmaktadır. Bu bildiride süperpiksel öznitelikleri için Kernel Kodtablosu Kodlama (KKT) yaklaşımı önerilmiştir. KKT’de öznitelik vektörleri için sabit nicemleme yerine birden fazla kodsözcüğüne yumuşak eşlemleme yapılmaktadır. Kodsözcüklerine atanan ağırlıklar bir kernel uzaklık fonksiyonu ile hesaplanmaktadır. KKT yöntemi SuperParsing görüntü ayrıştırma algoritmasında SIFT özniteliklerinin kodlanması için kullanılmıştır. Geliştirdiğimiz yöntem 2,688 görüntü ve 33 sınıf içeren SIFT Flow veri kümesi kullanılarak denenmiş ve SuperParsing yönteminden %2.7 daha yüksek ayrıştırma doğruluğu sağlanmıştır.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.
- «
- 1 (current)
- 2
- 3
- »
