.png){kind=icon}
返回
A cascaded genetic algorithm for efficient optimization and pattern matching
.png){kind=icon}
PRE
AI
DOI：10.1016/S0262-8856(02)00019-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A modified genetic algorithm (GA) based search strategy is presented here that is computationally more efficient than the conventional GA. Here the idea is to start a GA with the chromosomes of small length. Such chromosomes represent possible solutions with coarse resolution. A finite space around the position of solution in the first stage is subject to the GA at the second stage. Since this space is smaller than the original search space, chromosomes of same length now represent finer resolution. In this way, the search progresses from coarse to fine solution in a cascaded manner. Since chromosomes of small length are used at each stage, the overall approach becomes computationally more efficient than a single stage algorithm with the same degree of final resolution. The effectiveness of the proposed GA has been demonstrated for the optimization of some synthetic functions and on pattern recognition problem namely dot pattern matching and object matching with edge map. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
genetic algorithm
search technique
chromosome
mutation
optimization
dot pattern matching
pattern recognition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
暂无机构信息
引用论文
Application of neural networks and genetic algorithms in the classification of endothelial cells神经网络和遗传算法在内皮细胞分类中的应用
.png){kind=icon}
PREAI
分享收藏分享收藏
分享收藏Gravity assists maneuver in the problem of extension accessible landing areas on the Venus surface
PREAI
分享收藏
查看更多内容