{"title":"Real-Time Ischemic Beat Classification Using Backpropagation Neural Network","authors":"M. Mohebbi, H. Moghadam","doi":"10.1109/SIU.2007.4298792","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298792","url":null,"abstract":"This paper explains an adaptive backpropagation neural network (NN) for the detection of ischemic beats in electrocardiogram (ECG) recordings. The proposed method consists of a preprocessing stage for QRS detection, baseline wandering removal, and noise suppression. In this stage ST segments are extracted. In the next stage, the pattern length is reduced and subtracted from the normal template. In the third stage the extracted patterns are used for training a neural network and ischemic beats are detected. The algorithm used to train the NN is an adaptive backpropagation algorithm. An adaptive algorithm attempts to keep the learning step size as large as possible while keeping learning stable and then reduces the learning time. To evaluate the methodology, a cardiac beat dataset is constructed using several recordings of the European Society of Cardiology ST-T database. Our results were high both in sensitivity and positive predictivity. Specially, the obtained sensitivity and positive predictivity were 97.22% and 97.44%, respectively. These results are better than other any previously reported ones.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133392488","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":"Downsampling Based Multiple Description Coding with Optimal Reconstruction Filters","authors":"Y. Yapici, B. Demir, S.E. ve Oguzhan Urhan","doi":"10.1109/SIU.2007.4298731","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298731","url":null,"abstract":"In this paper, a multiple description image coding scheme is proposed to facilitate the transmission of images over media with possible packet loss. The proposed method is based on finding the optimal reconstruction filter coefficients that will be used to combine the multiple descriptions, based on least squares minimization. Firstly, the original image is down sampled and each sub-image is coded using standard JPEG. These decoded images are then mapped to the original image size using the optimal filters. Multiple descriptions consist of coded down sampled images and the corresponding optimal reconstruction filter coefficients. It is shown that the proposed method gives superior results compared with standard interpolation filters (i.e .bicubic and bilinear).","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134057745","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":"A Local Binary Patterns and Shape Priors Based Texture Segmentation Method","authors":"Erkin Tekeli, M. Çetin, A. Erçil","doi":"10.1109/SIU.2007.4298755","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298755","url":null,"abstract":"We propose a shape and data driven texture segmentation method using local binary patterns (LBP) and active contours. In particular, we pass textured images through a new LBP-based filter, which produces non-textured images. In this \"filtered\" domain each textured region of the original image exhibits a characteristic intensity distribution. In this domain we pose the segmentation problem as an optimization problem in a Bayesian framework. The cost functional contains a data-driven term, as well as a term that brings in information about the shapes of the objects to be segmented. We solve the optimization problem using level set-based active contours. Our experimental results on synthetic and real textures demonstrate the effectiveness of our approach in segmenting challenging textures as well as its robustness to missing data and occlusions.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"28 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114033410","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":"Rate-Distortion Guided Piecewise Planar 3D Scene Representation","authors":"E. Imre, A. Alatan, U. Gudukbay","doi":"10.1109/SIU.2007.4298837","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298837","url":null,"abstract":"This paper proposes a novel 3D piecewise planar reconstruction algorithm, which utilizes the statistical error between a particular frame and its prediction to refine a coarse 3D piecewise planar representation. The algorithm aims utilization of 3D scene geometry to remove the visual redundancy between frame pairs in any predictive coding scheme. This approach associates the rate increase with the quality of representation for determining an efficient description for a given budget. The preliminary experiments on synthetic and real data indicate the validity of the rate-distortion based approach.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115364930","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":"HMM Based Method for Dynamic Texture Detection","authors":"B. U. Toreyin, A. Cetin","doi":"10.1109/SIU.2007.4298714","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298714","url":null,"abstract":"A method for detection of dynamic textures in video is proposed. It is observed that the motion vectors of most of the dynamic textures (e.g. sea waves, swaying tree leaves and branches in the wind, etc.) exhibit random motion. On the other hand, regular motion of ordinary video objects has well-defined directions. In this paper, motion vectors of moving objects are estimated and tracked based on a minimum distance based metric. The direction of the motion vectors are then quantized to define two three-state Markov models corresponding to dynamic textures and ordinary moving objects with consistent directions. Hidden Markov models (HMMs) are used to classify the moving objects in the final step of the algorithm.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177821","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":"Iterative Super Resolution Reconstruction from Multiple Images Using Cluster Computers","authors":"N. Adar, E. Seke, C. Kandemir, K. Ozkan","doi":"10.1109/SIU.2007.4298775","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298775","url":null,"abstract":"Image processing applications, although not very obvious to be easily noticed, find their way into our daily life in almost every field. Many military, medical and commercial applications aim for high resolution images, however the resolution of the image sensors continue to be main limiting obstacle in front. The solution is to develop techniques for creation of a singe high resolution and high quality picture using multiple low resolution images. In order to achieve high performance, the proposed technique that outputs a high resolution images using predetermined number of low resolution images is implemented on cluster computers. It is shown that proposed parallel algorithm is reduced the overall serial execution time by the number of processor.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114747226","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":"EM-based Joint Data Detection and Channel Estimation for Uplink MC-CDMA Systems over Frequency Selective Channels","authors":"H. Dogan, E. Panayirci, H. A. Çırpan, B. Fleury","doi":"10.1109/SIU.2007.4298802","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298802","url":null,"abstract":"This paper is concerned with joint channel estimation and data detection for uplink multicarrier code-division multiple-access (MC-CDMA) systems in the presence of frequency fading channel. The detection and estimation algorithm, implemented at the receiver, is based on a version of the expectation maximization (EM) technique which is very suitable for the multicarrier signal formats. Application of the EM-based algorithm to the problem of iterative data detection and channel estimation leads to a receiver structure that also incorporates a partial interference cancellation. Computer simulations show that the proposed algorithm has excellent BER end estimation performance.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115511679","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":"Asynchronous Particular Swarm Optimization","authors":"M. Ordukaya","doi":"10.1109/SIU.2007.4298807","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298807","url":null,"abstract":"In this paper.we present particle swarm optimization based on asynchronous algorithms for a multi-agent swarm.We study generalized PSO algoritm with two schemes called global best (gbest) and local best (lbest).We apply these two schemes to our multimodel function.Generally PSO is performed with synchronous algorithms.Our corparative study indicates that PSO modelled with asynchronous algorithm converges to a real desired value as synchronous models.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115529240","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":"A New Approach for Classification of EEG Signals","authors":"G. Tezel, Y. Ozbay","doi":"10.1109/SIU.2007.4298603","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298603","url":null,"abstract":"This study presents a comparative study of the classification accuracy and speed of performance of epileptic Electroensefalogram (EEG) signals using a traditional neural network architecture based on backpropagation training algorithm, and a new neural network. The proposed network is called adaptive neural network with activation function (AAF-NN) in which adjustable parameters, It is used two different activation functions for developed study. One of theese adaptive activation functions is sigmoid function with free parameters and the other one is sum of sinusoidal function with free parameters and sigmoid function with free parameters. The adaptive activation function with free parameters is used in the hidden layer for the proposed structures based on the feed-forward neural network Experimental results have revealed that neural network with adaptive activation function is more suitable for classification EEG signals and training speed is much faster than traditional neural network with fixed sigmoid activation function.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123367562","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":"Measurement Strategies for Input Estimation in Linear Systems","authors":"Ayça Ozçelikkale, H. Ozaktas, E. Ankan","doi":"10.1109/SIU.2007.4298562","DOIUrl":"https://doi.org/10.1109/SIU.2007.4298562","url":null,"abstract":"In this work, we present a mathematical approach for some of the measurement problems arising in optics, which is also applicable to other contexts. We see the measurement problem as the problem of determining the best measurement strategy to estimate an unknown stochastic process by noisy measurements. The number of measurement devices, their positions and qualities characterize the measurement strategies. The model we use also includes a cost function based on resolving powers of sensors. We are unable to offer a solution to this problem in such generality; but for the metrical problem in which the number and locations of the measurement devices are fixed, we present an efficient numerical approach.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121407972","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}