Evolutionary programming for fast and robust point pattern matching
Ankur Agrawal, Nirwan Ansari, E.S.H. Hou · 2002
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 optimisation 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.>