5 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 5 / 5
Yayın EEG signal compression based on classified signature and envelope vector sets(Wiley, 2009-03) 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 process of the classified signature and envelope vector sets (CSEVS), which employs an effective k-means clustering algorithm. It is assumed that both the transmitter and the receiver units have the same CSEVS. In this work, on a frame basis, EEG signals are modeled by multiplying only three factors called as classified signature vector, classified envelope vector, and gain coefficient (GC), respectively. In other words, every frame of an EEG signal is represented by two indices R and K of CSEVS and the GC. EEG signals are reconstructed frame by frame using these numbers in the receiver unit by employing the CSEVS. The proposed method is evaluated by using some evaluation metrics that are commonly used in this area such as root-mean-square error, percentage root-mean-square difference, and measuring with visual inspection. The performance of the proposed method is also compared with the other methods. It is observed that the proposed method achieves high compression ratios with low-level reconstruction error while preserving diagnostic information in the reconstructed EEG signal.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 Predictive vector quantization of 3-D mesh geometry by representation of vertices in local coordinate systems(Elsevier Inc, 2007-08) Bayazıt, Uluğ; Orcay, Özgür; Konur, Umut; Gürgen, Sadık FikretIn predictive 3-D mesh geometry coding, the position of each vertex is predicted from the previously coded neighboring vertices and the resultant prediction error vectors are coded. In this work, the prediction error vectors are represented in a local coordinate system in order to cluster them around a subset of a 2-D planar subspace and thereby increase block coding efficiency. Alphabet entropy constrained vector quantization (AECVQ) of Rao and Pearlman is preferred to the previously employed minimum distortion vector quatitization (MDVQ) for block coding the prediction error vectors with high coding efficiency and low implementation complexity. Estimation and compensation of the bias in the parallelogram prediction rule and partial adaptation of the AECVQ codebook to the encoded vector source by normalization using source statistics, are the other salient features of the proposed coding system. Experimental results verify the advantage of the use of the local coordinate system over the global one. The visual error of the proposed coding system is lower than the predictive coding method of Touma and Gotsman especially at low rates, and lower than the spectral coding method of Karni and Gotsman at medium-to-high rates.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 Significance map pruning and other enhancements to SPIHT image coding algorithm(Elsevier Science, 2003-10) Bayazıt, UluğThis paper proposes several enhancements to the Set Partitioning in Hierarchical Trees (SPIHT) image coding algorithm without changing the original algorithm's general skeleton. First and foremost, a method for significance map pruning based on a rate-distortion criterion is introduced. Specifically, the (Type A) sets of wavelet coefficients with small ratios of estimated distortion reduction to estimated rate contribution are deemed insignificant and effectively pruned. Even though determining such sets requires the computational complexity of the encoder to increase considerably with respect to the original SPIHT encoder, the original SPIHT decoder may still be used to decode the generated bitstream with a low computational complexity. The paper also proposes three low complexity enhancements by more sophisticated use of the adaptive arithmetic coder. Simulation results demonstrate that all these enhancements yield modest compression gains at moderate to high rates.
