Title :
Matching of 3-D curves
Author :
Heisterkamp, Douglas R. ; Bhattacharya, Prabir
Author_Institution :
Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA
Abstract :
We show that the minimum value of a distance measure between 3-D polygonal arcs of equal length is the smallest eigenvalue of a certain matrix. Using this we develop a mismatch measure and a matching algorithm for 3-D polygonal arcs of unequal lengths
Keywords :
computational geometry; eigenvalues and eigenfunctions; matrix algebra; 3-D curves matching; 3-D polygonal arcs; distance measure; matching algorithm; mismatch measure; smallest eigenvalue; Computer science; Eigenvalues and eigenfunctions; Inspection; Length measurement; Linear matrix inequalities; Loss measurement; Machine vision; Mobile robots; Q measurement; Robot vision systems;
Conference_Titel :
Robotics and Automation, 1996. Proceedings., 1996 IEEE International Conference on
Conference_Location :
Minneapolis, MN
Print_ISBN :
0-7803-2988-0
DOI :
10.1109/ROBOT.1996.509244
