The introduction of UAV into transportation offers a great number of challenges such as how to utilize the collected vehicle data of different levels to obtain traffic variables. Meanwhile, different detection approaches may acquire different types and precisions of vehicle data, and the methods that will be chosen for each detection approach also may vary. The main objective of this paper is to compare the difference of several methods of calculating space mean speed (SMS), so as to provide guidance for SMS calculation and application based on various detection data of UAV. Two basic methods and three expanded methods that are possible to be used for UAV detection to calculate SMS of a road are discussed based on a dataset from NGSIM. Without considering the errors that may be caused by instability of UAV flight and video processing, differences among the methods are analyzed in the MatLAB software. The results of the two basic methods are of large difference, and the expanded methods used to estimate the SMS in various time periods will also generate different results. So when the results obtained by these methods are used for data fusion and other transportation applications, they should be assigned different weights. Some other results are obtained too, which may provide references for the traffic parameter extraction based on UAV detection, and the data fusion between the space mean speed from UAV detection and that from other traffic detection methods.
{"title":"Comparison of SMS Calculation Methods Based on NGSIM Data for UAV Detection","authors":"Rongyi Du, Zhongren Peng, Qingchang Lu","doi":"10.1109/IHMSC.2012.123","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.123","url":null,"abstract":"The introduction of UAV into transportation offers a great number of challenges such as how to utilize the collected vehicle data of different levels to obtain traffic variables. Meanwhile, different detection approaches may acquire different types and precisions of vehicle data, and the methods that will be chosen for each detection approach also may vary. The main objective of this paper is to compare the difference of several methods of calculating space mean speed (SMS), so as to provide guidance for SMS calculation and application based on various detection data of UAV. Two basic methods and three expanded methods that are possible to be used for UAV detection to calculate SMS of a road are discussed based on a dataset from NGSIM. Without considering the errors that may be caused by instability of UAV flight and video processing, differences among the methods are analyzed in the MatLAB software. The results of the two basic methods are of large difference, and the expanded methods used to estimate the SMS in various time periods will also generate different results. So when the results obtained by these methods are used for data fusion and other transportation applications, they should be assigned different weights. Some other results are obtained too, which may provide references for the traffic parameter extraction based on UAV detection, and the data fusion between the space mean speed from UAV detection and that from other traffic detection methods.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125899284","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 describes a reading quality scoring system based on large vocabulary continuous speech recognition (LVCSR). Our previous scoring system was based on forced alignment. A disadvantage of forced alignment based system is it can hardly catch huge kinds of reading miscues, while LVCSR based system avoids this disadvantage. The most challenge was that the LVCSR recognition rate was low on our corpus. To improve the recognition rate, we optimized our LVCSR engine for passage scoring tasks by presenting a novel dynamic language model (LM) constructing algorithm. The optimized LVCSR's recognition rate on test speech data was 70.2%, while the recognition rate of the original LVCSR on the same database was 37.9%. Our scoring method was to align the text reference and the confusion network generated from the LVCSR decoding result. The LVCSR based system reduced the scoring error rate of the baseline system by 14.5% relatively.
{"title":"An LVCSR Based Automatic Scoring Method in English Reading Tests","authors":"Junbo Zhang, Fuping Pan, Yonghong Yan","doi":"10.1109/IHMSC.2012.14","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.14","url":null,"abstract":"This paper describes a reading quality scoring system based on large vocabulary continuous speech recognition (LVCSR). Our previous scoring system was based on forced alignment. A disadvantage of forced alignment based system is it can hardly catch huge kinds of reading miscues, while LVCSR based system avoids this disadvantage. The most challenge was that the LVCSR recognition rate was low on our corpus. To improve the recognition rate, we optimized our LVCSR engine for passage scoring tasks by presenting a novel dynamic language model (LM) constructing algorithm. The optimized LVCSR's recognition rate on test speech data was 70.2%, while the recognition rate of the original LVCSR on the same database was 37.9%. Our scoring method was to align the text reference and the confusion network generated from the LVCSR decoding result. The LVCSR based system reduced the scoring error rate of the baseline system by 14.5% relatively.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129786286","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}
In order to recovery geostationary orbit environment, a Space Tether-Net system, which is used to capture and remove the retired or malfunction satellites to graveyard orbit, is proposed and designed in this paper. Firstly the debris in geostationary orbit is introduced based on DISCOS database, and then the debris capture mission sequence by using space tether net system is designed, after that the detailed descriptions about capture tool are presented to illustrate the advantages of flexible capture net. Finally the key subsystems, including Data Management Compute, Attitude & Orbital Control subsystem, Target Tracking subsystem, are designed based on the mission requirements.
{"title":"Space Tether Net System for Debris Capture and Removal","authors":"Zhai Guang, Zhang Jing-rui","doi":"10.1109/IHMSC.2012.71","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.71","url":null,"abstract":"In order to recovery geostationary orbit environment, a Space Tether-Net system, which is used to capture and remove the retired or malfunction satellites to graveyard orbit, is proposed and designed in this paper. Firstly the debris in geostationary orbit is introduced based on DISCOS database, and then the debris capture mission sequence by using space tether net system is designed, after that the detailed descriptions about capture tool are presented to illustrate the advantages of flexible capture net. Finally the key subsystems, including Data Management Compute, Attitude & Orbital Control subsystem, Target Tracking subsystem, are designed based on the mission requirements.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124611156","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 new epsilon constrained biogeography-based optimization is proposed to solve constrained optimization problems. In the proposed algorithm, the epsilon constrained method is utilized to handle the constraints. Simultaneously, based on the feature of epsilon constrained method, a new ordering rule based on epsilon constrained is used to obtain the immigration rate and emigration rate. Additionally, a new dynamic migration strategy is shown to enhance the search ability of migration mechanism. Eventually, with the purpose of improving the precision of convergence, the piecewise logistic chaotic map is introduced to improve the variation mechanism. Numerical experiments on 13 well-known benchmark test function have shown that the proposed algorithm is competitive with other optimization algorithms. Furthermore, the proposed algorithm can avoid effectively the convergence before the optimal results have been found, and balance the exploitation and the exploration.
{"title":"Constrained Optimization Based on Epsilon Constrained Biogeography-Based Optimization","authors":"Xiaojun Bi, Jue Wang","doi":"10.1109/IHMSC.2012.184","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.184","url":null,"abstract":"A new epsilon constrained biogeography-based optimization is proposed to solve constrained optimization problems. In the proposed algorithm, the epsilon constrained method is utilized to handle the constraints. Simultaneously, based on the feature of epsilon constrained method, a new ordering rule based on epsilon constrained is used to obtain the immigration rate and emigration rate. Additionally, a new dynamic migration strategy is shown to enhance the search ability of migration mechanism. Eventually, with the purpose of improving the precision of convergence, the piecewise logistic chaotic map is introduced to improve the variation mechanism. Numerical experiments on 13 well-known benchmark test function have shown that the proposed algorithm is competitive with other optimization algorithms. Furthermore, the proposed algorithm can avoid effectively the convergence before the optimal results have been found, and balance the exploitation and the exploration.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125055029","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}
Shuai Chen, Cuiling Ding, Yu Han, Y. Fang, Yanbing Chen
In this paper, a low-cost micro attitude and heading measurement system using MEMS inertial sensors is researched. To overcome shortcomings such as low precision and easy divergence, a new Kalman filter algorithm based on additive quaternion is designed. The state equation is established which taking attitude quaternion error and gyro drift as state variables. The measurement equation is constructed taking the attitude quaternion among accelerometers, magnetometers and gyroscopes. The stimulation indicates that the output of the AHRS is stable and within reasonable accuracy. Thus, the particular Kalman filter based on the additive quaternion error model is a practical method for improving the attitude and heading angles estimates.
{"title":"Study on Information Fusion Algorithm for the Miniature AHRS","authors":"Shuai Chen, Cuiling Ding, Yu Han, Y. Fang, Yanbing Chen","doi":"10.1109/IHMSC.2012.34","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.34","url":null,"abstract":"In this paper, a low-cost micro attitude and heading measurement system using MEMS inertial sensors is researched. To overcome shortcomings such as low precision and easy divergence, a new Kalman filter algorithm based on additive quaternion is designed. The state equation is established which taking attitude quaternion error and gyro drift as state variables. The measurement equation is constructed taking the attitude quaternion among accelerometers, magnetometers and gyroscopes. The stimulation indicates that the output of the AHRS is stable and within reasonable accuracy. Thus, the particular Kalman filter based on the additive quaternion error model is a practical method for improving the attitude and heading angles estimates.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130900948","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}
The weapon-target assignment is a very complicated problem and a key point in the warship formations' air defense operation. In this paper, a cultural particle swarm optimization algorithm for solving WTA problems is proposed. The general idea of the proposed algorithm is to combine the advantages of PSO which integrates local search and global search scheme possesses high search efficiency, and that of cultural algorithm which combines the search method with the knowledge representation scheme for collecting and reasoning knowledge about individual experience to avoid premature convergence. An example is used to verify the correctness and effectiveness of the proposed cultural PSO algorithm, comparing with both the traditional PSO method and the genetic algorithm method. The simulation results demonstrate that the proposed algorithm has rapid convergence speed and higher solution precision.
{"title":"Solving Weapon-Target Assignment Problems by Cultural Particle Swarm Optimization","authors":"Shaolei Wang, Weiyi Chen","doi":"10.1109/IHMSC.2012.41","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.41","url":null,"abstract":"The weapon-target assignment is a very complicated problem and a key point in the warship formations' air defense operation. In this paper, a cultural particle swarm optimization algorithm for solving WTA problems is proposed. The general idea of the proposed algorithm is to combine the advantages of PSO which integrates local search and global search scheme possesses high search efficiency, and that of cultural algorithm which combines the search method with the knowledge representation scheme for collecting and reasoning knowledge about individual experience to avoid premature convergence. An example is used to verify the correctness and effectiveness of the proposed cultural PSO algorithm, comparing with both the traditional PSO method and the genetic algorithm method. The simulation results demonstrate that the proposed algorithm has rapid convergence speed and higher solution precision.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131326877","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 turntable servo system based on the Lugre friction model is established in order to overcome the nonlinear friction's effect to stability of control system in low speed situation, and an active disturbance rejection controller is designed to estimate and compensate the friction. Only using linear extended observer and linear state error feedback can the designed controller achieve the prospective performance as the classical active disturbance rejection control does. Finally a simulation was used to compare linear active disturbance rejection control with PD, the experiments show that after introducing the active disturbance rejection controller system has the better control performance, higher response speed, higher reliable precision as well as the anti-disturbance.
{"title":"Research of Linear Active Disturbance Rejection Control in the Turntable Servo System","authors":"Shan Dongsheng, Li Chao, Z. Peiqiang, Wei Wei","doi":"10.1109/IHMSC.2012.30","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.30","url":null,"abstract":"A turntable servo system based on the Lugre friction model is established in order to overcome the nonlinear friction's effect to stability of control system in low speed situation, and an active disturbance rejection controller is designed to estimate and compensate the friction. Only using linear extended observer and linear state error feedback can the designed controller achieve the prospective performance as the classical active disturbance rejection control does. Finally a simulation was used to compare linear active disturbance rejection control with PD, the experiments show that after introducing the active disturbance rejection controller system has the better control performance, higher response speed, higher reliable precision as well as the anti-disturbance.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121274434","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}
Textural features is very important properties in many types of images. Partitioning an image into homogeneous regions based on textural features is useful in computer vision. Many texture classification algorithms have been proposed including Local Binary Patterns, Gray Level Co-Occurrence and K-View based algorithms, to name a few. Among of them, The K-View using Rotation-invariant feature algorithm (K-View-R) and the fast weighted K-View-Voting algorithm (K-View-V) produce higher classification accuracy by compare with those original K-View based algorithms. However, there still have some rooms for improvement. In this paper, by analyzing those K-View based algorithms, an attempt to utilize the advantages of the K-View-R and K-View-V was investigated. The new approach which we called combinatorial K-View based method was presented. To test and evaluate the proposed method, some experiments were carried out on a lot of textural images which taken from a standard database. Preliminary experimental results demonstrated the new method achieved more accurate classification by compare with other K-View based methods.
{"title":"A Combinatorial K-View Based Algorithm for Image Texture Classification","authors":"Yihua Lan, H. Ren, Yi Chen","doi":"10.1109/IHMSC.2012.137","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.137","url":null,"abstract":"Textural features is very important properties in many types of images. Partitioning an image into homogeneous regions based on textural features is useful in computer vision. Many texture classification algorithms have been proposed including Local Binary Patterns, Gray Level Co-Occurrence and K-View based algorithms, to name a few. Among of them, The K-View using Rotation-invariant feature algorithm (K-View-R) and the fast weighted K-View-Voting algorithm (K-View-V) produce higher classification accuracy by compare with those original K-View based algorithms. However, there still have some rooms for improvement. In this paper, by analyzing those K-View based algorithms, an attempt to utilize the advantages of the K-View-R and K-View-V was investigated. The new approach which we called combinatorial K-View based method was presented. To test and evaluate the proposed method, some experiments were carried out on a lot of textural images which taken from a standard database. Preliminary experimental results demonstrated the new method achieved more accurate classification by compare with other K-View based methods.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127017016","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}
Jin Yang, F. Zhu, Z. Yuan, Shihui Zhang, Xu-dong He
In the field of computer vision, image matching is very important in many applications, such as the object recognition, 3D reconstruction, stereo vision, motion tracking and augmented reality. A method of improving the Opensurf algorithm used in AR for decreasing matching points and mismatch and increasing the calculation speed is proposed.
{"title":"OpenSURF Algorithm Improvement for Augmented Reality Based on the Natural Features","authors":"Jin Yang, F. Zhu, Z. Yuan, Shihui Zhang, Xu-dong He","doi":"10.1109/IHMSC.2012.21","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.21","url":null,"abstract":"In the field of computer vision, image matching is very important in many applications, such as the object recognition, 3D reconstruction, stereo vision, motion tracking and augmented reality. A method of improving the Opensurf algorithm used in AR for decreasing matching points and mismatch and increasing the calculation speed is proposed.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"57 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498373","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}
The Concepts of connectedness and s-connectedness in L-closure spaces are introduced in this paper. Some properties are discussed and we generalize relative results of s-connectedness in L-fuzzy topological molecular lattices.
{"title":"Connectedness and S-Connectedness in L-Closure Spaces","authors":"Yuhui Liu, Guoqiang Yuan","doi":"10.1109/IHMSC.2012.115","DOIUrl":"https://doi.org/10.1109/IHMSC.2012.115","url":null,"abstract":"The Concepts of connectedness and s-connectedness in L-closure spaces are introduced in this paper. Some properties are discussed and we generalize relative results of s-connectedness in L-fuzzy topological molecular lattices.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121566789","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
扫码关注我们
求助内容：
应助结果提醒方式：