{"title":"Depth based 3D sharpness and contrast enhancement application on stereo images","authors":"Burak Govem, M. Sayinta, Eren Somcag, F. Donmez","doi":"10.1109/SIU.2013.6531555","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531555","url":null,"abstract":"In this paper, a depth based sharpness and contrast enhancement algorithm on 3D video is mentioned and implementation of this algorithm on Xilinx Spartan6 FPGAs is presented. Sharpness&contrast enhancement algorithms are ubiquitous on 2D video post-processing systems. This algorithm enhances the 3D perception by adjusting sharpness and contrast using the disparity of the objects extracted from 3D video, working with the luminance component of the image. Algorithm is implemented on a Xilinx Spartan 6 xc6slx75 chip. Resource usage and performance of the implementation are presented.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"68 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124281984","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":"Analysis of FPGA based recursive and non-recursive digital filters according to hardware cost and performance","authors":"Mehmet Burak Aykenar","doi":"10.1109/SIU.2013.6531474","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531474","url":null,"abstract":"Digital filters are classified into two types: Finite impulse response (FIR) and infinite impulse response (IIR) filters according to their impulse response types. FIR filters are called as non-recursive filters since the output signal is dependent only on the input signal; whereas, IIR filters are called as recursive filters since the output signal is dependent both on the input and output signals. Although for given specifications, usually both FIR and IIR filter designs can be used, different approaches and problems arise for implementation of these methods on hardware. In this work, the problems which occurred during FPGA implementation of FIR and IIR filters are examined and the comparison of the two design methods is done by analyzing the hardware cost and performance.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116654300","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":"Impact of limiting of hop count on lifetime of wireless sensor networks","authors":"Murat Temiz, B. Tavlı","doi":"10.1109/SIU.2013.6531468","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531468","url":null,"abstract":"A wireless sensor network (WSN) comprised of a plurality of sensor nodes powered by their internal batteries and one or more base stations. Efficient utilization of the energy resources leads to prolonged network lifetime. In this study, the effects of limiting the total hop count within the network on network lifetime is investigated by using a mixed integer programming (MIP) framework. Our results show that when the hop count of network is limited by minimum hop count, lifetime of network can decrease by %40 of the lifetime obtained without any constraint on hop count. If hop count limit of network is increased by %10, lifetime of network can reach %98 of maximum lifetime obtained without any restrictions on hop count.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116697539","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":"Compressive sensing based target detection in delay-Doppler radars","authors":"Oguzhan Teke, O. Arikan, A. Gürbüz","doi":"10.1109/SIU.2013.6531496","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531496","url":null,"abstract":"Compressive Sensing theory shows that, a sparse signal can be reconstructed from its sub-Nyquist rate random samples. With this property, CS approach has many applications. Radar systems, which deal with sparse signal due to its nature, is one of the important application of CS theory. Even if CS approach is suitable for radar systems, classical detections schemes under Neyman-Pearson formulations may result high probability of false alarm, when CS approach is used, especially if the target has off-grid parameters. In this study, a new detection scheme which enables CS techniques to be used in radar systems is investigated.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125192557","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":"Performance analysis of classification models for medical diagnostic decision support systems","authors":"Esref Segmen, A. Uyar","doi":"10.1109/SIU.2013.6531316","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531316","url":null,"abstract":"As a part of electronic healthcare systems, medical diagnostic decision support systems have been more popular in clinical routine. It is critical to decide the best model to provide reliable machine learning based decision support in diagnostic problems. In this study, the performance of common classification algorithms have been comparatively evaluated using public medical datasets. The experimental results reveal that, although there is no single best algorithm for all datasets, MLP and Naive Bayes methods have provided relatively higher success rates.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125806696","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":"Distributed CoMP set selection for heterogenous networks","authors":"I. Bahceci","doi":"10.1109/SIU.2013.6531390","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531390","url":null,"abstract":"Cooperative MultiPoint mode of operation in 4G cellular networks can be employed to enable the cooperation between access points for improving the quality of service level for low capacity users. To benefit from CoMP operation, the network has to determine (i) the users (UEs) to be supported by CoMP mode, and (ii) the set of CoMP access points for each CoMP UE. In this paper, we propose a distributed CoMP set selection scheme for cellular heterogenous networks (HetNets) where each access point can exchange information only with their neighbors. Therefore, any CoMP decision at an access point is based on the feedback information from the neighbor stations. The message sent to a neighbor station include information related to the UEs for which cooperation is requested from that station. Upon the exchange of CoMP request messages, by combining the local information and the information from the CoMP messages, each station evaluates the potential gains for each UE due to CoMP operation and performs a final decision on the requests originated from itself and its neighbor stations. Simulation indicate that both coverage gain and throughput gains can be obtain by the proposed distributed scheme.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126599154","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. M. Yagci, Ertunç Erdil, Ali Ozgur Argunsah, D. Ünay, M. Çetin, L. Akarun, F. Gürgen
{"title":"Biomedical image time series registration with particle filtering","authors":"A. M. Yagci, Ertunç Erdil, Ali Ozgur Argunsah, D. Ünay, M. Çetin, L. Akarun, F. Gürgen","doi":"10.1109/SIU.2013.6531501","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531501","url":null,"abstract":"We propose a family of methods for biomedical image time series registration based on Particle filtering. The first method applies an intensity-based information-theoretic approach to calculate importance weights. An effective second group of methods use landmark-based approaches for the same purpose by automatically detecting intensity maxima or SIFT interest points from image time series. A brute-force search for the best alignment usually produces good results with proper cost functions, but becomes computationally expensive if the whole search space is explored. Hill climbing optimizations seek local optima. Particle filtering avoids local solutions by introducing randomness and sequentially updating the posterior distribution representing probable solutions. Thus, it can be more robust for the registration of image time series. We show promising preliminary results on dendrite image time series.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"491 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116543451","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":"Ground Plane Detection using Kinect sensor","authors":"Dogan Kircali, F. Tek, Ibrahim K. Iyidir","doi":"10.1109/SIU.2013.6531356","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531356","url":null,"abstract":"Ground plane detection is essential for successful navigation of vision based mobile robots. We introduce a novel and robust ground plane detection algorithm using depth information acquired by a Kinect sensor. Unlike similar methods from the literature, we do not assume that the ground plane covers the largest area in the scene. Furthermore our algorithm handles two different conditions: fixed and changing view angle of the sensor. We show that the algorithm is robust if the view angle is fixed whereas an additional procedure handles different view angles satisfactorily.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122426687","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":"Frequency characteristics of DoS and DDoS attacks","authors":"R. Fouladi, Tina Seifpoor, E. Anarim","doi":"10.1109/SIU.2013.6531200","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531200","url":null,"abstract":"Denial of Service (DoS) and Distributed Denial of service (DDoS) attacks are common place in today's computer networks. There are different types of attacks among which Flood based attacks are the major ones. Attacks detection mechanisms usually rely on statistical information of the traffic. As regards of the fact that statistical properties of DoS and DDoS attacks are very similar to those in legitimate traffics, in this paper we characterize the frequency domain of denial of service attacks instead of time domain. We consider the number of packets arriving to the node of victim as a random process which is acquired by sampling the packets number every 1 milli-second. Having created the process we find the normalized spectrum of the sampled data. The results show that the main energy of DoS and DDoS attacks are distributed in high and low frequencies respectively while energy is spread evenly through all range of frequencies in Normal TCP traffic.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129922190","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":"Performance analysis of spatially coupled codes over the correlated erasure channel","authors":"Reza A. Ashrafi, A. E. Pusane","doi":"10.1109/SIU.2013.6531268","DOIUrl":"https://doi.org/10.1109/SIU.2013.6531268","url":null,"abstract":"Desirable characteristics of spatially-coupled low-density parity-check (LDPC) codes including low implementation complexity, low-delay, and close-to-optimal performance over a wide variety of channels make them a noticeable candidate for the next-generation wireless communication standards. However, error performance of the sliding window decoding scheme used to decode these codes is considerably degraded over channels with memory, such as the burst erasure channel. Traditionally, communication over channels with memory is achieved through the use of block interleavers but as it introduces a large amount of delay, it is not always a viable option. In this paper, employing a convolutional interleaver which benefits from the inherent convolutional nature of the spatially-coupled codes with very low overall delay is considered. The performance of the proposed combination is analyzed using the density evolution technique. The performance improvement of using a convolutional inter-leaver is demonstrated as a function of the added interleaving delay in terms of iterative decoding thresholds.","PeriodicalId":168462,"journal":{"name":"2013 21st Signal Processing and Communications Applications Conference (SIU)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647575","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}