{"title":"Real-time sign language recognition based on neural network architecture","authors":"P. Mekala, Ying Gao, Jeffrey Fan, A. Davari","doi":"10.1109/SSST.2011.5753805","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753805","url":null,"abstract":"In real-time, it is highly essential to have an autonomous translator that can process the images and recognize the signs very fast at the speed of streaming images. In this paper, architecture is being proposed using the neural networks identification and tracking to translate the sign language to a voice/text format. Introduction of Point of Interest (POI) and track point provides novelty and reduces the storage memory requirement.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122377063","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":"Optimum tracking of nonlinear-model predictive control for Boost based PFC rectifier","authors":"M. Abedi, B. Song, B. Ernzen","doi":"10.1109/SSST.2011.5753782","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753782","url":null,"abstract":"In this paper a tracking problem for a single-phase PFC rectifier exploiting the Boost converter as nonlinear system using model predictive control (MPC) is discussed. After approximation of the tracking error in the receding horizon by its Taylor-series expansion to any specified order, an analytic solution to the MPC is developed and a closed-form nonlinear predictive controller is presented. The main advantage of the proposed digital control PFC method is that unity power factor can be achieved over wide input voltage and load current range. Boost PFC topology with NMPC shows better and more accurate performance in both steady state and transient state than linear control methods. Simulation results demonstrate the effectiveness of the proposed NMPC.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129899622","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":"The Poisson process and associated probability distributions on time scales","authors":"D. Poulsen, Michael Z. Spivey, R. Marks","doi":"10.1109/SSST.2011.5753775","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753775","url":null,"abstract":"Duals of probability distributions on continuous (R) domains exist on discrete (Z) domains. The Poisson distribution on R, for example, manifests itself as a binomial distribution on Z. Time scales are a domain generalization in which R and Z are special cases. We formulate a generalized Poisson process on an arbitrary time scale and show that the conventional Poisson distribution on R and binomial distribution on Z are special cases. The waiting times of the generalized Poisson process are used to derive the Erlang distribution on a time scale and, in particular, the exponential distribution on a time scale. The memoryless property of the exponential distribution on R is well known. We find conditions on the time scale which preserve the memorylessness property in the generalized case.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126200652","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":"Modeling the effects of hard undulating surfaces on outdoor noise using equivalent sources","authors":"Meng Vang, M. Bikdash","doi":"10.1109/SSST.2011.5753803","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753803","url":null,"abstract":"The attentuation of acoustic waves propagating above hard surfaces over long distances depends on the shape of the surface. Therefore, the landscape shape is a factor in combating outdoor noise. It is well known that the effect of a hard flat surface can be modeled using two sources: the main source which is located above the surface and its mirror image which is located below the surface. However, if the surface undulates then more fictitious sources are needed to model the surface. In this paper, we propose a method to model rough hard surfaces using equivalent sources which are placed at various distances from the main source in the x-direction. We formulate a method to compute the hard-surface modeled by a multiple-source perturbation of the two equivalent sources. We also used the equivalent source method to model four different surface geometries: a flat, surface with a hill, surface with a hill and valley and undulating surface.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133310714","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":"Distinguishing process variation induced faults from manufacturing defects in analog circuits using V-transform coefficients","authors":"S. Sindia, V. Agrawal, Virendra Singh","doi":"10.1109/SSST.2011.5753812","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753812","url":null,"abstract":"Paramteric fault distinction between those arising from process variation as opposed to manufacturing defects in components of an analog integrated circuit is presented. Such a fault distinction has significance in the correction and calibration of process steps responsible for manufacturing defects, thereby improving manufacturing yield. In this paper, we begin by laying out foundations for high sensitivity analog circuit test from our previous work on analog circuit test based on V-transform coefficients. Next, we present the Bayesian fault classification of parametric faults arising from process variation against manufacturing defects. Our experiments are based on a benchmark fifth order elliptic filter. We use SPICE program for fault injection, with about 50,000 Monte Carlo simulation runs to demonstrate fault detection-diagnosis under process variation. The test scheme uncovers 95% of all injected single parametric faults whose sizes deviate 5% from the nominal values of circuit components corrected for process variation, while the procedure successfully diagnosed all component faults under ±3σ process variation with 88% confidence level.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123630077","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":"Minimizing cost and power loss by optimal placement of capacitor using ETAP","authors":"P. Chopade, M. Bikdash","doi":"10.1109/SSST.2011.5753771","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753771","url":null,"abstract":"Loads in a power distribution system network are mostly inductive and lead to poor power factor. In order to utilize the generated power optimally it is necessary to maintain close-to-unity power factor. Power factor correction is possible by introducing the capacitive loads in the circuit, as to nullify the effect of inductive loading. Due to simplicity of analysis of radial distribution systems, most previous work [1] studied the effect of nonlinear and capacitive loads on the optimal solution of the Capacitor Placement Problem (CPP) for radial distribution systems only. In this paper, we study optimal capacitor placement on interconnected distribution systems in the presence of nonlinear loads. The placement problem is solved using Genetic Algorithms (GA) as implemented in the ETAP Power station software. Results (power losses, operating voltages and annual benefits) are analyzed. Computational results show that harmonic components affect optimal capacitor placement in all system configurations. If all loads were linear, interconnected and loop system configurations offer lower power losses and better operating conditions than the radial system configuration.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123992610","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 model for the adhesion of multiscale rough surfaces in MEMS","authors":"R. Jackson","doi":"10.1109/SSST.2011.5753817","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753817","url":null,"abstract":"The stiction and adhesion between rough surfaces is of importance for many applications, but contemporarily it is an extremely influential on the performance of Micro-Electrical Mechanical Systsms (MEMS). The reason is that MEMS are at a small scale so that the surface forces are usually dominant over body forces. The surfaces of MEMS are also very clean and smooth, which leads to a larger area of contact and more adhesion between the surfaces. Past researchers have investigated the adhesion of single contacts or asperities, and others have also examined the effect of roughness using statistical and fractal methodologies. The current work uses a differing stacked multi-scale approach, which also suggests a method for predicting at which scales of roughness adhesion becomes important.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124998674","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":"Design and performance of “bumpless” and “bumpless-smooth” discrete-time control systems","authors":"David J. Hall, C. Johnson","doi":"10.1109/SSST.2011.5753767","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753767","url":null,"abstract":"The design of both “bumpless” and “bumpless smooth” type real-time, discrete-time control signals is demonstrated, and the closed-loop response of a system using such novel d iscrete-time control inputs is illustrated.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115825134","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}
Fan Jiang, Mohamed Abdulmajid, Golam R. Khan, Chuan-Chiang Chen
{"title":"A comparison of optimal decoding of convolutional codes over fast fading channels","authors":"Fan Jiang, Mohamed Abdulmajid, Golam R. Khan, Chuan-Chiang Chen","doi":"10.1109/SSST.2011.5753796","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753796","url":null,"abstract":"It is well known that the Bahl, Cocke, Jelinek and Raviv (BCJR) and Viterbi decoding algorithms for convolutional codes are optimal over additive white Gaussian noise (AWGN) channels. The BCJR algorithm is optimal in the sense that it maximizes the a posteriori probability of each bit and Viterbi algorithm is optimal in that it maximizes the likelihood of each decoded codeword. However, experimental results showed that the difference in their performances over pure AWGN channels with respect to both bit error rate (BER) and word error rate (WER) are negligible. In this paper, the performance of BCJR and Viterbi decoding algorithms over fast changing time-varying wireless channels where channel state information may not be available is investigated. Simulation results show that, with the channel condition changing fast, Viterbi decoding offers better performance than BCJR decoding with respect to both BER and WER. It is also shown that, although the knowledge of channel state information does help BCJR decoding, it still underperforms the Viterbi decoding.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421513","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":"Evaluation of the number of segments using weighted entropy","authors":"J. Khan, S. Bhuiyan","doi":"10.1109/SSST.2011.5753801","DOIUrl":"https://doi.org/10.1109/SSST.2011.5753801","url":null,"abstract":"Image segmentation plays a very important role in many image understanding and computer vision techniques. Over the last few decades image segmentation techniques have been advanced significantly, though a few quantitative evaluation techniques have been proposed. Most of the segmentation evaluation techniques are largely subjective that means the evaluation is done visually, intuitively or qualitatively from the comparison of several segmented images. Sometimes the evaluation is even done based on the results of the segmentation step in the subsequent application or processing step. A novel objective segmentation evaluation method based on entropy is proposed in this paper which is simple to implement. In this proposed method the weighted self-entropy and mutual-entropy are used to measure the dissimilarity of the pixel characteristics among the segmented regions and the similarity within a region. This proposed evaluation method produces a numeric score for a segmented image and thus can be used for the comparison of different segmentation algorithms of an image. Moreover, we can use this method to find the values of the parameters of any segmentation algorithm that best suit for a given image. The simulation results show that the presented segmentation evaluation method is effective in identifying both over- and under-segmentation, and the ”good” segmentations that match well with the reference. The preliminary outcomes also open up new areas for further research on objective segmentation evaluation using entropy.","PeriodicalId":352191,"journal":{"name":"2011 IEEE 43rd Southeastern Symposium on System Theory","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134647394","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}