Evolutionary programming for fast and robust point between matching

Ashish Agrawal, Nirwan Ansari, Edwin S.H. Hou

Research output: Contribution to conferencePaperpeer-review

10 Scopus citations

Abstract

Matching model point patterns to observed point patterns is of important concern in machine vision. Conventional search algorithms not only fail to arrive at the optimal match, but are computationally expensive, time consuming, and search the solution space sequentially. This paper presents a fast, inexpensive, algorithmically and operationally parallel Evolutionary Program (EP) for optimal point pattern matching based on a stochastic and heuristic optimization framework. Novel, knowledge-based, genetic operators are defined and are dynamically controlled to achieve 'fast fine tuning' and an optimal global search by efficiently combining the elements of 'gradient descent' and 'random search.' The developed EP algorithm outperforms existing techniques and is robust as it achieves a fast, optimal pattern match even in the presence of high noise and incomplete data sets, with insignificant degradation.

Original languageEnglish (US)
Pages1777-1782
Number of pages6
StatePublished - Dec 1 1994
EventProceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) - Orlando, FL, USA
Duration: Jun 27 1994Jun 29 1994

Other

OtherProceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7)
CityOrlando, FL, USA
Period6/27/946/29/94

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Evolutionary programming for fast and robust point between matching'. Together they form a unique fingerprint.

Cite this