This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On curve matching
May 1990 (vol. 12 no. 5)
pp. 483-489

Two algorithms to find the longest common subcurve of two 2D 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, followed by direct curve matching of 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 of 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 3D case.

[1] H. Freeman and L. Garder, "Apictorial jigsaw puzzles: The computer solution of a problem in pattern recognition,"IEEE Trans. Electron. Comput., vol. EC-13, pp. 118-127, Apr. 1964.
[2] G. M. Radack and N. I. Badler, "Jigsaw puzzle matching using a boundary-centered polar encoding,"Comput. Graphics Image Processing, vol. 19, pp. 1-17, 1982.
[3] H. Wolfson, E. Schonberg, A. Kalvin, and Y. Lamdan, "Solving jigsaw puzzles using computer vision,"Ann. Oper. Res., vol. 12, pp. 51-64, 1988.
[4] N. Ayache and O. D. Faugeras, "HYPER: A new approach for the recognition and positioning of two-dimensional objects,"IEEE Trans. Patt. Anal. Machine Intell., vol. 8, no. 1, pp. 44-54, 1986.
[5] J. L. Turney, T. N. Mudge, and R. A. Volz, "Recognizing partially occluded parts,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, no. 4, pp. 410-421, July 1985.
[6] A. Kalvin, E. Schonberg, J. Schwartz, and M. Sharir, "Two-dimensional, model-based, boundary matching using footprints."Int. J. Robotics Res., vol. 5, no. 4, pp. 38-55, 1986.
[7] H. Wolfson, "On curve matching," inProc. IEEE Comput. Soc. Workshop Computer Vision, Miami Beach, FL. Nov. 1987, pp. 307- 310.
[8] M. D. Ernst and B. E. Flinchbaugh, "Image/map correspondence using curve matching," presented at the AAAI Robot Navigation Symp., Mar. 28-30, 1989.
[9] J. T. Schwartz and M. Sharir, "Identification of objects in two and three dimensions by matching noisy characteristic curves,"Int. J. Robotics Res., vol. 6, no. 2, pp. 29-44, 1987.
[10] H. Freeman, "Shape description via the use of critical points,"Pattern Recogn., vol. 10, pp. 159-166, 1978.
[11] J. Hong and H. J. Wolfson, "An improved model-based matching method using footprints," inProc. Ninth Int. Conf. Pattern Recognition, Rome, Italy, Nov. 14-18, 1988.
[12] P. Weiner, "Linear pattern matching algorithms," inProc. 14th Annu. Symp. Switching and Automata Theory, IEEE Comput. Soc., 1973, pp. 1-11.
[13] E. McCreight, "A space-economical suffix tree construction algorithm,"J. ACM, vol. 23, pp. 262-272, Apr. 1976.
[14] D. T. Lee and F. P. Preparata, "Euclidean shortest paths in the presence of rectilinear bariers,"Networks, vol. 14, pp. 393-410, 1984.
[15] J. J. Stoker,Differential Geometry. New York: Wiley-Interscience, 1969.
[16] E. Kishon and H. Wolfson, "3-D curve matching," inProc. AAAI Workshop Spatial Reasoning and Multisensor Fusion, St. Charles, IL, Oct. 1987, pp. 250-261.

Index Terms:
curve matching; 2D curves; shape signature strings; string matching; object recognition; computational complexity; pattern recognition; picture processing
Citation:
H.J. Wolfson, "On curve matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 5, pp. 483-489, May 1990, doi:10.1109/34.55108
Usage of this product signifies your acceptance of the Terms of Use.