Flexible syntactic matching of curves

Yoram Gdalyahu, Daphna Weinshall

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We present a flexible curve matching algorithm which performs qualitative matching between curves that are only weakly similar. While for model based recognition it is sufficient to determine if two curves are identical or not, for image database organization a continuous similarity measure, which indicates the amount of similarity between the curves, is needed. We demonstrate how flexible matching can serve to define a suitable measure. Extensive experiments are described, using real images of 3D objects. Occluding contours are matched under partial occlusion and change of viewpoint, and even when the two objects are different (such as the two side views of a horse and a cow). Using the resulting similarity measure between images, automatic hierarchical clustering of an image database is also shown, which faithfully capture the real structure in the data.

Original languageAmerican English
Title of host publicationComputer Vision - ECCV 1998 - 5th European Conference on Computer Vision, Proceedings
EditorsBernd Neumann, Hans Burkhardt
PublisherSpringer Verlag
Number of pages17
ISBN (Print)3540646132, 9783540646136
StatePublished - 1998
Event5th European Conference on Computer Vision, ECCV 1998 - Freiburg, Germany
Duration: 2 Jun 19986 Jun 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th European Conference on Computer Vision, ECCV 1998

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.


Dive into the research topics of 'Flexible syntactic matching of curves'. Together they form a unique fingerprint.

Cite this