{"title":"A novel biometric hashing method based on optimal linear transformation","authors":"Ç. Karabat, Hakan Erdogan, M. K. Mihçak","doi":"10.1109/SIU.2011.5929678","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929678","url":null,"abstract":"In literature, the most of the biometric hashing methods are based on randomised dimension reduction method. In this work, we propose a novel biometric hashing method based on optimal linear transformation. This optimal linear transformation is based on the within class covariance matrix and is used for dimension reduction in the proposed biometric hashing method. The proposed biometric hashing method can be used as a biometric verification system. The simulation results show that the proposed method has better performance in comparison with the proposed biometric hashing methods in the literature.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121505453","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":"Kapsama katsayisi tabanli kümeleme ile belge özetleme","authors":"Mehmet Çakir, Erbug Çelebi","doi":"10.1109/SIU.2011.5929618","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929618","url":null,"abstract":"Multimedia documents, especially the text documents are occupying an important time in our daily life. Reading the summery of documents will allow us to spend less time and understand the document faster. A sumary consist of the subset sentences of documents and theyneeds to cover the main content of document as a brief.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121712857","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":"Touchless magnetic interaction with mobile devices","authors":"K. Yuksel, Ihsan Kehribar, A. Erçil","doi":"10.1109/SIU.2011.5929806","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929806","url":null,"abstract":"In this paper, we introduce a revolutionary interaction framework that is based on the idea of around device interaction. The proposed method constitutes a touch-less data entry system that is based on the interaction between the magnetic fields around a device and a magnet. The magnetic field that surrounds the device is generated by a magnetic sensor (compass) that is embedded in the new generation of mobile phones. The movements of a permanent magnet in front of the device deforms the sensor's original magnetic field pattern whereby we can constitute a new means of communication between the user and the device. Thus, the magnetic field encompassing the device plays the role of a communication channel and encodes the hand-movement patterns of the user into temporal changes of the sensor's magnetic field. In the back-end of the communication, an engine samples the momentary status of the field during a trial and recognizes the user's pattern by matching it against some pre-recorded templates. The proposed method has been tested in a variety of applications (such as micro-interaction, handwriting recognition, user authentication, etc) and concluded in very promising results.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126361114","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":"On fast ML decoding for high-rate STBCs by dimensionality reduction","authors":"S. Kahraman, M. Çelebi","doi":"10.1109/SIU.2011.5929621","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929621","url":null,"abstract":"In this work, a new fast decoding technique that is based on dimensionality reduction for the search tree is presented for the high-rate space-time block coding. By the use of the proposed technique, the high-rate Golden codes and various WiMAX codes can be efficiently decoded with the optimal ML detection. In the sphere decoding algorithm, 8 dimensional search tree for 2 × 2 Golden code can be separated into 2 semi dependent, 6 dimensional sub trees. For the recommended X4 code in the WiMAX systems, 4 semi dependent, 5 dimensional sub trees can be obtained. By the proposed method, the computational complexity of the sphere decoding can be reduced by about %80 and the speed of the decoding can be increased about 5 times.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126219257","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":"Sparsity-driven spatio-temporal EEG source estimation","authors":"O. Batu, M. Cetin","doi":"10.1109/SIU.2011.5929817","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929817","url":null,"abstract":"We consider the problem of sparse source estimation using multiple time samples. We propose the use of a spatio-temporal constraint which is a combination of spatial ℓ1-norm for sparsity and temporal ℓ2-norm for nonspiky pattern in time. We demonstrate the effectiveness of this spatio-temporal method through experiments based on both simulated and human EEG data.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125987088","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}
M. Sayıt, Sercan Demirci, Yagiz Kaymak, Hasan Bulut, E. T. Tunali
{"title":"Multicast tree based video streaming application over planetlab","authors":"M. Sayıt, Sercan Demirci, Yagiz Kaymak, Hasan Bulut, E. T. Tunali","doi":"10.1109/SIU.2011.5929654","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929654","url":null,"abstract":"In this paper, a video streaming system running on multicast tree for peer to peer networks is presented and dynamic tree maintenance algorithm against node failures during streaming session is proposed. The proposed algorithm is tested on nodes existing in different countries over the Internet in Planetlab. The obtained results show that proposed algorithm can be used in latency sensitive live video streaming applications running on peer to peer networks.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125999383","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":"Error performance analysis of cooperative systems with receiver diversity: Effect of shadowing in source-destination link","authors":"Yasemin Sitti, I. Altunbas","doi":"10.1109/SIU.2011.5929692","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929692","url":null,"abstract":"In this paper, a cooperative system with more than one receive antenna at relay and destination is considered. Amplify and forward method is used at the relay and maximal ratio combiners are employed at the receivers. It is assumed that source-relay and relay-destination channels have Nakagami-m fading and source-destination channels have composite shadowing/fading modeled by Generalized-K distribution. The bit error performance of the system under consideration is analyzed based on the moment generating function technique and the analytical results are verified by computer simulations.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121939178","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":"Increasing the recognition performance in single image per person problem: Combined common feature subspace","authors":"Meltem Apaydin","doi":"10.1109/SIU.2011.5929645","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929645","url":null,"abstract":"The recognition performances of many common techniques system with single image can be needed. It is important to have high recognition performances even in these situations. In this paper, a study to increase the recognition performance of Singular Value Decomposition (SVD) based Common Matrix (CM) method, proposed to recognize when the training set has single image, is done. In this study, Combined Common Subspace Method which combines both global and local features of the face is used. The global features are obtained from the whole face image, while local features are obtained from eyes, nose and mouth. The experiments performed on the Ar-Face database show that using the combined common subspace in the SVD based Common Matrix method increases the recognition performance. This increment especially occurs more significantly in the databases containing facial expression differences more significantly.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122277159","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":"Spectrum sensing based on cyclostationary feature detection for cognitive radios with multiple antennas","authors":"Refik Fatih Ustok, B. Ozbek","doi":"10.1109/SIU.2011.5929709","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929709","url":null,"abstract":"Cognitive radios aim to implement dynamic frequency usage which is proposed to increase the efficiency of the spectrum and can sense their environment, detect the idle bands and then allocate the secondary users into the detected idle bands without any interference to primary users' communications. Cyclostationary Feature Detection is one of the commonly used methods in the literature for spectrum sensing. This paper focuses on sensing the idle bands using cyclostationary feature detection method in Cognitive Radio based systems. The performance is improved by using the proposed multiple antenna technique and the simulation results are analyzed.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"57 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121438873","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":"Audio diarization for turkish broadcast news transcription","authors":"Oguz Yilmaz, M. Saraçlar","doi":"10.1109/SIU.2011.5929666","DOIUrl":"https://doi.org/10.1109/SIU.2011.5929666","url":null,"abstract":"In this study, speaker independent acoustic models are adapted for each detected speaker using the output of an audio diarization system. It is observed in the experiments that the word error rate for speech recognition is significantly reduced when speaker adaptation is performed. Also, a new speech source separation algorithm is proposed in order to detect overlapping speech segments. It is shown experimentally that the proposed algorithm yields lower diarization error rates than the case when no speech source separation is applied.","PeriodicalId":114797,"journal":{"name":"2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131337602","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}