Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358210
Qingyang Xu, Xianyao Meng, Ning Wang, Chuang Zhang
Danger Model Immune Algorithm(DMIA) is an algorithm based on the danger theory of biological immune system. In the basic algorithm, the danger area is fixed through the initial setting. It is an important parameter which will affect the capability of algorithm. In this paper, propose an adaptive danger area DMIA. The radius of danger area is decrease gradually according to the iteration steps. The simulation results indicate that the adaptive danger area DMIA is valid and has better optimization capability.
{"title":"Adaptive danger area based Danger Model Immune Algorithm","authors":"Qingyang Xu, Xianyao Meng, Ning Wang, Chuang Zhang","doi":"10.1109/ICICISYS.2009.5358210","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358210","url":null,"abstract":"Danger Model Immune Algorithm(DMIA) is an algorithm based on the danger theory of biological immune system. In the basic algorithm, the danger area is fixed through the initial setting. It is an important parameter which will affect the capability of algorithm. In this paper, propose an adaptive danger area DMIA. The radius of danger area is decrease gradually according to the iteration steps. The simulation results indicate that the adaptive danger area DMIA is valid and has better optimization capability.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127834594","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358072
Ling Zu, Hongji Meng, Zhi Xie
Combined with the established three-dimensional dynamic solidification heat transfer model, a feed-forward controller under speed disturbance was designed for compensating secondary water. In order to improve the control quality of the surface temperature for billet, based on the determination of the transfer function matrix structures of the control channel and the disturbance channel, the heat transfer coefficient and the step changes of cast speed were employed as input activation, the surface temperatures of the casting billet were implied as the output response, and the step response curves and least square method were used to identify the transfer function. The simulation results shows that, the gain of the frequency response curves of the transfer function and the variation between the billet surface temperature and the target temperature are both reduced, and the quality of control is improved.
{"title":"Design of speed disturbance compensation controller in the secondary cooling zones for billet","authors":"Ling Zu, Hongji Meng, Zhi Xie","doi":"10.1109/ICICISYS.2009.5358072","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358072","url":null,"abstract":"Combined with the established three-dimensional dynamic solidification heat transfer model, a feed-forward controller under speed disturbance was designed for compensating secondary water. In order to improve the control quality of the surface temperature for billet, based on the determination of the transfer function matrix structures of the control channel and the disturbance channel, the heat transfer coefficient and the step changes of cast speed were employed as input activation, the surface temperatures of the casting billet were implied as the output response, and the step response curves and least square method were used to identify the transfer function. The simulation results shows that, the gain of the frequency response curves of the transfer function and the variation between the billet surface temperature and the target temperature are both reduced, and the quality of control is improved.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129274453","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357895
M. Gu
The model based on fuzzy ART neural network is designed and realized. It can deal with online learning and recognition of the known and unknown faces at the same time. The simulation experiment results show an online maximum recognition rate is 91.25% when the proper network parameters are selected. 400 images of 40 persons in the AT&T Yale face database[1] are used for simulation experiment.
{"title":"Fuzzy art neural network model and its application","authors":"M. Gu","doi":"10.1109/ICICISYS.2009.5357895","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357895","url":null,"abstract":"The model based on fuzzy ART neural network is designed and realized. It can deal with online learning and recognition of the known and unknown faces at the same time. The simulation experiment results show an online maximum recognition rate is 91.25% when the proper network parameters are selected. 400 images of 40 persons in the AT&T Yale face database[1] are used for simulation experiment.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125369768","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357852
Yao Yao, Demin Xu, Weisheng Yan
In this paper, we consider the problem of Cooperative Localization(CL) with communication delays for Multiple Autonomous Underwater Vehicles(MAUVs). Localization is a crucial cycle for long range navigation of MAUVs. In the Leader-follower cooperative structure, one master AUV is equipped with high precision navigation system, and several slaver AUVs are equipped with low precision navigation system. To sharing information, inter-vehicle communication is becoming an important requirement for Cooperative Localization. However, due to the terrible underwater environment, acoustic communication is still a difficult challenge for AUVs until now. Taking into account the communication delays, a Delayed Extended Kalman Filter (DEKF) for Cooperative Localization is designed, where the delayed messages were converted to current after some useful transformations. At the end of this paper, simulation results are provided to prove the superiority and practicality of the proposed DEKF algorithm.
{"title":"Cooperative localization with communication delays for MAUVs","authors":"Yao Yao, Demin Xu, Weisheng Yan","doi":"10.1109/ICICISYS.2009.5357852","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357852","url":null,"abstract":"In this paper, we consider the problem of Cooperative Localization(CL) with communication delays for Multiple Autonomous Underwater Vehicles(MAUVs). Localization is a crucial cycle for long range navigation of MAUVs. In the Leader-follower cooperative structure, one master AUV is equipped with high precision navigation system, and several slaver AUVs are equipped with low precision navigation system. To sharing information, inter-vehicle communication is becoming an important requirement for Cooperative Localization. However, due to the terrible underwater environment, acoustic communication is still a difficult challenge for AUVs until now. Taking into account the communication delays, a Delayed Extended Kalman Filter (DEKF) for Cooperative Localization is designed, where the delayed messages were converted to current after some useful transformations. At the end of this paper, simulation results are provided to prove the superiority and practicality of the proposed DEKF algorithm.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123193270","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357702
Xiuyou Wang, Feng Wang, Jianzhong Fan, Jiwen Wang
Fingerprint classification is crucial to reduce the processing time in a large-scale database. In this paper a fingerprint classification based on continuous orientation field and singular points is proposed. The continuous orientation field can not only filter the noises in point directional image,but also represent the basic structural feature of fingerprint more precisely.Singularities are the most important and reliable feature in classification.The reliable and fast classification algorithm is made possible by a simple but effective combination of continuous orientation field and the modified Poincare index in the determination of singular points.The experiment results show the effectiveness of the proposed method in producing good classification result.
{"title":"Fingerprint classification based on continuous orientation field and singular points","authors":"Xiuyou Wang, Feng Wang, Jianzhong Fan, Jiwen Wang","doi":"10.1109/ICICISYS.2009.5357702","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357702","url":null,"abstract":"Fingerprint classification is crucial to reduce the processing time in a large-scale database. In this paper a fingerprint classification based on continuous orientation field and singular points is proposed. The continuous orientation field can not only filter the noises in point directional image,but also represent the basic structural feature of fingerprint more precisely.Singularities are the most important and reliable feature in classification.The reliable and fast classification algorithm is made possible by a simple but effective combination of continuous orientation field and the modified Poincare index in the determination of singular points.The experiment results show the effectiveness of the proposed method in producing good classification result.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123328998","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357773
Jianguo Wang, Gongxing Wu, Lei Wan, Yu-shan Sun, Dapeng Jiang
Study of thruster fault diagnosis of Underwater Robots (URs) is undertaken to improve its whole system reliability. Based on the BP neural network, an improved recurrent neural network (RNN) is proposed and the network training algorithm is deduced. The RNN is trained by voyage head and yaw turning experiments, and the well trained network is applied to model for the URs. Compared the model's outputs with the sensors' outputs, the residuals can be obtained; Fault detection rules can be distilled from the residuals to execute thruster fault diagnosis. The methods presented here are applied to the simulation and sea trial experiments, and plenty of results are got. Based on the analysis of the experiments results, the validity and feasibility of the methods can be verified, and some reference values in engineering application can be demonstrated by the results.
{"title":"Recurrent neural network applied to fault diagnosis of Underwater Robots","authors":"Jianguo Wang, Gongxing Wu, Lei Wan, Yu-shan Sun, Dapeng Jiang","doi":"10.1109/ICICISYS.2009.5357773","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357773","url":null,"abstract":"Study of thruster fault diagnosis of Underwater Robots (URs) is undertaken to improve its whole system reliability. Based on the BP neural network, an improved recurrent neural network (RNN) is proposed and the network training algorithm is deduced. The RNN is trained by voyage head and yaw turning experiments, and the well trained network is applied to model for the URs. Compared the model's outputs with the sensors' outputs, the residuals can be obtained; Fault detection rules can be distilled from the residuals to execute thruster fault diagnosis. The methods presented here are applied to the simulation and sea trial experiments, and plenty of results are got. Based on the analysis of the experiments results, the validity and feasibility of the methods can be verified, and some reference values in engineering application can be demonstrated by the results.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"541 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123370765","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357740
K. Zhou, Lixin Zheng, F. Lin
Aiming at the weakness of ignoring symmetry property and using complicated iterative algorithms to solve for interpolation coefficients in the existing time domain B-spline interpolation methods, this paper presents a novel B-spline interpolation method using symmetric B-spline basis on closed periodic zone where interpolation coefficients can be fast computed by parallel algorithms. First we shift naïve B-spline basis to establish symmetric B-spline basis, next we use orthogonality properties of complex exponentials to establish orthogonal B-spline basis on closed periodic zone and derive parallel computing formula for coefficients of orthogonal Bspline basis; we further use relation between coefficients of orthogonal B-spline basis and coefficients of symmetric B-spline basis to achieve parallel computing formulas for interpolation coefficients of symmetric B-spline basis. At last, we extend the method to image enlargement. Experiment results show that, the new theory established in this paper can be used to explain result of B-spline interpolation from standpoint of signal processing. The method presented in this paper can easily carry out parallel computation for interpolation coefficients of symmetric B-spline basis and brings no phase deviation to enlarged image. Compared with neighborhood-based bilinear and bicubic interpolation methods, the new method produces enlargement with higher Peak Signal to Noise Ratio (PSNR) and sharper visual quality.
{"title":"Image enlargement using symmetric B-spline basis on closed periodic zone","authors":"K. Zhou, Lixin Zheng, F. Lin","doi":"10.1109/ICICISYS.2009.5357740","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357740","url":null,"abstract":"Aiming at the weakness of ignoring symmetry property and using complicated iterative algorithms to solve for interpolation coefficients in the existing time domain B-spline interpolation methods, this paper presents a novel B-spline interpolation method using symmetric B-spline basis on closed periodic zone where interpolation coefficients can be fast computed by parallel algorithms. First we shift naïve B-spline basis to establish symmetric B-spline basis, next we use orthogonality properties of complex exponentials to establish orthogonal B-spline basis on closed periodic zone and derive parallel computing formula for coefficients of orthogonal Bspline basis; we further use relation between coefficients of orthogonal B-spline basis and coefficients of symmetric B-spline basis to achieve parallel computing formulas for interpolation coefficients of symmetric B-spline basis. At last, we extend the method to image enlargement. Experiment results show that, the new theory established in this paper can be used to explain result of B-spline interpolation from standpoint of signal processing. The method presented in this paper can easily carry out parallel computation for interpolation coefficients of symmetric B-spline basis and brings no phase deviation to enlarged image. Compared with neighborhood-based bilinear and bicubic interpolation methods, the new method produces enlargement with higher Peak Signal to Noise Ratio (PSNR) and sharper visual quality.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126353841","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357723
Wen Hong-yan, Gao Jing-tao
A pyramid approach for remote sensing image registration based on mutual information and grey relational analysis is presented. The methodology applies edge information of image extracted using grey relational analysis and combines with mutual information regarding as similarity measure. First, the image pyramid is constructed by wavelet transform, and then coarse-to-fine multi-resolution search approaches have been put forward to increase accuracy and efficiency. An exhaustive search algorithm is applied at the coarsest level of the image pyramid. Registration at higher levels can be performed with the result at the pervious level serving as the initial condition. The effective and exact matching results can be obtained by applying the algorithm to remote sensing image registration.
{"title":"Remote sensing image registration based on mutual information and grey relational analysis","authors":"Wen Hong-yan, Gao Jing-tao","doi":"10.1109/ICICISYS.2009.5357723","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357723","url":null,"abstract":"A pyramid approach for remote sensing image registration based on mutual information and grey relational analysis is presented. The methodology applies edge information of image extracted using grey relational analysis and combines with mutual information regarding as similarity measure. First, the image pyramid is constructed by wavelet transform, and then coarse-to-fine multi-resolution search approaches have been put forward to increase accuracy and efficiency. An exhaustive search algorithm is applied at the coarsest level of the image pyramid. Registration at higher levels can be performed with the result at the pervious level serving as the initial condition. The effective and exact matching results can be obtained by applying the algorithm to remote sensing image registration.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121559748","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358396
Xing Tan, M. Gruninger
It is well known that reasoning with AI temporal projection problems is difficult. Determining the Possible Truth problem, a basic temporal projection decision problem, in the so-called Simple Event System remains NP-complete. In this paper, two types of constraints, on the graph-theoretic representation of the cause-and-effect relationships between events and on the partial orders of events, are further considered upon this boundary NP-complete Possible Truth problem, in an attempt to gain tractability. In particular, we show that the problem is still NP-complete even if the cause-and-effect graphs maintain a strongly restricted topology, whereas it is tractable if the graph is closely associated with the set of pairwise disjoint partial orders, which in addition is hierarchically structured.
{"title":"Towards tractable reasoning on temporal projection problems","authors":"Xing Tan, M. Gruninger","doi":"10.1109/ICICISYS.2009.5358396","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358396","url":null,"abstract":"It is well known that reasoning with AI temporal projection problems is difficult. Determining the Possible Truth problem, a basic temporal projection decision problem, in the so-called Simple Event System remains NP-complete. In this paper, two types of constraints, on the graph-theoretic representation of the cause-and-effect relationships between events and on the partial orders of events, are further considered upon this boundary NP-complete Possible Truth problem, in an attempt to gain tractability. In particular, we show that the problem is still NP-complete even if the cause-and-effect graphs maintain a strongly restricted topology, whereas it is tractable if the graph is closely associated with the set of pairwise disjoint partial orders, which in addition is hierarchically structured.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126291894","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 : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357734
Xiaoshan Liu, Minghui Du, Lianwen Jin
The important step of face recognition based on subspace method is to obtain powerful features. In this paper, we propose a novel feature extraction technique based on discrete wavelet frame transform(DWFT), which capture the information about relationship between each high frequency subband and the low frequency subband of the decomposed image at the corresponding level. In the feature space, we use orthogonal neighborhood preserving profections (ONPP) algorithm to reduce dimension. experimental results show that the proposed algorithm is effective in face recognition. Comparisons with the other approachs are also provided.
{"title":"Coefficients' co-occurrence histogram of DWFT based feature extration with ONPP for face recognition","authors":"Xiaoshan Liu, Minghui Du, Lianwen Jin","doi":"10.1109/ICICISYS.2009.5357734","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357734","url":null,"abstract":"The important step of face recognition based on subspace method is to obtain powerful features. In this paper, we propose a novel feature extraction technique based on discrete wavelet frame transform(DWFT), which capture the information about relationship between each high frequency subband and the low frequency subband of the decomposed image at the corresponding level. In the feature space, we use orthogonal neighborhood preserving profections (ONPP) algorithm to reduce dimension. experimental results show that the proposed algorithm is effective in face recognition. Comparisons with the other approachs are also provided.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122229338","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
扫码关注我们
求助内容：
应助结果提醒方式：