Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252281
Xu Han, Jiwei Liu, Lei Li, Zhiliang Wang
Studies on gait recognition are mostly based on the assumption that walking direction is parallel to the camera, and the person's side view is extracted. Walking direction has becoming one of the gait recognition challenge problems. In this paper we explore gait recognition considering any directions of walking which is not definitely parallel to the camera. We propose a novel approach to computing the walking direction and extracting features by employing a human model. Furthermore, a support vector machine (SVM) is performed allowing us to investigate and evaluate the recognition power of any walking directions. We applied our method to the real human walking video data, and achieved high recognition rate. Our approach finds out how changes in walking direction affect gait parameters in terms of recognition performance. As it is entirely based on human gait, our approach is robust to different type of clothes and different walking directions
{"title":"Gait Recognition Considering Directions of Walking","authors":"Xu Han, Jiwei Liu, Lei Li, Zhiliang Wang","doi":"10.1109/ICCIS.2006.252281","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252281","url":null,"abstract":"Studies on gait recognition are mostly based on the assumption that walking direction is parallel to the camera, and the person's side view is extracted. Walking direction has becoming one of the gait recognition challenge problems. In this paper we explore gait recognition considering any directions of walking which is not definitely parallel to the camera. We propose a novel approach to computing the walking direction and extracting features by employing a human model. Furthermore, a support vector machine (SVM) is performed allowing us to investigate and evaluate the recognition power of any walking directions. We applied our method to the real human walking video data, and achieved high recognition rate. Our approach finds out how changes in walking direction affect gait parameters in terms of recognition performance. As it is entirely based on human gait, our approach is robust to different type of clothes and different walking directions","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":" 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":"113948948","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.252350
M. Tinati, S. Bayati
In the design of modern high frequency radio direction finder (DF), multi elements DF antennas are used. The advantage of DF to the conventional types is in utilizing four elements. Error of arriving wave angle and calculated angle depends on few factors, such as array dimensions, number of elements, and location of main transmitter. Recently research works have been reported on reducing error between arriving wave angle and calculated angle but in practical case, other transmitters, unwanted reflection and the noise could increase the error. In this paper, we investigate effect of above parameters on the error then by using adaptive blind algorithm, these effects are reduced and SINR in output is increased
{"title":"Designing of an Adaptive Adcock Array and Reducing the Effects of Other Transmitters, Unwanted Reflections and Noise","authors":"M. Tinati, S. Bayati","doi":"10.1109/ICCIS.2006.252350","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252350","url":null,"abstract":"In the design of modern high frequency radio direction finder (DF), multi elements DF antennas are used. The advantage of DF to the conventional types is in utilizing four elements. Error of arriving wave angle and calculated angle depends on few factors, such as array dimensions, number of elements, and location of main transmitter. Recently research works have been reported on reducing error between arriving wave angle and calculated angle but in practical case, other transmitters, unwanted reflection and the noise could increase the error. In this paper, we investigate effect of above parameters on the error then by using adaptive blind algorithm, these effects are reduced and SINR in output is increased","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"27 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114017529","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.252324
Wen-chih Yang, Wei-Tzer Huang, Yu-Da Gu
This work investigates the unbalanced operation conditions of two interconnected radial distribution feeders. To connect two radial distribution feeders is an important method of improving the reliability of a distribution system. However, it also impacts the operation of the system. In this work commercial software, OrCAD PSpice is used to build three-phase equivalent models of the sample distribution system with two radial primary feeders, and investigate the unbalanced operation conditions of two sample feeders before and after an interconnection is made. Data that include the voltages, currents, power losses and unbalanced ratios of the sample feeders are presented and discussed. They are anticipated to be a useful reference for personnel in electrical utilities, to help them understand the unbalanced problems of interconnected feeders
{"title":"Analysis of Interconnected Distribution Feeders Under Unbalanced Operation Conditions Using OrCAD PSpice","authors":"Wen-chih Yang, Wei-Tzer Huang, Yu-Da Gu","doi":"10.1109/ICCIS.2006.252324","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252324","url":null,"abstract":"This work investigates the unbalanced operation conditions of two interconnected radial distribution feeders. To connect two radial distribution feeders is an important method of improving the reliability of a distribution system. However, it also impacts the operation of the system. In this work commercial software, OrCAD PSpice is used to build three-phase equivalent models of the sample distribution system with two radial primary feeders, and investigate the unbalanced operation conditions of two sample feeders before and after an interconnection is made. Data that include the voltages, currents, power losses and unbalanced ratios of the sample feeders are presented and discussed. They are anticipated to be a useful reference for personnel in electrical utilities, to help them understand the unbalanced problems of interconnected feeders","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"34 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":"122397910","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.252352
M. Tinati, B. Mozaffary
Speech process has benefited a great deal from the wavelet transforms. Wavelet packets decompose signals in to broader components using linear spectral bisecting. In this paper, mixtures of speech signals are decomposed using wavelet packets, the phase difference between the two mixtures are investigated in wavelet domain. In our method Laplacian mixture model (LMM) is defined. An expectation maximization (EM) algorithm is used for training of the model and calculation of model parameters which is the mixture matrix. Therefore individual speech components of speech mixtures are separated
{"title":"Laplacian Mixture Modeling for Overcomplete Mixture Matrix Estimation in Wavelet Packet Domain by Adaptive EM-type Algorithm","authors":"M. Tinati, B. Mozaffary","doi":"10.1109/ICCIS.2006.252352","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252352","url":null,"abstract":"Speech process has benefited a great deal from the wavelet transforms. Wavelet packets decompose signals in to broader components using linear spectral bisecting. In this paper, mixtures of speech signals are decomposed using wavelet packets, the phase difference between the two mixtures are investigated in wavelet domain. In our method Laplacian mixture model (LMM) is defined. An expectation maximization (EM) algorithm is used for training of the model and calculation of model parameters which is the mixture matrix. Therefore individual speech components of speech mixtures are separated","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"158 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":"122779410","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.252356
K. Batuwita, G. Bandara
Offline handwritten character recognition involves the recognition of handwritten character patterns in digital images. This is a challenging computational problem mainly due to the vast differences associated with the handwritten patterns of different individuals. Fuzzy logic plays a major role in both offline and online handwritten character recognition, since a fuzzy system with an automatically generated rule base possesses the features of flexibility, efficiency and online adaptability. This paper presents an online adaptable fuzzy method for offline handwritten numeric character recognition
{"title":"Fuzzy Recognition of Offline Handwritten Numeric Characters","authors":"K. Batuwita, G. Bandara","doi":"10.1109/ICCIS.2006.252356","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252356","url":null,"abstract":"Offline handwritten character recognition involves the recognition of handwritten character patterns in digital images. This is a challenging computational problem mainly due to the vast differences associated with the handwritten patterns of different individuals. Fuzzy logic plays a major role in both offline and online handwritten character recognition, since a fuzzy system with an automatically generated rule base possesses the features of flexibility, efficiency and online adaptability. This paper presents an online adaptable fuzzy method for offline handwritten numeric character recognition","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"40 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":"131583602","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.252341
B. Misra, S. Satapathy, B. Biswal, P. Dash, G. Panda
In this paper we present polynomial neural network (PNN) model using the group method of data handling to generate a nonlinear time series for classification of patterns. The proposed method considers nonlinear characteristics of the datasets and tries to evolve a polynomial using polynomial neural network that will approximate it to arbitrary token values representing the different classes in the dataset. The approach suggested finds the coefficients of PNN model by means of least square estimation technique. The PNN evolves its layers and number of neurons in each layer after evaluating the fitness function till it attains satisfactory result. Empirical result shows that PNN designed classifier performs better than many other classifier models on selected data sets using less number of features
{"title":"Pattern Classification using Polynomial Neural Network","authors":"B. Misra, S. Satapathy, B. Biswal, P. Dash, G. Panda","doi":"10.1109/ICCIS.2006.252341","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252341","url":null,"abstract":"In this paper we present polynomial neural network (PNN) model using the group method of data handling to generate a nonlinear time series for classification of patterns. The proposed method considers nonlinear characteristics of the datasets and tries to evolve a polynomial using polynomial neural network that will approximate it to arbitrary token values representing the different classes in the dataset. The approach suggested finds the coefficients of PNN model by means of least square estimation technique. The PNN evolves its layers and number of neurons in each layer after evaluating the fitness function till it attains satisfactory result. Empirical result shows that PNN designed classifier performs better than many other classifier models on selected data sets using less number of features","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"68 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":"133309627","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.252286
A. Ramkumar, S. Ponnambalam
The quadratic assignment problems (QAPs) are the problem of assigning 'n' facilities to 'n' locations so that the assignment cost is minimized, where the cost is defined by a quadratic function. In this paper we investigate and present the application of population based hybrid ant-colony system (PHAS) metaheuristic for solving machine (facility) layout problems formulated as quadratic assignment problem, a well-known NP hard combinatorial optimization problem. Ant-colony system is a model for designing metaheuristic algorithms for combinatorial optimization problems. The PHAS ant system algorithm incorporates population-based ants in its initial phase instead of small number of ants and probability based pheromone trail modification. We tested our algorithm on the benchmark instances of QAPLIB, a well-known library of QAP instances and the obtained solution quality is compared with solution obtained with standard guided local search algorithm for the same QAP
{"title":"Hybrid Ant colony System for solving Quadratic Assignment Formulation of Machine Layout Problems","authors":"A. Ramkumar, S. Ponnambalam","doi":"10.1109/ICCIS.2006.252286","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252286","url":null,"abstract":"The quadratic assignment problems (QAPs) are the problem of assigning 'n' facilities to 'n' locations so that the assignment cost is minimized, where the cost is defined by a quadratic function. In this paper we investigate and present the application of population based hybrid ant-colony system (PHAS) metaheuristic for solving machine (facility) layout problems formulated as quadratic assignment problem, a well-known NP hard combinatorial optimization problem. Ant-colony system is a model for designing metaheuristic algorithms for combinatorial optimization problems. The PHAS ant system algorithm incorporates population-based ants in its initial phase instead of small number of ants and probability based pheromone trail modification. We tested our algorithm on the benchmark instances of QAPLIB, a well-known library of QAP instances and the obtained solution quality is compared with solution obtained with standard guided local search algorithm for the same QAP","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"56 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":"132240116","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.252326
V. Vijaykumar, R. Chandrasekar, T. Srinivasan
This paper presents a novel approach to the ant colony optimization algorithm by using an obstacle avoidance strategy for mining classification rules from event log file datasets. An obstacle is purported to be present on a path as a classification rule is incrementally discovered if the rule convergence time is high or the degree of change between successive modifications to the rule exceeds a certain threshold value. By assigning zones to complete paths in a region based on the associated average obstacle density and prioritizing them, classification rules are discovered in descending order of the priorities of zones to enable faster mining in more obstacle-free paths. Experimental results are shown describing a comparative study with the popular C5 algorithm for the event log file datasets
{"title":"An Obstacle Avoidance Strategy to Ant Colony Optimization Algorithm for Classification in Event Logs","authors":"V. Vijaykumar, R. Chandrasekar, T. Srinivasan","doi":"10.1109/ICCIS.2006.252326","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252326","url":null,"abstract":"This paper presents a novel approach to the ant colony optimization algorithm by using an obstacle avoidance strategy for mining classification rules from event log file datasets. An obstacle is purported to be present on a path as a classification rule is incrementally discovered if the rule convergence time is high or the degree of change between successive modifications to the rule exceeds a certain threshold value. By assigning zones to complete paths in a region based on the associated average obstacle density and prioritizing them, classification rules are discovered in descending order of the priorities of zones to enable faster mining in more obstacle-free paths. Experimental results are shown describing a comparative study with the popular C5 algorithm for the event log file datasets","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"124 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":"134325020","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.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.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
扫码关注我们
求助内容：
应助结果提醒方式：