In this paper, the design of the GPS and Baro-Altimeter integrated navigation system was presented and the mathematical models were founded for the system. Unified the positioning principle of GPS, observation equation of GPS and Baro-Altimeter integrated navigation localization system as well as the resolving method of the observation equation was given. Using Federal Kalman filter algorithm, achieved the data fusion of GPS and Baro-Altimeter. at last, a lot of experiments and emulators were made to exam the integrated navigation system, as the result showed, if the information offered by the Baro-Altimeter was accuracy, it can be ensured the aircraft precision approach and the capacity of the terminal navigation, and improved safety and reliability of the aircraft. This integrated navigation solution has the benefits of simple in principle and easy to achieve.
{"title":"Research of Data Fusion Algorithm of GPS and Baro-Altimeter","authors":"Hui Li, Yunting Zhao, Xinghui Zhang","doi":"10.1109/MVHI.2010.83","DOIUrl":"https://doi.org/10.1109/MVHI.2010.83","url":null,"abstract":"In this paper, the design of the GPS and Baro-Altimeter integrated navigation system was presented and the mathematical models were founded for the system. Unified the positioning principle of GPS, observation equation of GPS and Baro-Altimeter integrated navigation localization system as well as the resolving method of the observation equation was given. Using Federal Kalman filter algorithm, achieved the data fusion of GPS and Baro-Altimeter. at last, a lot of experiments and emulators were made to exam the integrated navigation system, as the result showed, if the information offered by the Baro-Altimeter was accuracy, it can be ensured the aircraft precision approach and the capacity of the terminal navigation, and improved safety and reliability of the aircraft. This integrated navigation solution has the benefits of simple in principle and easy to achieve.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"1 1","pages":"45-47"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74344426","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 analysis about the reliability, validity, stability, and the requirements of objective functions and constraints are given. And the characteristics and scope of application of different optimization methods are concluded, so that the designers have the referenced basis when they choose optimal methods.
{"title":"The Comparisons and Selections of Optimization Methods in Engineering","authors":"Yuankui Ma, Shusheng Zhang, Jing Wang","doi":"10.1109/MVHI.2010.16","DOIUrl":"https://doi.org/10.1109/MVHI.2010.16","url":null,"abstract":"The analysis about the reliability, validity, stability, and the requirements of objective functions and constraints are given. And the characteristics and scope of application of different optimization methods are concluded, so that the designers have the referenced basis when they choose optimal methods.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"60 1","pages":"650-652"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80920340","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 addresses the problem of tracking multiple objects in monocular video sequences. This problem is difficult because one needs to identify the targets by the finite measurement data, which may be affected by variations of pose, environment clutters, etc. A particle filter based multi-target tracking framework is presented, which operates with a novel observation model. The proposed target appearance model is constructed by combining the local modules that divided according to the structure of human body. In order to depress the sample depletion during the approximation process, the observation information is used to construct the mixture proposal density by integrating the sampling manner guided by detected human faces areas with stochastic dynamic model to generate the new samples. Then the Markov chain Monte Carlo (MCMC) method was employed to recursively estimate the solution of multi-target data association problem. Experimental results show that the proposed tracker can effectively handle complex environments, irregular target motions and partial occlusions to keep the identities of the targets in real world.
{"title":"A Detection-Aided Multi-target Tracking Algorithm","authors":"Jianguo Lu, A. Cai, Lili Li","doi":"10.1109/MVHI.2010.12","DOIUrl":"https://doi.org/10.1109/MVHI.2010.12","url":null,"abstract":"This paper addresses the problem of tracking multiple objects in monocular video sequences. This problem is difficult because one needs to identify the targets by the finite measurement data, which may be affected by variations of pose, environment clutters, etc. A particle filter based multi-target tracking framework is presented, which operates with a novel observation model. The proposed target appearance model is constructed by combining the local modules that divided according to the structure of human body. In order to depress the sample depletion during the approximation process, the observation information is used to construct the mixture proposal density by integrating the sampling manner guided by detected human faces areas with stochastic dynamic model to generate the new samples. Then the Markov chain Monte Carlo (MCMC) method was employed to recursively estimate the solution of multi-target data association problem. Experimental results show that the proposed tracker can effectively handle complex environments, irregular target motions and partial occlusions to keep the identities of the targets in real world.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"28 1","pages":"580-583"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72897686","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}
Because of low efficiency of manual plotting table, a new kind of auto plotting table is brought out basing on MMHCI. The block diagram of system and the task-fusion algorithm basing on DSmT are described in the paper. The efficiency of interaction of system is brought to a new level. The result of experiments is also introduced in the paper.
{"title":"A Realization of Auto Plotting Table Basing on MMHCI","authors":"Jiagen Jin, Wenfeng Li","doi":"10.1109/MVHI.2010.206","DOIUrl":"https://doi.org/10.1109/MVHI.2010.206","url":null,"abstract":"Because of low efficiency of manual plotting table, a new kind of auto plotting table is brought out basing on MMHCI. The block diagram of system and the task-fusion algorithm basing on DSmT are described in the paper. The efficiency of interaction of system is brought to a new level. The result of experiments is also introduced in the paper.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"36 1","pages":"505-508"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75869465","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 introduces the visual navigation system design of intelligent vehicle. The navigation system architecture and hardware modules are depicted in details. To enhance the speed control of intelligent vehicle, a new control method based on PID and Bang-Bang control is proposed and applied. To solve the problem of precisely identifying navigation line under uneven light and realizing autonomous navigation of the intelligent vehicle, we propose a new method of dynamic threshold and give out its implementation. To enhance the perspective of the Visual Crawling, the system applies Charge Coupled Device (CCD) camera to collect path information. Image transformation is adopted to filter wrong navigation information. Laboratory experiments have proved the stability and accuracy of the whole system.
{"title":"Intelligent Vehicle Visual Navigation System Design","authors":"He Wang, Yunzhou Zhang, Quan Yuan, Hao Wu","doi":"10.1109/MVHI.2010.159","DOIUrl":"https://doi.org/10.1109/MVHI.2010.159","url":null,"abstract":"This paper introduces the visual navigation system design of intelligent vehicle. The navigation system architecture and hardware modules are depicted in details. To enhance the speed control of intelligent vehicle, a new control method based on PID and Bang-Bang control is proposed and applied. To solve the problem of precisely identifying navigation line under uneven light and realizing autonomous navigation of the intelligent vehicle, we propose a new method of dynamic threshold and give out its implementation. To enhance the perspective of the Visual Crawling, the system applies Charge Coupled Device (CCD) camera to collect path information. Image transformation is adopted to filter wrong navigation information. Laboratory experiments have proved the stability and accuracy of the whole system.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"71 1","pages":"522-525"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76319146","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 we present a method for computing similarity between different concepts. Ontology has the good hierarchical structure of concepts and the support of logical reasoning, and semantic information can be realized through the semantic relationship of concepts. Ontology technology can be well applied to information retrieval. Ontology-based information retrieval is different from the traditional keyword search. Semantic retrieval can be realized because Ontology knowledge base strengthens the intrinsic link of the concepts and the implied and unclear information can be deduced through logical reasoning. Our results show that the general framework is feasible and this method is applicable across different concepts.
{"title":"Research on Ontology-Based Semantic Similarity Computation","authors":"Ye Zhang, Zhan-lin Yu","doi":"10.1109/MVHI.2010.33","DOIUrl":"https://doi.org/10.1109/MVHI.2010.33","url":null,"abstract":"This paper we present a method for computing similarity between different concepts. Ontology has the good hierarchical structure of concepts and the support of logical reasoning, and semantic information can be realized through the semantic relationship of concepts. Ontology technology can be well applied to information retrieval. Ontology-based information retrieval is different from the traditional keyword search. Semantic retrieval can be realized because Ontology knowledge base strengthens the intrinsic link of the concepts and the implied and unclear information can be deduced through logical reasoning. Our results show that the general framework is feasible and this method is applicable across different concepts.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"14 1","pages":"472-475"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78599525","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 this paper an improved ant colony algorithm is presented and an algorithm in combination with particle swarm optimization algorithm and the improved ant colony algorithm for multi-objective flexible job shop scheduling problem are employed. The algorithm proposed in this paper includes two parts. The first part makes use of the fast convergence of PSO to search the particles optimum position and make it as the start position of ants. The second part makes use of the merit of positive feedback and structure of solution set proposed by our improved ACA to search the global optimum scheduling. The algorithm we presented is validated by practical instances. The results obtained have shown the proposed approach is feasible and effective for the multi-objective flexible job shop scheduling problem.
{"title":"An Improved Ant Colony Algorithm Combined with Particle Swarm Optimization Algorithm for Multi-objective Flexible Job Shop Scheduling Problem","authors":"Li Li, Keqi Wang, Zhou Chunnan","doi":"10.1109/MVHI.2010.94","DOIUrl":"https://doi.org/10.1109/MVHI.2010.94","url":null,"abstract":"In this paper an improved ant colony algorithm is presented and an algorithm in combination with particle swarm optimization algorithm and the improved ant colony algorithm for multi-objective flexible job shop scheduling problem are employed. The algorithm proposed in this paper includes two parts. The first part makes use of the fast convergence of PSO to search the particles optimum position and make it as the start position of ants. The second part makes use of the merit of positive feedback and structure of solution set proposed by our improved ACA to search the global optimum scheduling. The algorithm we presented is validated by practical instances. The results obtained have shown the proposed approach is feasible and effective for the multi-objective flexible job shop scheduling problem.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"95 1","pages":"88-91"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73828669","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}
Aiming at static state colorful image, human face was detected by combined complexion division technology with edge detection technology. Firstly, optional face areas were obtained by the area threshold value. Secondly, Gabor transform was employed to locating eyes from the optional face area. Finally, optional face areas were normalization by rotating, scale, and clip processing by using returned position coordinate of two eyes. It can be used for human face identification. Experiments result show that normalized face image is realized by those face image detection and emendation methods, and standard human face library is obtained in the end.
{"title":"Obtaining Method of Standard Human Face Library in Human Face","authors":"H. Men, Xiaozhe Zhu, Lei Qin, J. Yu","doi":"10.1109/MVHI.2010.128","DOIUrl":"https://doi.org/10.1109/MVHI.2010.128","url":null,"abstract":"Aiming at static state colorful image, human face was detected by combined complexion division technology with edge detection technology. Firstly, optional face areas were obtained by the area threshold value. Secondly, Gabor transform was employed to locating eyes from the optional face area. Finally, optional face areas were normalization by rotating, scale, and clip processing by using returned position coordinate of two eyes. It can be used for human face identification. Experiments result show that normalized face image is realized by those face image detection and emendation methods, and standard human face library is obtained in the end.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"32 1","pages":"183-186"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73863020","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 traditional sorting algorithm of median filtering is optimized according to the hardware structure features of FPGA. FPGA is used to acquire the data parallelly for comparing the data of the same column in the median filtering window. Comparing results shared by adjacent filter window are saved temporarily to match the new round of median filtering by using FPGA internal resources. This method can reduce the comparing times from current 21 down to 13, and improve the algorithm efficiency nearly 40%.The experimental results prove that the optimized algorithm can filter a 1K×1K gray-level image in about 20ms, which ensure the proposed algorithm can be applied in the real-time image median filtering system.
{"title":"Sort Optimization Algorithm of Median Filtering Based on FPGA","authors":"Yan Lu, M. Dai, Lei Jiang, Shi Li","doi":"10.1109/MVHI.2010.145","DOIUrl":"https://doi.org/10.1109/MVHI.2010.145","url":null,"abstract":"The traditional sorting algorithm of median filtering is optimized according to the hardware structure features of FPGA. FPGA is used to acquire the data parallelly for comparing the data of the same column in the median filtering window. Comparing results shared by adjacent filter window are saved temporarily to match the new round of median filtering by using FPGA internal resources. This method can reduce the comparing times from current 21 down to 13, and improve the algorithm efficiency nearly 40%.The experimental results prove that the optimized algorithm can filter a 1K×1K gray-level image in about 20ms, which ensure the proposed algorithm can be applied in the real-time image median filtering system.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"52 1","pages":"250-253"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73868863","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}
With the increasingly competition in E-commerce, the analysis of the loss and value of consumers has become a key problem to the enterprise organization. A strong attributes restricted Bayesian classifier is described in the paper, the SANBC which is a restricted Bayesian classifier based on strong attributes extends the structure of the naïve Bayesian classifier through the adding of highlighting lines between strong and weak attributes so that the naïve Bayesian classifier can be weakened. The classifier could build a mathematics model to analyze the loss possibility based on the attributes of consumers, service, and the consume record of client. It is an effective research in client relation management for E-commerce.
{"title":"The Loss of Consumers' Analysis Model Based on Strong Attributes Restricted Bayesian Classifier","authors":"C. Zhou, Longjun Huang","doi":"10.1109/MVHI.2010.77","DOIUrl":"https://doi.org/10.1109/MVHI.2010.77","url":null,"abstract":"With the increasingly competition in E-commerce, the analysis of the loss and value of consumers has become a key problem to the enterprise organization. A strong attributes restricted Bayesian classifier is described in the paper, the SANBC which is a restricted Bayesian classifier based on strong attributes extends the structure of the naïve Bayesian classifier through the adding of highlighting lines between strong and weak attributes so that the naïve Bayesian classifier can be weakened. The classifier could build a mathematics model to analyze the loss possibility based on the attributes of consumers, service, and the consume record of client. It is an effective research in client relation management for E-commerce.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"61 1","pages":"14-16"},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74085570","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
扫码关注我们
求助内容：
应助结果提醒方式：