Pub Date : 2004-09-27DOI: 10.1109/SSST.2004.1295690
M. Shirvaikar
Automatic sign interpretation on highways and roads is a real-time imaging application with utility in autonomous vehicle operation, intelligent highway systems and sign inventory systems for transportation departments. We propose a step-wise multistage sign recognition and interpretation strategy. The approach relies on independent examination of spectral and spatial features. The spectral processing step utilizes color cues to extract candidate target pixels in the image. In the next stage, spatial features extracted from the image are matched against attributes derived from object models. Relational feature analysis can further refine the results after the spatial analysis step. Color images of a variety of signs including speed limit, yield, stop and route number signs formed the training set. The accuracy of the method is measured for different types of signs and the results are discussed.
{"title":"Automatic detection and interpretation of road signs","authors":"M. Shirvaikar","doi":"10.1109/SSST.2004.1295690","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295690","url":null,"abstract":"Automatic sign interpretation on highways and roads is a real-time imaging application with utility in autonomous vehicle operation, intelligent highway systems and sign inventory systems for transportation departments. We propose a step-wise multistage sign recognition and interpretation strategy. The approach relies on independent examination of spectral and spatial features. The spectral processing step utilizes color cues to extract candidate target pixels in the image. In the next stage, spatial features extracted from the image are matched against attributes derived from object models. Relational feature analysis can further refine the results after the spatial analysis step. Color images of a variety of signs including speed limit, yield, stop and route number signs formed the training set. The accuracy of the method is measured for different types of signs and the results are discussed.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843575","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295611
M. Nalasani, W. D. Pan
Conventional motion estimation algorithms in video coding consider only translations, which can be readily characterized by displacement motion vectors. We might be able to achieve more accurate motion estimation by enlarging the search windows, at the expense of drastically increased computational complexity. Alternatively, we could also increase the accuracy of motion estimation by taking into account potential non-translation motions of objects in a video scene, without increasing the search window size. In this paper, we conduct a comparative study on the computational complexity of these two methods. We demonstrate that our motion estimation method based on the Lie operators can significantly increase the accuracy of motion estimation, while requiring much lower complexity than the method of enlarged search windows.
{"title":"On the complexity and accuracy of motion estimation using Lie operators","authors":"M. Nalasani, W. D. Pan","doi":"10.1109/SSST.2004.1295611","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295611","url":null,"abstract":"Conventional motion estimation algorithms in video coding consider only translations, which can be readily characterized by displacement motion vectors. We might be able to achieve more accurate motion estimation by enlarging the search windows, at the expense of drastically increased computational complexity. Alternatively, we could also increase the accuracy of motion estimation by taking into account potential non-translation motions of objects in a video scene, without increasing the search window size. In this paper, we conduct a comparative study on the computational complexity of these two methods. We demonstrate that our motion estimation method based on the Lie operators can significantly increase the accuracy of motion estimation, while requiring much lower complexity than the method of enlarged search windows.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114694292","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295676
F. Elnaggar, G.A. Elkobrsy
The goal of this work is to investigate the nonlinear oscillations of the forced, damped rotating pendulum. When the damping coefficient and the amplitude of the excitation force are zero, the system is autonomous with an explicitly known homoclinic and heteroclinic orbits. The homoclinic and the heteroclinic orbits are calculated. Melnikov functions due to the homoclinic and the heteroclinic orbits are calculated to detect the transverse homoclinic and heteroclinic orbits. Regular and chaotic motions are shown to be possible in the damped case. Numerical methods are used to obtain time history, phase portrait, Laypunov exponents, Poincare' maps and their fractal dimensions.
{"title":"Homoclinic and heteroclinic bifurcations of the motion of rotating pendulum","authors":"F. Elnaggar, G.A. Elkobrsy","doi":"10.1109/SSST.2004.1295676","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295676","url":null,"abstract":"The goal of this work is to investigate the nonlinear oscillations of the forced, damped rotating pendulum. When the damping coefficient and the amplitude of the excitation force are zero, the system is autonomous with an explicitly known homoclinic and heteroclinic orbits. The homoclinic and the heteroclinic orbits are calculated. Melnikov functions due to the homoclinic and the heteroclinic orbits are calculated to detect the transverse homoclinic and heteroclinic orbits. Regular and chaotic motions are shown to be possible in the damped case. Numerical methods are used to obtain time history, phase portrait, Laypunov exponents, Poincare' maps and their fractal dimensions.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115258196","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295649
M. Tobias, A. Lanterman
A novel multitarget tracking scheme for passive radar, using a particle filter implementation of Ronald Mahler's probability hypothesis density (PHD), is presented. Using range and velocity measurements from a simple non-directional receive antenna and low frequency transmitter pair, a target can be located along an ellipse. To pinpoint a target, multiple such antenna pairs are needed to locate the target at the intersection of the corresponding ellipses. Determining the intersection of these bistatic range ellipses, and resolving the resultant ghost targets, is generally a complex task. However, the PHD is found to provide a convenient and simple means of fusing together the multiple range and velocity measurements into coherent target tracks.
{"title":"A probability hypothesis density-based multitarget tracker using multiple bistatic range and velocity measurements","authors":"M. Tobias, A. Lanterman","doi":"10.1109/SSST.2004.1295649","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295649","url":null,"abstract":"A novel multitarget tracking scheme for passive radar, using a particle filter implementation of Ronald Mahler's probability hypothesis density (PHD), is presented. Using range and velocity measurements from a simple non-directional receive antenna and low frequency transmitter pair, a target can be located along an ellipse. To pinpoint a target, multiple such antenna pairs are needed to locate the target at the intersection of the corresponding ellipses. Determining the intersection of these bistatic range ellipses, and resolving the resultant ghost targets, is generally a complex task. However, the PHD is found to provide a convenient and simple means of fusing together the multiple range and velocity measurements into coherent target tracks.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123748748","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295645
Qiang Le, L.M. Kaplan, J. McClellan
This work investigates multiple-mode tracking method with node selection using bearings-only measurements. We combine multiple-mode extended Kalman filter with node resource management to conserve energy while tracking a maneuvering target. Experiments using real data show that the MM adapts quicker to target maneuvers than the realizable single-mode tracker. Additional experiments show that the simplex node selection leads to better geolocation performance compared to the closest node selection when the number of active nodes is set to two.
{"title":"Multiple-mode Kalman filtering with node selection using bearings-only measurements","authors":"Qiang Le, L.M. Kaplan, J. McClellan","doi":"10.1109/SSST.2004.1295645","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295645","url":null,"abstract":"This work investigates multiple-mode tracking method with node selection using bearings-only measurements. We combine multiple-mode extended Kalman filter with node resource management to conserve energy while tracking a maneuvering target. Experiments using real data show that the MM adapts quicker to target maneuvers than the realizable single-mode tracker. Additional experiments show that the simplex node selection leads to better geolocation performance compared to the closest node selection when the number of active nodes is set to two.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123437485","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295701
Joonwan Kim, A. Poularikas
An adaptive noise canceller is a well-known method for removing noise from noise-corrupted speech. The problem arises in many situations such as airplane cockpits and automobiles. Tire adjusted step size NLMS (normalized least mean squares) algorithm incorporating a variable step size parameter whose values are based on the ratio of signal-to-noise power has very good convergence speed and low steady-state misadjustment. This paper extends the results of the adjusted step size NLMS algorithm [J. Kim et al., 2003] by investigating the adjusted step size NLMS algorithm approaches when large and abrupt changes of the desired signal as well as the noise signal are present. Simulation results are presented to compare the performance of the adjusted step size NLMS algorithm with the fixed step size LMS algorithm and other commonly used variable step size LMS algorithms.
自适应消噪是一种众所周知的从受噪声污染的语音中去除噪声的方法。这个问题在很多情况下都会出现，比如飞机驾驶舱和汽车。采用基于信噪比的可变步长参数的归一化最小均方差(NLMS)算法具有良好的收敛速度和较低的稳态失调。本文扩展了调整步长NLMS算法的结果[J]。Kim et al.， 2003]通过研究在期望信号和噪声信号存在较大和突然变化时调整步长NLMS算法的方法。仿真结果比较了调整步长NLMS算法与固定步长LMS算法以及其他常用的变步长LMS算法的性能。
{"title":"Performance analysis of the adjusted step size NLMS algorithm","authors":"Joonwan Kim, A. Poularikas","doi":"10.1109/SSST.2004.1295701","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295701","url":null,"abstract":"An adaptive noise canceller is a well-known method for removing noise from noise-corrupted speech. The problem arises in many situations such as airplane cockpits and automobiles. Tire adjusted step size NLMS (normalized least mean squares) algorithm incorporating a variable step size parameter whose values are based on the ratio of signal-to-noise power has very good convergence speed and low steady-state misadjustment. This paper extends the results of the adjusted step size NLMS algorithm [J. Kim et al., 2003] by investigating the adjusted step size NLMS algorithm approaches when large and abrupt changes of the desired signal as well as the noise signal are present. Simulation results are presented to compare the performance of the adjusted step size NLMS algorithm with the fixed step size LMS algorithm and other commonly used variable step size LMS algorithms.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123922409","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295668
B. Kaji, Gan Chen, K. Matsumoto
It is difficult to design a less conservative reduced-order H/sub /spl infin// controller presently. We propose a method of designing a less conservative reduced-order controller by using a genetic algorithm. Since it is difficult to search for a reduced-order controller directly, we search for the full-order controller whose reduced-order controller has the approximate performance of the H/sub /spl infin// optimal full-order controller by adopting controller parameterizations. Then, it is reduced by a certain reduction technique. We propose a coding that is to search only a set of all optimal full-order controllers, since the desired full-order controller is expected to be one of numerous optimal full-order controllers. In order to show the effectiveness of the proposed method, the numerical example is given.
{"title":"Reduced-order H/sub /spl infin// controller synthesis using a real-coded genetic algorithm","authors":"B. Kaji, Gan Chen, K. Matsumoto","doi":"10.1109/SSST.2004.1295668","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295668","url":null,"abstract":"It is difficult to design a less conservative reduced-order H/sub /spl infin// controller presently. We propose a method of designing a less conservative reduced-order controller by using a genetic algorithm. Since it is difficult to search for a reduced-order controller directly, we search for the full-order controller whose reduced-order controller has the approximate performance of the H/sub /spl infin// optimal full-order controller by adopting controller parameterizations. Then, it is reduced by a certain reduction technique. We propose a coding that is to search only a set of all optimal full-order controllers, since the desired full-order controller is expected to be one of numerous optimal full-order controllers. In order to show the effectiveness of the proposed method, the numerical example is given.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128620257","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}
This paper proposes a technique to identify critical double-line outages and enhance static security by optimal placement of FACTS devices using heuristics-based genetic algorithm (GA). Two indices have been used for contingency screening: double-line contingency index (DCI), based on line overflows, and voltage sensitivity index (VSI), based on bus voltage violations. Contingency screening is treated as the primary optimization problem with an objective of finding all double-line outages with maximal DCI and VSI. Security enhancement is treated as a constrained secondary optimization problem. The objective is to reduce transmission losses through the branches of the system and reduce or remove the overflows and voltage violations present. The voltage magnitude at each bus and the line flow through each branch for all the buses and branches have been considered as inequality and equality constraints. The technique is demonstrated using IEEE 14 bus and IEEE 30 bus systems.
{"title":"Contingency selection and static security enhancement in power systems using heuristics-based genetic algorithms","authors":"Ahlada Sudersan, Mohamed Abdelrahman, Ghadir Radman","doi":"10.1109/SSST.2004.1295720","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295720","url":null,"abstract":"This paper proposes a technique to identify critical double-line outages and enhance static security by optimal placement of FACTS devices using heuristics-based genetic algorithm (GA). Two indices have been used for contingency screening: double-line contingency index (DCI), based on line overflows, and voltage sensitivity index (VSI), based on bus voltage violations. Contingency screening is treated as the primary optimization problem with an objective of finding all double-line outages with maximal DCI and VSI. Security enhancement is treated as a constrained secondary optimization problem. The objective is to reduce transmission losses through the branches of the system and reduce or remove the overflows and voltage violations present. The voltage magnitude at each bus and the line flow through each branch for all the buses and branches have been considered as inequality and equality constraints. The technique is demonstrated using IEEE 14 bus and IEEE 30 bus systems.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129030206","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295646
T. Ogle, W. Blair, R.J. Levin, K.W. Harrigan
Modern tactical surveillance systems benefit from a network of distributed sensors that fuse multiplatform-multisensor data into a single integrated picture. Data fusion is complicated due to inconsistent dimensionality between sensors. For example, some radar systems provide range, bearing, and elevation measurements, while other systems provide two-dimensional measurements in range and bearing only. This paper presents a method for generating three dimensional track states and error covariance matrices from two dimensional tracks from two or more surveillance radars geographically separated in WGS-84 coordinates. Equations are developed for estimating the state and error covariance for the single sensor and multiplatform-multisensor cases. For surveillance radars with multiple tracks, track-to-track assignment is performed using the likelihood of the three dimensional track state for each candidate track-to-track association. Results of Monte Carlo simulations show that the new technique is a practical and efficient method that improves track accuracy, covariance consistency, and hence, the value of netting surveillance radars.
{"title":"Multiplatform-multisensor tracking with surveillance radars","authors":"T. Ogle, W. Blair, R.J. Levin, K.W. Harrigan","doi":"10.1109/SSST.2004.1295646","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295646","url":null,"abstract":"Modern tactical surveillance systems benefit from a network of distributed sensors that fuse multiplatform-multisensor data into a single integrated picture. Data fusion is complicated due to inconsistent dimensionality between sensors. For example, some radar systems provide range, bearing, and elevation measurements, while other systems provide two-dimensional measurements in range and bearing only. This paper presents a method for generating three dimensional track states and error covariance matrices from two dimensional tracks from two or more surveillance radars geographically separated in WGS-84 coordinates. Equations are developed for estimating the state and error covariance for the single sensor and multiplatform-multisensor cases. For surveillance radars with multiple tracks, track-to-track assignment is performed using the likelihood of the three dimensional track state for each candidate track-to-track association. Results of Monte Carlo simulations show that the new technique is a practical and efficient method that improves track accuracy, covariance consistency, and hence, the value of netting surveillance radars.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126284289","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 : 2004-09-27DOI: 10.1109/SSST.2004.1295651
S. A. Rasheed, K. Masnoon, N. Thanthry, R. Pendse
Wireless LANs are gaining importance at a very rapid pace. The idea of being mobile and connected to the Internet is driving new innovations in this area. With the recent innovations in the field of multimedia networks, the requirements of QoS support over wireless LANs are becoming more stringent. Quality of service in a wireless LAN is affected by a number of parameters like channel access method, physical/environmental conditions, number of nodes, distance etc. A proper selection of protocols/topology helps in maintaining/improving the QoS support of a wireless network. In this paper, the authors analyze the effect of channel access methods on the multimedia (voice) traffic. Two channel access methods, namely point coordinate function (PCF) and distributed coordinated function are considered for their support for QoS. The simulation results indicate that using PCF for multimedia traffic results in better performance.
{"title":"PCF vs DCF: a performance comparison","authors":"S. A. Rasheed, K. Masnoon, N. Thanthry, R. Pendse","doi":"10.1109/SSST.2004.1295651","DOIUrl":"https://doi.org/10.1109/SSST.2004.1295651","url":null,"abstract":"Wireless LANs are gaining importance at a very rapid pace. The idea of being mobile and connected to the Internet is driving new innovations in this area. With the recent innovations in the field of multimedia networks, the requirements of QoS support over wireless LANs are becoming more stringent. Quality of service in a wireless LAN is affected by a number of parameters like channel access method, physical/environmental conditions, number of nodes, distance etc. A proper selection of protocols/topology helps in maintaining/improving the QoS support of a wireless network. In this paper, the authors analyze the effect of channel access methods on the multimedia (voice) traffic. Two channel access methods, namely point coordinate function (PCF) and distributed coordinated function are considered for their support for QoS. The simulation results indicate that using PCF for multimedia traffic results in better performance.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126797173","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：