Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659745
O. Kucur, S. Dilek, V. Kumbasar, M. Dogan
In this paper, we analyze the bit error rate performance of multi-processing gain (MPG) code division multiple access (CDMA) for deterministic spreading sequences over an asynchronous additive white Gaussian noise channel. Performances of Gold, Hadamard sequences are compared to that of random sequences. Results show that random code assumption is not realistic for MPG-CDMA since its performance differs a lot from those of deterministic ones
{"title":"Performance of Multi-Processing Gain CDMA for Deterministic Spreading Sequences","authors":"O. Kucur, S. Dilek, V. Kumbasar, M. Dogan","doi":"10.1109/SIU.2006.1659745","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659745","url":null,"abstract":"In this paper, we analyze the bit error rate performance of multi-processing gain (MPG) code division multiple access (CDMA) for deterministic spreading sequences over an asynchronous additive white Gaussian noise channel. Performances of Gold, Hadamard sequences are compared to that of random sequences. Results show that random code assumption is not realistic for MPG-CDMA since its performance differs a lot from those of deterministic ones","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121778536","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659884
A. Irci, A. Saranli, B. Baykal
Recent studies have focused on the problem of resource allocation in systems in which multiple applications contend for multiple resources in order to satisfy their application level requirements. Q-RAM assumes a system with multiple concurrent applications, each of which can operate at different levels of quality based on the system resources available to it. The goal of the model is to be able to allocate resources to the various applications such that the overall system utility is maximized under the constraint that each application can meet its minimum needs. However, Kuhn-Tucker optimality conditions are not satisfied at the result of the Q-RAM approach, which is based on Kuhn-Tucker conditions. In this work Q-RAM approach is modified and a new algorithm is proposed. Results of the modified Q-RAM algorithm (MQ-RAM) satisfy the Kuhn-Tucker optimality conditions. The performance of the MQ-RAM algorithm is compared with that of Zoutendijk algorithm. A simplified radar optimization problem is solved by proposed optimization approach
{"title":"A Real-Time Optimal Resource Allocation Approach in a Radar System","authors":"A. Irci, A. Saranli, B. Baykal","doi":"10.1109/SIU.2006.1659884","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659884","url":null,"abstract":"Recent studies have focused on the problem of resource allocation in systems in which multiple applications contend for multiple resources in order to satisfy their application level requirements. Q-RAM assumes a system with multiple concurrent applications, each of which can operate at different levels of quality based on the system resources available to it. The goal of the model is to be able to allocate resources to the various applications such that the overall system utility is maximized under the constraint that each application can meet its minimum needs. However, Kuhn-Tucker optimality conditions are not satisfied at the result of the Q-RAM approach, which is based on Kuhn-Tucker conditions. In this work Q-RAM approach is modified and a new algorithm is proposed. Results of the modified Q-RAM algorithm (MQ-RAM) satisfy the Kuhn-Tucker optimality conditions. The performance of the MQ-RAM algorithm is compared with that of Zoutendijk algorithm. A simplified radar optimization problem is solved by proposed optimization approach","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133920472","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659861
H. Ocak, H. Ertunc, K. Loparo
In this work, a new method was developed based on wavelet packet decomposition and hidden Markov modeling (HMM) for monitoring bearing faults. In this new scheme, vibration signals were decomposed into wavelet packets and the node energies of the decomposition were used as features. An HMM was built to model the normal bearing operating condition based on the features extracted from normal bearing vibration signals. The probabilities of this HMM were then used to monitor the bearing condition. Experimental data collected from a bearing accelerated life test clearly showed this new method's superiority over classical methods
{"title":"Online Tracking of Bearing Wear using Wavelet Packet Transform and Hidden Markov Models","authors":"H. Ocak, H. Ertunc, K. Loparo","doi":"10.1109/SIU.2006.1659861","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659861","url":null,"abstract":"In this work, a new method was developed based on wavelet packet decomposition and hidden Markov modeling (HMM) for monitoring bearing faults. In this new scheme, vibration signals were decomposed into wavelet packets and the node energies of the decomposition were used as features. An HMM was built to model the normal bearing operating condition based on the features extracted from normal bearing vibration signals. The probabilities of this HMM were then used to monitor the bearing condition. Experimental data collected from a bearing accelerated life test clearly showed this new method's superiority over classical methods","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133922217","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}
We describe a system for recognizing online, handwritten mathematical expressions, together with a user-interface for writing scientific articles. A neural network recognizes strokes and a recursive algorithm parses the expression by combining neural network output and the structure of the expression. The interface associated with the proposed system integrates the built-in recognition capabilities of the Microsoft's Tablet PC API for recognizing textual input and supports conversion of hand-drawn figures into PNG format. This enables the user to enter text, mathematics and draw figures in a single interface. After recognition, all output is combined into one LATEX code and compiled into a PDF file
{"title":"Online Handwritten Mathematical Expression Recognition","authors":"Hakan Büyükbayrak, B. Yanikoglu, A. Erçil","doi":"10.1117/12.704043","DOIUrl":"https://doi.org/10.1117/12.704043","url":null,"abstract":"We describe a system for recognizing online, handwritten mathematical expressions, together with a user-interface for writing scientific articles. A neural network recognizes strokes and a recursive algorithm parses the expression by combining neural network output and the structure of the expression. The interface associated with the proposed system integrates the built-in recognition capabilities of the Microsoft's Tablet PC API for recognizing textual input and supports conversion of hand-drawn figures into PNG format. This enables the user to enter text, mathematics and draw figures in a single interface. After recognition, all output is combined into one LATEX code and compiled into a PDF file","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132922461","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659756
H. Ekmel Ercan, R. Arslanalp, M. Alçı, A. T. Tola
In this study, a current mode class AB differential type oscillator has been synthesized in the log domain. Varying the values of current sources of the circuit, the oscillation frequency of the circuit can be tuned electronically. While the bias currents of transistors are between 10 muA and 40 muA, the oscillation frequencies of the circuit are within 500 kHz-2 MHz. The circuit was simulated in PSpice for both idealized transistor models and CBIC-R transistors. THD analysis was also carried out. The results are discussed
{"title":"Electronically Tunable Class AB Differential Type Log Domain Oscillator","authors":"H. Ekmel Ercan, R. Arslanalp, M. Alçı, A. T. Tola","doi":"10.1109/SIU.2006.1659756","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659756","url":null,"abstract":"In this study, a current mode class AB differential type oscillator has been synthesized in the log domain. Varying the values of current sources of the circuit, the oscillation frequency of the circuit can be tuned electronically. While the bias currents of transistors are between 10 muA and 40 muA, the oscillation frequencies of the circuit are within 500 kHz-2 MHz. The circuit was simulated in PSpice for both idealized transistor models and CBIC-R transistors. THD analysis was also carried out. The results are discussed","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132673116","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659909
S. Bayraktar, U. Gudukbay, B. Ozguc
Simulating every day phenomena such as fluid, rigid objects, or cloth and their interaction has been a challenge for the computer graphics community for decades. In this article techniques to model such interactions are explained briefly and some of the result of applying these techniques are presented
{"title":"Modeling Interaction of Fluid, Fabric, and Rigid Objects for Computer Graphics","authors":"S. Bayraktar, U. Gudukbay, B. Ozguc","doi":"10.1109/SIU.2006.1659909","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659909","url":null,"abstract":"Simulating every day phenomena such as fluid, rigid objects, or cloth and their interaction has been a challenge for the computer graphics community for decades. In this article techniques to model such interactions are explained briefly and some of the result of applying these techniques are presented","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133255530","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659885
G. Soysal, M. Efe
In this paper, an adaptive Kalman filter is presented. The proposed filter calculates the process noise covariance which determines the tracking ability of the Kalman filter at every update time. Thus, the filter becomes sensitive to variations in the the target motion. In the filter, process noise covariance is updated at every sampling interval according to a predetermined relationship between the innovation covariance of the Kalman filter and available data form the measurements. Then state estimation and state estimation covariance are updated using the new process noise covariance. Tracking performance of the proposed algorithm has been compared to the Interactive multiple model filter through simulations
{"title":"An Adaptive Kalman Filter For Tracking Maneuvering Targets","authors":"G. Soysal, M. Efe","doi":"10.1109/SIU.2006.1659885","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659885","url":null,"abstract":"In this paper, an adaptive Kalman filter is presented. The proposed filter calculates the process noise covariance which determines the tracking ability of the Kalman filter at every update time. Thus, the filter becomes sensitive to variations in the the target motion. In the filter, process noise covariance is updated at every sampling interval according to a predetermined relationship between the innovation covariance of the Kalman filter and available data form the measurements. Then state estimation and state estimation covariance are updated using the new process noise covariance. Tracking performance of the proposed algorithm has been compared to the Interactive multiple model filter through simulations","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131697805","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659790
G. Cambul, M.R. Sahin, M. Karshgil
In this study, a fall detection system with real time video tracking is implemented to be used where people must be in continuous supervision. Automatic detection of a falling person from a video image is an important problem especially in security and safety applications such as supportive home environments and closed surveillance systems. In this work, first human motion is detected in videos and then tracked. The approach presented here is different from other approaches in the literature. In our work, images grabbed from a continuous video source are stored and if no motion is detected, previously stored still images are evaluated to decide whether the "no motion" condition is a result of a fall
{"title":"Automatic Fall Detection in Real Time Video Based Applications","authors":"G. Cambul, M.R. Sahin, M. Karshgil","doi":"10.1109/SIU.2006.1659790","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659790","url":null,"abstract":"In this study, a fall detection system with real time video tracking is implemented to be used where people must be in continuous supervision. Automatic detection of a falling person from a video image is an important problem especially in security and safety applications such as supportive home environments and closed surveillance systems. In this work, first human motion is detected in videos and then tracked. The approach presented here is different from other approaches in the literature. In our work, images grabbed from a continuous video source are stored and if no motion is detected, previously stored still images are evaluated to decide whether the \"no motion\" condition is a result of a fall","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127322645","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659850
V. Nabiyev
In this study, hand structure and hand geometry, which are the biometric properties are investigated to verify the identity of a person. As a fundamental feature, palm print is used in the verification. Some classifications based on the topology and the convex hull of four lines in palm, are done. Recognition is performed with an intuitive approach, in which every properly has a weight, by comparing the image of the palm print with the data in database. 98% of the tests, based on 400 data requiring having the left and right hand properties, resulted in success
{"title":"Intuitive Approach In Biometric Recognition According to Hand Geometry and Palmprint","authors":"V. Nabiyev","doi":"10.1109/SIU.2006.1659850","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659850","url":null,"abstract":"In this study, hand structure and hand geometry, which are the biometric properties are investigated to verify the identity of a person. As a fundamental feature, palm print is used in the verification. Some classifications based on the topology and the convex hull of four lines in palm, are done. Recognition is performed with an intuitive approach, in which every properly has a weight, by comparing the image of the palm print with the data in database. 98% of the tests, based on 400 data requiring having the left and right hand properties, resulted in success","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127422380","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}
Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659870
T. Oktem, A. Erdogan
In this paper we introduce fast paraunitary matrix obtaining approaches to be used for the blind deconvolution of all blindly equalizable, frequency selective MIMO (multiple-input multiple-output) systems. The main purpose for offering these approaches is to extend various instantaneous blind source separation (BSS) approaches to handle the convolutive BSS case. It was aimed that the offered algorithms have fast convergence properties and low computational complexities so that they can be realized real-time in the communication systems having high sampling rates. These adaptive algorithms which were developed according to the gradient search on specific sets, were compared to the afore introduced alternating projections algorithm in terms of speed and computational complexity
{"title":"Adaptive Paraunitary Filter Methods For The Blind Equalization of Frequency Selective Multiple-Input Multiple-Output Channels","authors":"T. Oktem, A. Erdogan","doi":"10.1109/SIU.2006.1659870","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659870","url":null,"abstract":"In this paper we introduce fast paraunitary matrix obtaining approaches to be used for the blind deconvolution of all blindly equalizable, frequency selective MIMO (multiple-input multiple-output) systems. The main purpose for offering these approaches is to extend various instantaneous blind source separation (BSS) approaches to handle the convolutive BSS case. It was aimed that the offered algorithms have fast convergence properties and low computational complexities so that they can be realized real-time in the communication systems having high sampling rates. These adaptive algorithms which were developed according to the gradient search on specific sets, were compared to the afore introduced alternating projections algorithm in terms of speed and computational complexity","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115381324","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}