10 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 10
Yayın Representation of speech signals by single signature base function within optimum frame length(IEEE, 2000) Akdeniz, Rafet; Yarman, Bekir Sıddık BinboğaBefore this study, we proposed a novel method to represent signals in terms of, so called, “Signature Base Functions-SBF" which were extracted from the physical features of the waveform under consideration. SBF were determined in ad-hoc manner, which requires tedious search process, and they were not orthogonal. Furthermore, optimality of SBF was in question. In this work however, we suggest a well-organized procedure to generate “Optimum Orthogonal Signature Base Functions-OSBF" for selected waveforms, which in turn provides excellent means for signal representations. It is shown that the new method of signal representation, which is based on OSBF, requires less computation time with substantial signal compression and results in efficient speaker dependent recognition.Yayın Spektral yöntemler ve küme bölüntüleme yaklaşımlarıyla 3B nesne bilgilerinin sıkıştırılması(IEEE, 2006) Konur, Umut; Bayazıt, Uluğ; Gürgen, Sadık Fikret; Orcay, ÖzgürSpekral dönüşümle elde edilen katsayıları küme bölüntüleme yaklaşımlarıyla işleyerek 3B nesne geometrilerini kodlayan bir yöntem öneriyoruz. [1]' de anlatılan spektral yöntem düzensiz tel filelerde yüksek hız-bozunum başarımı sağlamakla kalmayıp, geriçatımı, katsayı vektörünü kırparak elde edilen ve toplam enerjisinin büyük bir bölümünü taşıyan alt vektörüyle gerçekleştirdiği için aşamalı iletim de sağlayabilmektedir. Önerilen spektral yöntemde, nesne geometrisinin [1]' de olduğu gibi topolojiden türetilen birimdik bir taban üzerine izdüşümü alınmakta ve elde edilen katsayılar [2]' nin küme bölüntüleme algoritmasıyla kodlanmaktadır. Yöntem üç koordinata ait spektral katsayılara dolaylı bit ataması başardığı ve önemli katsayılara ait konum bilgisini bu katsayıların bit düzlemlerindeki sıfırlarını birleşik kodlayarak verimli kodlama sağladığı için, yaygın düzensiz tel fileler üzerinde yaptığımız deneylerde [1]' e göre daha iyi hız-bozunum başarımı vermektedir. Üretilen bit katarı da tamamen gömülüdür.Yayın An efficient ECG data compression technique based on predefined signature and envelope vector banks(IEEE, 2005) Gürkan, Hakan; Güz, Ümit; Yarman, Bekir Sıddık BinboğaIn this paper, a new method to compress ElectroCardioGram (ECG) Signal by means of "Predefined Signature and Envelope Vector Banks-PSEVB" is presented. In this work, on a frame basis, any ECG signal is modeled by multiplying three parameters as called the Predefined Signature Vector, Predefined Envelope Vector, and Frame-Scaling Coefficient. It has been demonstrated that the predefined signature vectors and predefined envelope vectors constitute a "PSEVB" to describe any measured ECG signal. In this case, ECG signal for each frame is described in terms of the two indices "R" and "K" of PSEVB and the frame-scaling coefficient. The new compression method achieve good compression ratios with low level reconstruction error while preserving diagnostic information in the reconstructed ECG signal. Furthermore, once PSEVB are stored on each communication node, transmission of ECG signals reduces to the transmission of indexes "R" and "K" of PSEVB and the frame-scaling coefficient which also result in considerable saving in the transmission band.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 method to represent ECG signals via predefined personalized signature and envelope functions(IEEE, 2001) Yarman, Bekir Sıddık Binboğa; Gürkan, Hakan; Güz, Ümit; Aygün, B.In this paper, a new method to model ECG signals by means of "Predefined Personalized Signature and Envelope Functions" is presented. ECG signals are somewhat unique to a person. Moreover, it presents quasi-stationary behavior. Therefore in this work, on a frame basis, personal ECG signals X-i(t) is modeled by the form of X-i(t) approximate to C(i)phi(i)(t) alpha(i)(t). In this model, phi(i)(t) is defined as the Personalized Signature Function (PSF); alpha(i)(t) is referred to as Personalized Envelope Function (PEF) and C-i is called the Frame-Scaling Coefficient (FSC). It has been demonstrated that for each person, the sets Phi = {phi(k)(t)} and A = {alpha(r)(t)} constitute a "Predefined Personalized Functional Bases or Banks (PPFB)" to describe any measured ECG signal. Almost optimum forms of (PPFB), namely {alpha(r)(t)}, {phi(k)(t)} pairs are generated in the Least Mean Square (LMS) sense. Thus, ECG signal for each frame is described in terms of the two indices "R" and "K" of PPFB and the frame-scaling coefficient Ci. It has been shown that the new method of modeling provides significant data compression. Furthermore, once PPFB are stored on each communication node, transmission of ECG signals reduces to the transmission of indexes "R" and "K" of pairs and the coefficients C-i, which also result in considerable saving in the transmission band.Yayın Elektroensefalogram (EEG) işaretlerinin sıkıştırılmasında özgün bir yaklaşım(IEEE, 2008) Gürkan, Hakan; Güz, Ümit; Yarman, Bekir Sıddık BinboğaBu çalışmada, Elektroensefalogram(EEG) işaretlerinin yeniden oluşturulmasına yönelik olarak yeni bir yöntem sunulmaktadır. Sunulan yöntem, etkin bir k-ortalamalı sınıflandırma algoritması kullanılarak Sınıflandırılmış Temel Tanım ve Zarf Vektör Setlerinin oluşturulmasına dayanmaktadır. Bu çalışmada, EEG işaretleri eşit uzunluklu çerçevelere bölünerek analiz edilmiş ve herbir çerçeve Sınıflandırılmış Temel Tanım vektörü, Sınıflandırılmış Zarf vektörü ve Çerçeve Ölçekleme Katsayısı olarak adlandırılan üç parametrenin çarpımı biçiminde modellenmiştir. Bu durumda, EEG işaretinin herbir çerçevesi sınıflandırılmış temel tanım ve zarf vektör setlerine ilişkin iki sıra numarası R ve K ile çerçeve ölçekleme katsayısı cinsinden tanımlanabilir. Önerilen yöntemin başarımı ortalama karesel hata tanımı ve görsel inceleme ölçütü yoluyla değerlendirilmiştir. Önerilen yöntem, EEG işaretlerinin tanı açısından önemli kısımları korunarak, düşük yeniden oluşturma hataları ve yüksek sıkıştırma oranları ile yeniden oluşturulmasını sağlamaktadır.Yayın A novel representation method for electromyogram (EMG) signal with predefined signature and envelope functional bank(IEEE, 2004) Gürkan, Hakan; Güz, Ümit; Yarman, Bekir Sıddık BinboğaIn this paper, a new method to model EMG signals by means of "Predefined Signature and Envelope Functional Banks (PSEB)" is presented. Since EMG signals present quasi-stationary behavior, any EMG signal Xi is modeled by the form of Xi ? Ci?K?R on a frame bases in this work. In this model, ?R is defined as the Predefined Signature Vector (PSV); ?K is referred to as Predefined Envelope Vector (PEV) and Ci is called the Frame-Scaling Coefficient (FSC). EMG signal for each frame is described in terms of the two indices "R" and "K" of PSEB and the frame -scaling coefficient Ci. Furthermore, It has been shown that the new method of modeling provides significant data compression while preserving the clinical information in the reconstructed signal.Yayın EEG signal compression based on classified signature and envelope vector sets(IEEE Computer Society, 2007) Gürkan, Hakan; Güz, Ümit; Yarman, Bekir Sıddık BinboğaIn this paper, a novel method to compress ElectroEncephaloGram (EEG) Signal is proposed. The proposed method is based on the generation Classified Signature and Envelope Vector Sets (CSEVS) by using an effective k-means clustering algorithm. In this work on a frame basis, any EEG signal is modeled by multiplying three parameters as called the Classified Signature Vector, Classified Envelope Vector, and Frame-Scaling Coefficient. In this case, EEG signal for each frame is described in terms of the two indices R and K of CSEVS and the frame-scaling coefficient. The proposed method is assessed through the use of root-mean-square error (RMSE) and visual inspection measures. The proposed method achieves good compression ratios with low level reconstruction error while preserving diagnostic information in the reconstructed EEG signal.Yayın Algorithmic modifications to SPIHT(IEEE, 2001) Bayazıt, Uluğ; Pearlman, William A.This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3] The modifications exploit universal traits common to the real world images Approximately 1-2 % compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all Of the Proposed modifications into SPIHT.Yayın A bit-serial sum of absolute difference accelerator for variable block size motion estimation of H.264(IEEE, 2009) Fatemi, Mohammad Reza Hosseiny; Ateş, Hasan Fehmi; Salleh, Rosli BinBit-serial architectures offer a number of attractive features over their bit-parallel counterparts such as smaller area cost, lower density interconnection, a reduced number of pins, higher clock frequency, simpler routing and etc. These attractive features make them suitable for using in VLSI design and reduce overall production cost. In this paper, we propose the first least significant bit (LSB) bit-serial sum of absolute difference (SAD) hardware accelerator for integer variable block size motion estimation (VBSME) of H.264. This hardware accelerator is based on a previous state-of-art bit-parallel architecture namely propagate partial SAD. In order to reduce area cost and improve throughput, pixel truncation technique is adopted. Due to the bit-serial pipeline architecture and using small processing elements, our architecture works at much higher clock frequency (at least 4 times) and reduces area cost about 32% compared with its bit-parallel counterpart. The proposed hardware accelerator can be used in different disciplines from low bit rate to high bit rate by making a tradeoff between the degree of parallelism or using fast algorithm or a combination of both.
