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

Proceedings IEEE International Joint Symposia on Intelligence and Systems最新文献

筛选
英文 中文
Solving constraint satisfaction problems by a genetic algorithm adopting viral infection 采用病毒感染的遗传算法求解约束满足问题
Proceedings IEEE International Joint Symposia on Intelligence and Systems Pub Date : 1996-11-04 DOI: 10.1109/IJSIS.1996.565053
H. Kanoh, K. Hasegawa, M. Matsumoto, S. Nishihara, N. Kato
{"title":"Solving constraint satisfaction problems by a genetic algorithm adopting viral infection","authors":"H. Kanoh, K. Hasegawa, M. Matsumoto, S. Nishihara, N. Kato","doi":"10.1109/IJSIS.1996.565053","DOIUrl":"https://doi.org/10.1109/IJSIS.1996.565053","url":null,"abstract":"Several approximate algorithms have been reported to solve large constraint satisfaction problems (CSPs) in a practical time. While these papers discuss techniques to escape from local optima, the present paper describes a method that actively performs global search. The present method is to improve the rate of search of genetic algorithms using viral infection instead of mutation. The partial solutions of a CSP are considered to be viruses and a population of viruses is created as well as a population of candidate solutions. Search for a solution is conducted by crossover infection substitutes the gene of a virus for the locus decided by the virus. Experimental results using randomly generated CSPs prove that the proposed method is faster than a usual genetic algorithm in finding a solution when the constraint density of a CSP is low.","PeriodicalId":437491,"journal":{"name":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121248779","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}
引用次数: 10
An alternative differential gradient edge contrast operator suitable for use within high speed pyramid-based imaging systems 一种替代差分梯度边缘对比算子，适用于高速金字塔成像系统
Proceedings IEEE International Joint Symposia on Intelligence and Systems Pub Date : 1996-11-04 DOI: 10.1109/IJSIS.1996.565082
W. D. Toczyski, N. Papanikolopoulos
{"title":"An alternative differential gradient edge contrast operator suitable for use within high speed pyramid-based imaging systems","authors":"W. D. Toczyski, N. Papanikolopoulos","doi":"10.1109/IJSIS.1996.565082","DOIUrl":"https://doi.org/10.1109/IJSIS.1996.565082","url":null,"abstract":"Numerous edge operators, kernels and directional filters have been proposed, and edge detection is a well-established and mature area of computer vision. Despite this, in developing a real-time, pyramid-based imaging system, inadequacies in the standard, commonly used techniques have lead us to implement an alternate set of simple directional filters that combine to act as an edge contrast operator fulfilling the familiar requirements for: (1) speed, and (2) a high localization of response. Within our application, this operator set is proving superior to the classical kernels at preserving the key requirement (2) as the operator's edge response energies are propagated up to pyramid levels of lower resolution for further recursive processing. Our scheme is shown to provide an unified response to both step and line edge types, and acceptable responses in the presence of anticipated noise levels. The method is direct and of low complexity and general utility.","PeriodicalId":437491,"journal":{"name":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131197482","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
Evolution of ultrasimple virtual robots 超简单虚拟机器人的进化
Proceedings IEEE International Joint Symposia on Intelligence and Systems Pub Date : 1996-11-04 DOI: 10.1109/IJSIS.1996.565066
D. Ashlock, J. Walker, J. Oliver
{"title":"Evolution of ultrasimple virtual robots","authors":"D. Ashlock, J. Walker, J. Oliver","doi":"10.1109/IJSIS.1996.565066","DOIUrl":"https://doi.org/10.1109/IJSIS.1996.565066","url":null,"abstract":"A genetic algorithm is presented to design virtual robots that perform a variety of different tasks. In all cases the robots are attempt to locate radiative sources. The fitness heuristic, number of sources, and boundary types of the world are varied. In all cases the genetic algorithm produced working designs. Designs are significantly specialized for the varied environments.","PeriodicalId":437491,"journal":{"name":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123184976","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}
引用次数: 7
A segmentation algorithm for noisy images 噪声图像的分割算法
Proceedings IEEE International Joint Symposia on Intelligence and Systems Pub Date : 1996-11-04 DOI: 10.1109/IJSIS.1996.565072
Ying Xu, V. Olman, E. Uberbacher
{"title":"A segmentation algorithm for noisy images","authors":"Ying Xu, V. Olman, E. Uberbacher","doi":"10.1109/IJSIS.1996.565072","DOIUrl":"https://doi.org/10.1109/IJSIS.1996.565072","url":null,"abstract":"This paper presents a 2-D image segmentation algorithm and addresses issues related to its performance on noisy images. The algorithm segments an image by first constructing a minimum spanning tree representation of the image and then partitioning the spanning tree into subtrees representing different homogeneous regions. The spanning tree is partitioned in such a way that the sum of gray-level variations over all partitioned subtrees is minimized under the constraints that each subtree has at least a specified number of pixels and two adjacent subtrees have significantly different \"average\" gray-levels. Two types of noise, transmission errors and Gaussian additive noise, are considered and their effects on the segmentation algorithm are studied. Evaluation results have shown that the segmentation algorithm is robust in the presence of these two types of noise.","PeriodicalId":437491,"journal":{"name":"Proceedings IEEE International Joint Symposia on Intelligence and Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127075185","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}
引用次数: 8
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信