Degree Type
Thesis
Date of Award
2011
Degree Name
Master of Science
Department
Computer Science
First Advisor
Yan-bin Jia
Abstract
In this thesis, we presents a new algorithm that finds the longest partial match between two space curves. The algorithm iteratively extends an initial matching portion of two curves within some tolerance over the matching quality. Each iteration adjusts the matching transformation (rotation, scale, and translation) to handle noisy data more robustly and to enlarge the matched portion. To control the matching accuracy, a statistical threshold is introduced to stop the iterative extension. Experiment shows that the algorithm has a comparable accuracy to that of the well known ICP algorithm but its efficiency is improved by an order of magnitude. The algorithm has been demonstrated over synthetic and range data. Experiment shows that it adjusts well to noise distributions and performs effectively over curves of complex shapes.
Copyright Owner
Hyuntae Na
Copyright Date
2011
Language
en
Date Available
2012-04-30
File Format
application/pdf
File Size
50 pages
Recommended Citation
Na, Hyuntae, "An online algorithm for matching noisy space curves with statistical error analysis" (2011). Graduate Theses and Dissertations. 12239.
https://lib.dr.iastate.edu/etd/12239
