ON CURVE MATCHING.

Haim Wolfson

ON CURVE MATCHING.

Haim Wolfson^*

^*Corresponding author for this work

New York University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

An algorithm to find the longest common subcurve of two 2-D curves is presented. It proved to be robust and efficient in practical applications. The algorithm is 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 algorithm has industrial applications to problems of object assembly and object recognition. Experimental results are included.

Original language	English
Title of host publication	Unknown Host Publication Title
Publisher	IEEE
Pages	307-310
Number of pages	4
ISBN (Print)	0818607793
State	Published - 1987
Externally published	Yes

Cite this

@inproceedings{e534793387ad48b29392cf998d4346d0,

title = "ON CURVE MATCHING.",

abstract = "An algorithm to find the longest common subcurve of two 2-D curves is presented. It proved to be robust and efficient in practical applications. The algorithm is 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 algorithm has industrial applications to problems of object assembly and object recognition. Experimental results are included.",

author = "Haim Wolfson",

year = "1987",

language = "אנגלית",

isbn = "0818607793",

publisher = "IEEE",

pages = "307--310",

booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - ON CURVE MATCHING.

AU - Wolfson, Haim

PY - 1987

Y1 - 1987

N2 - An algorithm to find the longest common subcurve of two 2-D curves is presented. It proved to be robust and efficient in practical applications. The algorithm is 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 algorithm has industrial applications to problems of object assembly and object recognition. Experimental results are included.

AB - An algorithm to find the longest common subcurve of two 2-D curves is presented. It proved to be robust and efficient in practical applications. The algorithm is 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 algorithm has industrial applications to problems of object assembly and object recognition. Experimental results are included.

UR - https://www.scopus.com/pages/publications/0023563782

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0023563782

SN - 0818607793

SP - 307

EP - 310

BT - Unknown Host Publication Title

PB - IEEE

ER -

ON CURVE MATCHING.

Abstract

Other files and links

Fingerprint

Cite this