On Curve Matching

Research output: Contribution to journalArticlepeer-review


Two algorithms to find the longest common subcurve of two 2-D curves are presented. These algorithms are based on conversion of the curves into shape signature strings and application of string matching techniques to find long matching substrings. Then direct curve matching is applied to the corresponding ‘candidate’ subcurves to find the longest matching subcurve. The first algorithm is of complexity O(n), where n is the number of sample points on the curves. The second one, while being theoretically somewhat less efficient, proved to be robust and efficient in practical applications. Both algorithms solve the problem for general curves without being dependent on some set of special points on the curves. The algorithms have industrial applications to problems of object assembly and object recognition. Experimental results are included. The algorithms can be easily extended to the 3-D case.

Original languageEnglish
Pages (from-to)483-489
Number of pages7
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number5
StatePublished - May 1990


  • Computer vision
  • curvature
  • curve matching
  • machine intelligence
  • object recognition
  • part assembly
  • pattern recognition
  • string matching


Dive into the research topics of 'On Curve Matching'. Together they form a unique fingerprint.

Cite this