Steady state memetic algorithm for partial shape matching

Ender Ozcan, Chilukuri K. Mohan

Research output: Chapter in Book/Entry/PoemConference contribution

6 Scopus citations


Shape matching teclmiques are important in machine intelligence, especially in applications such as robotics. Currently, there are three major approaches to shape recognition: statistical, syntactic and neural approaches. This paper presents a fourth approach: evolutionary algorithms. A steady state memetic algorithm is shown to be successful in matclfing shapes even when they are partially obscured, and even in the presence of noise in the input image.

Original languageEnglish (US)
Title of host publicationEvolutionary Programming VII - 7th International Conference, EP 1998, Proceedings
EditorsV.W. Porto, N. Saravanan, D. Waagen, A.E. Eiben
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540648917, 9783540648918
StatePublished - 1998
Externally publishedYes
Event7th Annual Conference on Evolutionary Programming, EP 1998 - San Diego, United States
Duration: Mar 25 1998Mar 27 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other7th Annual Conference on Evolutionary Programming, EP 1998
Country/TerritoryUnited States
CitySan Diego

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Steady state memetic algorithm for partial shape matching'. Together they form a unique fingerprint.

Cite this