{"title":"Linear combination of pulses for coexistence in the IEEE 802.15.4a standard","authors":"S. Erkucuk, B. A. Kaleli","doi":"10.1109/SIU.2009.5136472","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136472","url":null,"abstract":"The low data rate, accurate location-ranging Wireless Personal Area Network (WPAN) standard IEEE 802.15.4a, which is based on ultra-wideband (UWB) impulse radios, suggests using linear combination of pulses to reduce interference to coexisting primary systems. In this paper, we consider possible implementations of linear combination of pulses as suggested in the standard, and study the generated notches in the resulting code spectrum. Using the z-transform approach, we show that the number of these notches is limited and the notch locations are not flexible due to the limited number of pulses allowed by the standard. We also make some suggestions for increasing the number of notches at desired frequencies.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132858882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Ozen, A. Guner, O. Çakir, E. Tugcu, B. Soysal, I. Kaya
{"title":"Experimental performances of blind adaptive equalization algorithms for single carrier real-time WiMAX radio","authors":"A. Ozen, A. Guner, O. Çakir, E. Tugcu, B. Soysal, I. Kaya","doi":"10.1109/SIU.2009.5136435","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136435","url":null,"abstract":"Experimental performances of blind adaptive training algorithms have been evaluated in real-time WiMax (3.5GHz) radio channels in this paper. Inter Symbol Interference (ISI) cancellation and Mean Square Error (MSE) performances of the most commonly used blind equalization techniques, Constant Modulus Algorithm (CMA), and CMA based modified CMA (M-CMA) and normalized CMA (N-CMA) algorithms are investigated in study.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133114562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Regular remeshing of 3D human face models","authors":"Murat Yirci, ilkay Ulusoy","doi":"10.1109/SIU.2009.5136341","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136341","url":null,"abstract":"Three dimesional polygonal models can be classified into three groups as irregular, semi-regular and regular. Regular models have advantages over the semi-regular and irregular ones in terms of efficient processing, memory requirements and rendering. Although most of the polygonal mesh generating methods yield irregular models, these models can be remeshed regularly. In this paper, regular remeshing of three dimensional human face models are studied. These models are commonly used in computer graphics and pattern recongnition.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128906374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Composite method in real time video stabilization","authors":"Serhat Bayrak, ilkay Ulusoy","doi":"10.1109/SIU.2009.5136371","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136371","url":null,"abstract":"Since digital video stabilization completely performs over the images, it requires exhaustive processing power. Therefore, it is less preferred for real-time applications. Global (background) motion estimation in floating video is the most time consuming part of digital video stabilization. In this work, the load of digital motion estimation is reduced by using mechanical motion sensors, thus, it is shown that digital video stabilization can be used for real-time applications.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133787909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"One-class support vector machines based cluster validity in the segmentation of hyperspectral images","authors":"G. Bilgin, S. Erturk, Tulay Yuldirim","doi":"10.1109/SIU.2009.5136522","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136522","url":null,"abstract":"In this paper, a novel cluster validation method based on one-class support vector machines (OC-SVM )is presented. Also it is proposed to segment hyperspectral images with subtractive clustering accompanied by phase correlation. The proposed cluster validity measure is based on the power of spectral discrimination (PWSD) measure and utilizes the advantage of the inherited cluster contour definition feature of OC-SVM. Basically this method provides a solution to the estimation of the correct number of clusters which is an important problem in hyperspectral image segmentation.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115054584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Near field broadband acoustic source localization with observation delay compensated MUSIC algorithm","authors":"S. Cekli, H. A. Curpan","doi":"10.1109/SIU.2009.5136318","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136318","url":null,"abstract":"In this study, a novel algorithm based on the MUSIC algorithm is proposed for the localization of a broadband source in the time domain. The source is in the close range of the randomly distributed sensors. The emitter signal is arrived at the sensors with different amplitudes and phase delays, therefore the received signals at the sensors are the noisy variation of the one another. The data collected by the each sensor are provided from the observations. The measure of the similarity of two sensor data can be attained by calculating the cross correlation of that collected data in the time domain and then the time difference between these two signal can be determined. After this step, one of the sensors is chosen as the reference point and the observation time delays are compensated with reference to the chosen sensor. Finally, the emitter location is estimated efficiently by using the MUSIC algorithm. In addition, the simulation results that supported the performance of the algorithm are given in the paper.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126120400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Trustworthy biometric hashing method","authors":"Ç. Karabat, Hakan Erdogan","doi":"10.1109/SIU.2009.5136333","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136333","url":null,"abstract":"In this paper, we propose a novel biometric hashing method. We employ a password-generated random projection matrix applied to the face images directly instead of applying to the features extracted from face images and improve the methods in the literature. We aim to preserve privacy while achieving desirable accuracy in a biometric verification system. We do the verifiation in the hash domain and ensure irreversibility. In addition, we can get a new hash value by only changing the password which ensures cancelable biometrics property. We achieve zero equal error rate (EER) on Carnegie Mellon University face database. Furthermore, we achieve an EER of 0.0061, even if the attackers compromise the password and the random number generator. Besides, we test robustness of the proposed system against possible degradations due to sensor and environment inperfections. The norm of error is below optimum threshold obtained at EER for all distortions.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"31 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124642445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reception of C4FM and CQPSK signals in APCO Project-25","authors":"H. E. Zorlu, M. Ceven, H. Arslan","doi":"10.1109/SIU.2009.5136503","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136503","url":null,"abstract":"In the first phase of APCO Project-25, Phase-I, the C4FM modulation is defined for the transmission, with a bandwidth of 12.5 kHz. However in Phase-II, CQPSK modulation based transmission is defined with the bandwidth of 6.25 kHz to increase spectral efficiency. This results in a receiver structure in Phase-II, which is capable of demodulating both C4FM and CQPSK signals so that backward compatibility is obtained with Phase-I signals. While this common demodulator facilitates a single receiver structure, on the other hand frequency demodulator based structure becomes unavoidable for CQPSK. In this paper, we propose a complete receiver structure for APCO P-25. The proposed receiver structure consists of four major units; frequency discriminator, frame synchronization, sampling phase and sample clock offset correction, and frequency offset recovery units. This structure is realized in computer environment and BER performances of both modulations are evaluated under various multipath fading channel, sampling clock error, and frequency offset error conditions.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128641759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Truncated gray-coded bit-plane matching based motion estimation and its hardware architecture","authors":"A. Çelebi, O. Akbulut, O. Urhan, S. Erturk","doi":"10.1109/SIU.2009.5136490","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136490","url":null,"abstract":"In this paper, an efficient low bit-depth representation based motion estimation approach which is particularly suitable for low-power mobile devices is proposed. Motion estimation is carried out using bit truncated gray-coded image pixels in the proposed approach. The hardware architecture of the proposed motion estimation method is also designed to show the effectiveness of the proposed approach. It is shown that the proposed approach provides improved motion estimation accuracy compared to the other bit-truncation based approaches. The proposed hardware architecture has low hardware complexity and consumes very low power compared to the 8-bits/pixel based hardware architectures thus, it can be easily integrated to the state of the art video encoders.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extended cooperative balanced space time block coding in wireless networks for spectral efficiency","authors":"A. Eksim, M. Çelebi","doi":"10.1109/SIU.2009.5136489","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136489","url":null,"abstract":"Diversity techniques are very effective tool to increase reception quality. One of the diversity techniques is cooperative balanced space-time block coding which guarantees full diversity for any number of relays. In this work, we extend the cooperative balanced space-time block code family to improve its performance. In the proposed scheme, arbitrary number of codes can be generated to increase the coding gain. In addition to this, the proposed scheme yields better signal-to-noise ratio improvement compared to cooperative balanced space-time block coding and relay selection schemes.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130737730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}