On Shape Similarity

Konstantin Y. Kupeev, Haim J. Wolfson

Research output: Contribution to journalConference articlepeer-review

Abstract

An algorithm for the detection of ‘perceptual similarity’ among planar shapes is suggested. Current state-of-the-art matching algorithms deal mainly with shapes which are similar modulo a well defined geometric transfomation. The goal of this paper is to suggest a similakty measure among shapes which ‘look similar’, such as different fonts of a letter OT pictures of different ‘perceptually similar’ chairs. The essence of OUT approach consists in the representation of the shapes as special weighted graphs, the vertices of which represent the ‘lumps’ of the shapes in a given orientation. Then, these graphs are gradually reduced by a ‘small leaf’ trimming procedure until the resulting graphs are isomorphic. A similarity measure is calculated based on this representation. Since the graphs are orientation dependent, the Similarity measure is minimized over all orientations of one of the shapes. Experimental results of pairwise comparisons of a 24 shape database are presented.

Original languageEnglish
Pages (from-to)227-231
Number of pages5
JournalProceedings - International Conference on Pattern Recognition
Volume1
DOIs
StatePublished - 1994
EventProceedings of the 12th IAPR International Conference on Pattern Recognition. Part 1 (of 3) - Jerusalem, Isr
Duration: 9 Oct 199413 Oct 1994

Funding

FundersFunder number
French Ministry of Research and Technology
Ministry of Science and Technology, Israel

    Fingerprint

    Dive into the research topics of 'On Shape Similarity'. Together they form a unique fingerprint.

    Cite this