Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252297
Zhao Quanming, Li Lingling, Li Zhigang, Wang Jiannan, Liu Fengguo
Case-based reasoning (CBR) has been widely applied in expert systems. This method can find out the solution of the problem to be solved in terms of the former experience by analyzing the similarity of information between the problem to be solved and the existing cases. However, among the information from the problem, some data are fuzzy. In order to find out the similar cases successfully, a method of fuzzy CBR based on pattern recognition is presented in this paper. According to this method, all the relative existing cases in the case database are fuzzed and each can be regarded as typical pattern. And then a new general closeness degree algorithm was constructed to deal with general and fuzzy data by combining two kinds of closeness degree algorithm and is used as the similarity degree function between the cases and the problem to be solved so as to realize case matching under the fuzzy strategy by using the method of pattern recognition. The validity of this method has been confirmed in electrical apparatus product design
{"title":"Fuzzy CBR based on Pattern Recognition and its Application","authors":"Zhao Quanming, Li Lingling, Li Zhigang, Wang Jiannan, Liu Fengguo","doi":"10.1109/ICCIS.2006.252297","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252297","url":null,"abstract":"Case-based reasoning (CBR) has been widely applied in expert systems. This method can find out the solution of the problem to be solved in terms of the former experience by analyzing the similarity of information between the problem to be solved and the existing cases. However, among the information from the problem, some data are fuzzy. In order to find out the similar cases successfully, a method of fuzzy CBR based on pattern recognition is presented in this paper. According to this method, all the relative existing cases in the case database are fuzzed and each can be regarded as typical pattern. And then a new general closeness degree algorithm was constructed to deal with general and fuzzy data by combining two kinds of closeness degree algorithm and is used as the similarity degree function between the cases and the problem to be solved so as to realize case matching under the fuzzy strategy by using the method of pattern recognition. The validity of this method has been confirmed in electrical apparatus product design","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125010546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252269
S.F. Wang, J. Xue, X.F. Wang
In this paper, we evaluate the performance of a case-based automatic facial action units recognition approach using interactive genetic algorithm (IGA). First, the case-based facial action units recognition approach is introduced. This method retrieves the most similar case image from case database using IGA and reuses the action units of the matched case image to the test face image. Second, to evaluate the effectiveness of our approach, comparison experiments with eigenface method on simple test images are done. The experimental results show that, for our method, the average recognition rate is about 77.5% on single AUs and average similarity rate is 82.8% on AU combinations, which are both higher than those of the eigenface method. Third, experiments of the case-based automatic facial action units recognition approach on complex test images is presented in this paper. The results prove the robusticity of our approach. A recognition rate of single AUs of 82.8% and a similarity rate of AU combinations of 93.1% are obtained
{"title":"Evaluation of a Case-based Facial Action Units Recognition Approach","authors":"S.F. Wang, J. Xue, X.F. Wang","doi":"10.1109/ICCIS.2006.252269","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252269","url":null,"abstract":"In this paper, we evaluate the performance of a case-based automatic facial action units recognition approach using interactive genetic algorithm (IGA). First, the case-based facial action units recognition approach is introduced. This method retrieves the most similar case image from case database using IGA and reuses the action units of the matched case image to the test face image. Second, to evaluate the effectiveness of our approach, comparison experiments with eigenface method on simple test images are done. The experimental results show that, for our method, the average recognition rate is about 77.5% on single AUs and average similarity rate is 82.8% on AU combinations, which are both higher than those of the eigenface method. Third, experiments of the case-based automatic facial action units recognition approach on complex test images is presented in this paper. The results prove the robusticity of our approach. A recognition rate of single AUs of 82.8% and a similarity rate of AU combinations of 93.1% are obtained","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"1990 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131354507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252300
Chang-Huang Chen, S. Yeh
In this paper, a new search strategy for constriction type particle swarm optimization is presented. The modification is based on the observation that personal past best experience is helpful for searching optimal result. As a result, instead of moving particle to the vicinity of current position, by letting the particle to explore the proximity of personal best position, a great improvement in computation efficiency and quality is achieved. The results are verified through testing on benchmark functions. The advantage of this new scheme is that no extra mathematic operation is introduced compared to those modifications proposed in literature
{"title":"Personal Best Oriented Constriction Type Particle Swarm Optimization","authors":"Chang-Huang Chen, S. Yeh","doi":"10.1109/ICCIS.2006.252300","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252300","url":null,"abstract":"In this paper, a new search strategy for constriction type particle swarm optimization is presented. The modification is based on the observation that personal past best experience is helpful for searching optimal result. As a result, instead of moving particle to the vicinity of current position, by letting the particle to explore the proximity of personal best position, a great improvement in computation efficiency and quality is achieved. The results are verified through testing on benchmark functions. The advantage of this new scheme is that no extra mathematic operation is introduced compared to those modifications proposed in literature","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121543251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252291
Li Lingling, Zhao Quanming, Li Zhigang, Zhang Huijuan
Based on clustering analyzing, a structure selecting method was proposed for design-oriented expert system during product conceptual design. The clustering analyzing method was introduced to find out the attribute sets in different levels matched with structure tree so as to set up a product characteristic space. In this space, each sub-space is matched with a type of product structure. Similarly, the standard model of product can be set up according to the clustering result and all the models are formed as standard structure tree. Then, the fuzzy recognition method is adopted to determine the type of product structure by mapping one certain node of the tree with the design requirements. The method can be wide used in applications of mechanical product design
{"title":"Product Design Based on Clustering Analyzing and Fuzzy Recognition","authors":"Li Lingling, Zhao Quanming, Li Zhigang, Zhang Huijuan","doi":"10.1109/ICCIS.2006.252291","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252291","url":null,"abstract":"Based on clustering analyzing, a structure selecting method was proposed for design-oriented expert system during product conceptual design. The clustering analyzing method was introduced to find out the attribute sets in different levels matched with structure tree so as to set up a product characteristic space. In this space, each sub-space is matched with a type of product structure. Similarly, the standard model of product can be set up according to the clustering result and all the models are formed as standard structure tree. Then, the fuzzy recognition method is adopted to determine the type of product structure by mapping one certain node of the tree with the design requirements. The method can be wide used in applications of mechanical product design","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129177627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252327
Yanlin Dong, Bin Zuo, Patricia D. Mackenzie, J. Salvo
The logic for determining the passing direction of a person through a two-way access control portal is rather complicated. This paper analyzes the state transition diagrams based on sensor fusion data to clarify the confusing decision making logic. An RFID-based access control system, coupled with infrared sensors, is implemented in a two-way portal to verify the proposed technique
{"title":"Analysis of State Transition Diagrams for RFID-Based Two-Way Access Control","authors":"Yanlin Dong, Bin Zuo, Patricia D. Mackenzie, J. Salvo","doi":"10.1109/ICCIS.2006.252327","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252327","url":null,"abstract":"The logic for determining the passing direction of a person through a two-way access control portal is rather complicated. This paper analyzes the state transition diagrams based on sensor fusion data to clarify the confusing decision making logic. An RFID-based access control system, coupled with infrared sensors, is implemented in a two-way portal to verify the proposed technique","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131006389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252307
J. Hillenbrand, K. Kroschel
Collision mitigation systems are important driver assistance systems which promise to improve traffic safety in terms of reducing the number of road accidents and accident severity. Increasing research effort has been devoted to these systems within the past few years and first systems have recently been introduced into the market. However, these systems clearly focus on avoiding or mitigating rear-end collisions. This is mainly due to the fact that the use case of cross-traffic requires advanced environmental perception and decision making. In this paper, we investigate the performance of a practical, uncooperative collision mitigation system capable of handling cross-traffic on a variety of intersection-like situations where two vehicles cross each other at different velocities and distances by means of stochastic dynamic simulations. Although our collision mitigation system does not employ cooperative control mechanisms, we also consider the interesting case of both vehicles being equipped with the system. The performance is analyzed under the assumption of perfect sensor information as well as using a realistic sensor model
{"title":"A Study on the Performance of Uncooperative Collision Mitigation Systems at Intersection-like Traffic Situations","authors":"J. Hillenbrand, K. Kroschel","doi":"10.1109/ICCIS.2006.252307","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252307","url":null,"abstract":"Collision mitigation systems are important driver assistance systems which promise to improve traffic safety in terms of reducing the number of road accidents and accident severity. Increasing research effort has been devoted to these systems within the past few years and first systems have recently been introduced into the market. However, these systems clearly focus on avoiding or mitigating rear-end collisions. This is mainly due to the fact that the use case of cross-traffic requires advanced environmental perception and decision making. In this paper, we investigate the performance of a practical, uncooperative collision mitigation system capable of handling cross-traffic on a variety of intersection-like situations where two vehicles cross each other at different velocities and distances by means of stochastic dynamic simulations. Although our collision mitigation system does not employ cooperative control mechanisms, we also consider the interesting case of both vehicles being equipped with the system. The performance is analyzed under the assumption of perfect sensor information as well as using a realistic sensor model","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132493019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252274
S. Rimcharoen, D. Sutivong, P. Chongstitvatana
The compact genetic algorithm (cGA) has a distinct characteristic that it requires almost minimal memory to store candidate solutions. It represents a population structure as a probability distribution over the set of solutions. Although cGA offers many advantages, it has a limitation that hinges on an assumption of the independency between each individual bit. For example, cGA fails to solve a deceptive function or the so called trap function, which is a standard difficult test problem for genetic algorithm. This paper proposes applying a moving average technique to update a probability vector in the compact genetic algorithm. This method requires fewer evaluations and achieves a higher solution quality. The results are compared with the original cGA, sGA, persistent elitist cGA (pe-cGA) and nonpersistent elitist cGA (ne-cGA). The compared results illustrate that the proposed methodology can successfully improve the solution quality by modifying the updating strategy of cGA
{"title":"Updating Strategy in Compact Genetic Algorithm Using Moving Average Approach","authors":"S. Rimcharoen, D. Sutivong, P. Chongstitvatana","doi":"10.1109/ICCIS.2006.252274","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252274","url":null,"abstract":"The compact genetic algorithm (cGA) has a distinct characteristic that it requires almost minimal memory to store candidate solutions. It represents a population structure as a probability distribution over the set of solutions. Although cGA offers many advantages, it has a limitation that hinges on an assumption of the independency between each individual bit. For example, cGA fails to solve a deceptive function or the so called trap function, which is a standard difficult test problem for genetic algorithm. This paper proposes applying a moving average technique to update a probability vector in the compact genetic algorithm. This method requires fewer evaluations and achieves a higher solution quality. The results are compared with the original cGA, sGA, persistent elitist cGA (pe-cGA) and nonpersistent elitist cGA (ne-cGA). The compared results illustrate that the proposed methodology can successfully improve the solution quality by modifying the updating strategy of cGA","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132781993","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 software in engineering field, even in others filed become most important and more necessary in the 21 century, although there are many toolbox, such as fuzzy, chaos, ..., etc., had been developed in the past, the grey toolbox still seldom and not quite completed. Therefore, in this paper, the focus is on the toolbox development of ordinal grey relational grade and cardinal grey relational grade by using Matlab to development the completed grey relational grade toolbox. Firstly, we preview the whole mathematical foundation of grey relational grade in detail. Secondly, the mathematics model of ten kinds of grey relational grade, and two types of grey relational grades (ordinal and cardinal) are presented. Thirdly, based on the mathematics model, we use Matlab to develop the grey relational grade toolbox. As the results, in this paper, ten kinds of grey relational grade methods, and two types of grey relational grades (ordinal and cardinal) are developed, we can say this kind of completed research is the main contribution and is the first research in grey relational grade. Also can extends in the economy in benefit, for our research, the market price of the whole grey relational grade toolbox with our evaluation; at least will over US 500 dollars. To sum up, we hope this completed grey relational grade toolbox is not only to enhance the depth research of grey relation grade, buy also become a new approach for the applications in grey system theory
{"title":"The Development of Completed Grey Relational Grade Toolbox via Matlab","authors":"Chien-Wen Wang, Cheng-Kai Yeh, Kun-Li Wen, Wu-Shun Jwo","doi":"10.1109/ICCIS.2006.252264","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252264","url":null,"abstract":"The software in engineering field, even in others filed become most important and more necessary in the 21 century, although there are many toolbox, such as fuzzy, chaos, ..., etc., had been developed in the past, the grey toolbox still seldom and not quite completed. Therefore, in this paper, the focus is on the toolbox development of ordinal grey relational grade and cardinal grey relational grade by using Matlab to development the completed grey relational grade toolbox. Firstly, we preview the whole mathematical foundation of grey relational grade in detail. Secondly, the mathematics model of ten kinds of grey relational grade, and two types of grey relational grades (ordinal and cardinal) are presented. Thirdly, based on the mathematics model, we use Matlab to develop the grey relational grade toolbox. As the results, in this paper, ten kinds of grey relational grade methods, and two types of grey relational grades (ordinal and cardinal) are developed, we can say this kind of completed research is the main contribution and is the first research in grey relational grade. Also can extends in the economy in benefit, for our research, the market price of the whole grey relational grade toolbox with our evaluation; at least will over US 500 dollars. To sum up, we hope this completed grey relational grade toolbox is not only to enhance the depth research of grey relation grade, buy also become a new approach for the applications in grey system theory","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133175718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252271
A. Hamzeh, A. Rahmani, N. Parsa
In this paper, we propose an extension to the intelligent exploration method which is introduced in our previous work. IEM is an intelligent exploration method that is used to tune the exploration rate in XCS. In this paper we improve the IEM's performance using a learning fuzzy controller instead of the static one in IEM. The new system is called IEMII (IEM 2) and is compared with the IEM and the traditional XCS in some benchmark problems
{"title":"Intelligent Exploration Method to Adapt Exploration Rate in XCS, Based on Adaptive Fuzzy Genetic Algorithm","authors":"A. Hamzeh, A. Rahmani, N. Parsa","doi":"10.1109/ICCIS.2006.252271","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252271","url":null,"abstract":"In this paper, we propose an extension to the intelligent exploration method which is introduced in our previous work. IEM is an intelligent exploration method that is used to tune the exploration rate in XCS. In this paper we improve the IEM's performance using a learning fuzzy controller instead of the static one in IEM. The new system is called IEMII (IEM 2) and is compared with the IEM and the traditional XCS in some benchmark problems","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133304587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252329
S. C. Chiam, C. Goh, Kay Chen Tan
Recent studies show that evolutionary algorithms are effective optimization tools for their success in solving real-world problem with complex and competing specifications. Although their performances are greatly influenced by the type of representation adopted, this choice often arises from intuition and guesswork due to the absence of proper guidelines and framework. This paper considers binary representation and presents a comprehensive study on its issues, identifying the key factors that affect its algorithmic performance. Furthermore, two metrics are proposed to generalize the concept of preservation which quantifies the similarities between the genotype and phenotype search space. The two classical translation codes i.e. binary and gray are studied based on the identified factors and a preservation analysis revealed the differences between them
{"title":"Issues of Binary Representation in Evolutionary Algorithms","authors":"S. C. Chiam, C. Goh, Kay Chen Tan","doi":"10.1109/ICCIS.2006.252329","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252329","url":null,"abstract":"Recent studies show that evolutionary algorithms are effective optimization tools for their success in solving real-world problem with complex and competing specifications. Although their performances are greatly influenced by the type of representation adopted, this choice often arises from intuition and guesswork due to the absence of proper guidelines and framework. This paper considers binary representation and presents a comprehensive study on its issues, identifying the key factors that affect its algorithmic performance. Furthermore, two metrics are proposed to generalize the concept of preservation which quantifies the similarities between the genotype and phenotype search space. The two classical translation codes i.e. binary and gray are studied based on the identified factors and a preservation analysis revealed the differences between them","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132311118","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
扫码关注我们
求助内容：
应助结果提醒方式：