发布求助
文献互助 智能选刊 最新文献

Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)最新文献

筛选
英文 中文
Intelligent control based on genetic algorithms-case study on mobile robot 基于遗传算法的智能控制——以移动机器人为例
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685455
Qingchun Meng, Sng Honglian, Changjiu Zhou, Hongbo Ji, Dong Hao
{"title":"Intelligent control based on genetic algorithms-case study on mobile robot","authors":"Qingchun Meng, Sng Honglian, Changjiu Zhou, Hongbo Ji, Dong Hao","doi":"10.1109/IJSIS.1998.685455","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685455","url":null,"abstract":"The application of genetic algorithms to mobile robot dynamic control and path planning is described. A new genetic strategy, GASC (genetic algorithm with symmetric code), is used in this application. Robot dynamic control based on dynamic model and its path planning are converted into an optimization problem with some constraints, then GASC is employed to solve this problem. In GASC, some new genetic techniques have been put forward. A genetic strategy is employed in the robot system's intelligent control. The simulation results obtained show that these techniques are indispensable to enhance the performance of our genetic strategy. GASC out performs the traditional genetic algorithms greatly in control find path planning of a mobile robot. The population of GAs based on symmetric codes theory in our generic strategy can automatically satisfy the velocities constraints at the final point in a robot path.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128083135","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}
引用次数: 4
A system for automatic extraction of road network from maps 从地图上自动提取道路网的系统
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685476
Ding Bin, W. K. Cheong
{"title":"A system for automatic extraction of road network from maps","authors":"Ding Bin, W. K. Cheong","doi":"10.1109/IJSIS.1998.685476","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685476","url":null,"abstract":"With the aid of computer technology, geographical information systems (GIS), which have the ability to handle a large amount of geographical data in it, have been developed. In particular, substantial efforts have been devoted to the conversion of paper-based map into computer readable form which is suitable for input into GIS. This paper presents a system for extracting road network from paper-based urban maps. First, digitized map image is input to the system, then processing algorithms are carried out to extract road network from the map image. Finally, the extracted road network can be output to GIS. In this system, a set of algorithms has been developed for character separation, perceptual grouping, road network extraction and some other processing. This system has been applied to many urban maps. It is shown that the system can extract road networks in various cases successfully.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131648772","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}
引用次数: 20
Error repair in human handwriting: an intelligent user interface for automatic online handwriting recognition 人类笔迹的错误修复:用于自动在线笔迹识别的智能用户界面
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685482
W. Hurst, Jie Yang, A. Waibel
{"title":"Error repair in human handwriting: an intelligent user interface for automatic online handwriting recognition","authors":"W. Hurst, Jie Yang, A. Waibel","doi":"10.1109/IJSIS.1998.685482","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685482","url":null,"abstract":"Since both users and recognition algorithms make mistakes, it is desirable for the user interface of a handwriting recognition system to have mechanisms recovering from errors. We address the problem of error repair in online handwriting recognition. First, we perform a user study on error occurrences and corresponding repair patterns in human handwriting. Based on a data analysis, we have identified typical types of errors and repair patterns. We then propose methods to deal with error repair in an online handwriting system. We have developed a prototype system to demonstrate and evaluate the proposed error handling mechanisms. The system extends NPen/sup ++/, an online handwriting recognition system developed in our lab, by providing error repair abilities to users in addition to its high recognition rate. The experimental results indicate that the error handling mechanisms can significantly improve the system performance in case of the data containing error repair.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131806069","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}
引用次数: 5
Visible speech modelling and hybrid hidden Markov models/neural networks based learning for lipreading 基于唇读的可见语音建模和混合隐马尔可夫模型/神经网络学习
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685470
A. Rogozan, P. Deléglise
{"title":"Visible speech modelling and hybrid hidden Markov models/neural networks based learning for lipreading","authors":"A. Rogozan, P. Deléglise","doi":"10.1109/IJSIS.1998.685470","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685470","url":null,"abstract":"This paper describes a new approach for automatic visible speech recognition based on hybrid hidden Markov models/neural networks. Suitable geometric features extracted from speaker's lip shapes are used to train the speech recognizer with nonsense sentences. First we describe the use of a geometrical-based model for visible speech and we outline a self-organising-map-based approach to determine the visual specific recognition units suitable for our speaker-dependent visible speech recognition task. Then we describe five automatic lipreading systems we developed according to different classification techniques: hidden Markov models, neural networks and hybrid hidden Markov models/neural networks. All these systems are tested on a connected letter recognition task. Finally, the performance comparison underlines that a hybrid hidden Markov models/neural networks based architecture is the most promising for automatic lipreading purposes.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130982652","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}
引用次数: 4
Crossover operators with adaptive probability 具有自适应概率的交叉算子
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685408
Mu-Song Chen, Fong Hang Liao
{"title":"Crossover operators with adaptive probability","authors":"Mu-Song Chen, Fong Hang Liao","doi":"10.1109/IJSIS.1998.685408","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685408","url":null,"abstract":"Genetic algorithms (GAs) are adaptive methods, which can be employed to solve search and optimization problems. The GA relies on genetic operators to exchange gene between individuals for generating better offspring. An important issue to execute GA efficiently is to maintain population diversity and to sustain local improvement in the search stage. However, both effects always hinder each other. We propose to apply different kinds of crossover operators, i.e. arithmetic and BLX-/spl alpha/ crossovers, to control the diversity and convergence of the GA in continuous-space framework. We also utilize self-adaptation method to control the probability of crossover such that the balance of exploitation and exploration can be kept. It is shown empirically that the proposed methods outperform the classical GA strategy on several benchmark functions.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698555","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}
引用次数: 1
Method to achieve better performance in genetic algorithms applied to time-constrained, multi-solution problems 将性能更好的遗传算法应用于时间约束、多解问题
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685406
T. Dickens, C. L. Karr
{"title":"Method to achieve better performance in genetic algorithms applied to time-constrained, multi-solution problems","authors":"T. Dickens, C. L. Karr","doi":"10.1109/IJSIS.1998.685406","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685406","url":null,"abstract":"It has been demonstrated that a periodic complete reinitialization of a running genetic algorithm (GA) solution will result in a higher convergence rate for a series of problems. This technique, referred to as the \"total-comet-strike\" operator, has been applied to a number of multi-solution GA problems. Where it has been used, an improvement has been shown both in the number of cases that converge within an imposed time limit and in the average time required for each case.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"13 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116216214","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}
引用次数: 0
Neural-network-based compression algorithm for gray scale images 基于神经网络的灰度图像压缩算法
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685489
I. Valova, Y. Kosugi
{"title":"Neural-network-based compression algorithm for gray scale images","authors":"I. Valova, Y. Kosugi","doi":"10.1109/IJSIS.1998.685489","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685489","url":null,"abstract":"This paper presents an image compression algorithm for gray scale images, based on neural networks. According to this algorithm the image will be first decomposed into Hadamard set of functions and second, the coefficients from the decomposition will be dynamically clustered by a newly proposed dynamic adaptive clustering method (DACM). We show that DACM converges to approximate the optimum solution based on the least sum of squares criterion theoretically and experimentally. We applied the compression method to various gray scale images and show its efficiency in providing high compression rates. In order to show some comparative results for the proposed method, we have chosen the well-known JPEG. Its algorithm has similar structure and therefore is a good basis for comparison. The results from the gray scale images experiments are in favor of the proposed method.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423117","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}
引用次数: 1
A neuro-fuzzy-GA system architecture for helping the knowledge acquisition process 一种有助于知识获取的神经模糊遗传算法系统架构
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685417
L. Brasil, F. de Azevedo, J. Barreto, M. Noirhomme-Fraiture
{"title":"A neuro-fuzzy-GA system architecture for helping the knowledge acquisition process","authors":"L. Brasil, F. de Azevedo, J. Barreto, M. Noirhomme-Fraiture","doi":"10.1109/IJSIS.1998.685417","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685417","url":null,"abstract":"The knowledge acquisition process consists on extracting knowledge of a domain expert. This work aims to minimize the intrinsic difficulties of the knowledge acquisition process. For achieve this purpose, all possible rules from the domain expert and a set of example were obtained for a short time interval. The proposed hybrid expert system minimizes the knowledge acquisition difficulties using a new methodology. To build this hybrid architecture, several tools were used: symbolic paradigm, connectionist paradigm, fuzzy logic and genetic algorithm.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"17 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574832","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}
引用次数: 2
On clone assembly problems: an error-tolerant test for interval graphs 克隆装配问题:区间图的容错测试
Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174) Pub Date : 1998-03-21 DOI: 10.1109/IJSIS.1998.685428
W. Hsu, Wei-Fu Lu
{"title":"On clone assembly problems: an error-tolerant test for interval graphs","authors":"W. Hsu, Wei-Fu Lu","doi":"10.1109/IJSIS.1998.685428","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685428","url":null,"abstract":"An important problem in DNA physical mapping is to reassemble the clone fragments to determine the structure of the entire molecule. The error-free version of this problem can be modeled as an interval graph recognition problem, where an interval graph is the intersection graph of a collection of intervals. However, since the data collected from laboratories almost surely contain some errors, traditional recognition algorithms can hardly be applied directly. We present a new test which has the following features: 1) the algorithm assembles the clones efficiently when the data is error-free; 2) in a case when the error rate is small (say, less than 3%) the test can likely detect and automatically correct the following three types of errors false positives, false negatives and chimeric clones; and 3) the test also identifies those parts of the data that are problematic, thus allowing biologists to perform further experiments to clean up the data.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132079842","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信