Abstract
dc:description.abstract<p>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 a least squares 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 develop a genetic algorithm which searches for the best ("almost the best") assignment efficiently. To map the point pattern matching into the framework of a genetic algorithm, we use a fitness function which inversely proportional to the match error, a scheme to encode an assignment between two sets of points into a string, and we also introduce a new genetic operator known as "Mixed-type Partial Matching Crossover." Experimental results have demonstrated the robustness and the fast convergence of the algorithm. The proposed algorithm can be applied to n-dimensional point patterns and any transformation, but we only present results for two-dimensional point patterns and a similarity transformation.</p>
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Electrical Engineering - (M.S.)
- Discipline thesis:degree_discipline
- Electrical and Computer Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chen, Minghwang
- Contributors dc:contributor
-
- Nirwan Ansari
- Edwin Hou
- Zoran Siveski
Subjects
dc:subject × 2Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.njit.edu/theses/2568