Document Type
Thesis
Date of Award
10-31-1992
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical and Computer Engineering
First Advisor
Nirwan Ansari
Second Advisor
Edwin Hou
Third Advisor
Zoran Siveski
Abstract
The problem we consider is to find a subset of points in a pattern that best match to a subset of points in another pattern through a transformation in an optimal sense. Exhaustive search to find the best assignment mapping one set of points to another set is, if the number of points that are to be matched is large, computationally expensive. We propose two stochastic searching techniques - a genetic algorithm and simulated annealing to search for the best ("almost the best") assignment efficiently. To make the comparison between GA and SA fair, we introduce a piece-wise linear cooling schedule for the SA. As compared to conventional searching techniques such as simple hill climbing and random search techniques, the proposed methods are able to attain better solutions much faster. The proposed methods can be applied to n-dimensional point patterns and any transformation, but we only present results for two-dimensional point patterns and similarity transformations.
Recommended Citation
Chen, Erh-Chin, "Point pattern matching by heuristic methods : a genetic algorithm and simulated annealing" (1992). Theses. 2234.
https://digitalcommons.njit.edu/theses/2234
