3-D curve matching using splines

A machine vision algorithm to find the longest common subcurve of two 3-D curves is presented. The curves are represented by splines fitted through sequences of sample points extracted from dense range data. The approximated 3-D curves are transformed into 1-D numerical strings of rotation and translation invariant shape signatures, based on a multiresolution representation of the curvature and torsion values of the space curves. The shape signature strings are matched using an efficient hashing technique that finds longest matching substrings. The results of the string matching stage are later verified by a robust, least-squares, 3-D curve matching technique, which also recovers the Euclidean transformation between the curves being matched. This algorithm is of average complexity O(n) where n is the number of the sample points on the two curves. The algorithm has applications in assembly and object recognition tasks. Results of assembly experiments are included.

[1]  W. Grimson,et al.  Model-Based Recognition and Localization from Sparse Range or Tactile Data , 1984 .

[2]  Robert C. Bolles,et al.  3DPO: A Three- Dimensional Part Orientation System , 1986, IJCAI.

[3]  Richard O. Duda,et al.  Use of Range and Reflectance Data to Find Planar Surface Regions , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  M. Hebert,et al.  The Representation, Recognition, and Locating of 3-D Objects , 1986 .

[5]  Robert C. Bolles,et al.  Locating Partially Visible Objects: The Local Feature Focus Method , 1980, AAAI.

[6]  Farzin Mokhtarian,et al.  Multi-scale description of space curves and three-dimensional objects , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  W. Eric L. Grimson,et al.  The combinatorics of local constraints in model-based recognition and localization from sparse data , 1984, JACM.

[8]  Marc H. Raibert,et al.  Running With Symmetry , 1986 .

[9]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[10]  Haim J. Wolfson.  On curve matching , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Jean Ponce,et al.  Toward a surface primal sketch , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[12]  Charles R. Dyer,et al.  Model-based recognition in robot vision , 1986, CSUR.

[13]  Edith Schonberg,et al.  Object recognition by three‐dimensional curve matching , 1986, Int. J. Intell. Syst..

[14]  Micha Sharir,et al.  Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic Curves , 1987 .

[15]  Edith Schonberg,et al.  Two-Dimensional, Model-Based, Boundary Matching Using Footprints , 1986 .

[16]  Ramesh C. Jain,et al.  Three-dimensional object recognition , 1985, CSUR.

[17]  H. Wolfson,et al.  Solving jigsaw puzzles by computer , 1988 .

[18]  Haim J. Wolfson,et al.  An improved model-based matching method using footprints , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.