15 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 15
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 Classification-based macroblock layer rate control for low delay transmission of H.263 video(IS & T - Soc Imaging Science Technology, 2003-07) Bayazıt, UluğPuri and Aravind's method of macroblock bit count estimation for video rate control is based on the classification of the macroblock data into discrete classes and assigning a unique non-linear estimate for each class and quantization parameter pair. This method stands apart from other methods in the literature, since the model of the bit count versus the quantization parameter relation, parameterized by macroblock variance, is a discrete model generated solely from measurements, We extend their technique for low-delay video rate control (tight buffer regulation) in two ways. We propose a strategy of near-uniform quantization parameter assignments to the macroblocks of a frame that can come close to maximizing an objective spatial quality function, such as PSNR, over the entire frame. We also adaptively update the quantization parameter assignments for the yet to be coded macroblocks, after the encoding of each macroblock, to compensate for any errors in the bit count estimation of the encoded macroblock. Our experiments demonstrate that the proposed rate control method can more accurately control the number of bits expended for a frame, as well as yield a higher objective spatial quality than the method adopted by TMN8.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 Optimal and near-optimal partner selection algorithms in cooperative OFDMA(IEEE, 2012) Bakşi, Saygın; Kaya, Onur; Bıyıkoğlu, TürkerWe obtain the jointly optimal power allocation and partner selection policies, that maximize the sum rate of a cooperative OFDMA system with mutually cooperating pairs of users. We show that the power allocation and partner selection steps can be performed sequentially, and the latter step can be formulated as a maximum weighted matching problem on an undirected graph, which can be solved in polynomial time. We further propose practical algorithms, and compare their performances to the optimal matching algorithm, and demonstrate that very simple and low complexity algorithms based on user-user and user-receiver distances may provide near-optimum rate performance. Moreover, we observe that algorithms that achieve superior sum-rate performance, surprisingly pair the cell edge users, with the strong users near the base station.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 A low complexity modulation classification algorithm for MIMO systems(IEEE-INST Electrical Electronics Engineers Inc, 2013-10) Mühlhaus, Michael S.; Öner, Mustafa Mengüç; Dobre, Octavia Adina; Jondral, Friedrich K.A novel algorithm is proposed for automatic modulation classification in multiple-input multiple-output spatial multiplexing systems, which employs fourth-order cumulants of the estimated transmit signal streams as discriminating features and a likelihood ratio test (LRT) for decision making. The asymptotic likelihood function of the estimated feature vector is analytically derived and used with the LRT. Hence, the algorithm can be considered as asymptotically optimal for the employed feature vector when the channel matrix and noise variance are known. Both the case with perfect channel knowledge and the practically more relevant case with blind channel estimation are considered. The results show that the proposed algorithm provides a good classification performance while exhibiting a significantly lower computational complexity when compared with conventional algorithms.Yayın A new algorithm for high speed speech and audio coding(IEEE, 2007) Güz, Ümit; Gürkan, Hakan; Yarman, Bekir Sıddık BinboğaIn this work, a new mathematical modeling approach is proposed for the representation of the speech and audio signals. This approach is based on the generation of the so called Predefined Signature Sequence (PSS) and Predefined Envelope Sequence (PES) Sets. After the generation process of the PSS and PES sets, they are clustered by effective k-means clustering algorithm and the PSS and PES are redefined by using the centroids of the clusters. By using this approach, the drawbacks such as the size of the sets, speed of the reconstruction process (computational complexity) which arise in our proposed methods previously are highly eliminated. In spite of these improvements, the initial results proved that, the quality of the reconstructed signals remains within the limitations of the acceptable hearing quality.Yayın A novel fast algorithm for speech and audio coding(IEEE, 2007) Güz, Ümit; Gürkan, Hakan; Yarman, Bekir Sıddık BinboğaIn this work a new mathematical modeling approach is proposed for the representation of the speech and audio signals. This approach is based on the generation of the so called Predefined Signature Sequence (PSS) and Predefined Envelope Sequence (PES) Sets. After the generation process of the PSS and PES sets, they are clustered by effective k-means clustering algorithm and the PSS and PES are redefined by using these centroids. By using this approach, the drawbacks by means of the size of the sets, speed of the reconstruction process (computational complexity) which arise in the proposed methods previously are highly eliminated. In spite of these improvements, the initial results proved that, the quality of the reconstructed signals remains within the limitations of the acceptable hearing quality.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 Vektör uzayında sıradüzensel ağaç yapısı ile düzenlenmiş metin veri tabanlarının çoklu yollar üzerinden sorgulanması(IEEE, 2004) Ayan, Uğur; Bayazıt, Uluğ; Gürgen, Sadık FikretWeb sayfaları, makaleler, kitap veya dergi isimlerinden oluşan büyük doküman yığınları üzerinde sorgulama yaparken dokümanları vektörlere ve doküman topluluklarını matrislere indirgemek sorgulamaları çok daha hızlandırır ve kolaylaştırır. Kullanılan matris ve vektörlerin boyutlarının büyüklüğü sebebiyle sorgulamalarda ortaya çıkan yüksek hesap karmaşıklığından kaçınılması için literatürde tekil değer ayrışımı ve ana bileşen analizi gibi boyut indirgeme yöntemleri önerilmiştir. Boyut indirgemeyle beraber hesap karmaşıklığını indirgeme için [12]’ de veritabanını sıradüzensel ağaç yapısı ile düzenleme ve bu yapı üzerinden tekli ve çoklu yollar kullanarak sorgulama önerilmiştir. Bu bildiride statik ve uyarlanabilir çoklu yolla sorgulama yöntemlerinin hesap karmaşıklığı başarım ödünleşimleri incelenmekte ve karşılaştırılmaktadır.
