Back to search

NJIT

Fast point pattern matching by heuristic and stochastic optimization techniques

Abstract

dc:description.abstract

This work is concerned with one of the methodologies used in the final stages of machine vision: the matching of model point patterns to observed point patterns. Conventional search methods not only fail to arrive at the optimal match, but are also computationally expensive and time consuming. To arrive at the optimal pattern match, stochastic and heuristic optimization as the search technique, exploiting Simulated Annealing (SA), Evolutionary Programming (EP) and Mean Field Annealing (MFA), are explored in detail. A comparison of results obtained using SA versus "hill-climbing" and "exhaustive search" techniques, and results of EP are presented. The relative effectiveness of these optimizing search algorithms over other conventional algorithms will be demonstrated. Finally, the limitations of MFA are discussed.

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
  • Agrawal, Ashish
Contributors dc:contributor
  • Nirwan Ansari
  • Edwin Hou
  • Yun Q. Shi

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/1234

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Agrawal, Ashish. Fast point pattern matching by heuristic and stochastic optimization techniques. https://digitalcommons.njit.edu/theses/1234